Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r308-tajo-171654461500257.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r308-tajo-171654461500257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.9K Apr 12 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 11:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 12 13:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 13:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K May 18 16:43 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 1717191034762

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=gold2023
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 202304061127
[2024-05-31 21:30:36] [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]
[2024-05-31 21:30:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:30:36] [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.
[2024-05-31 21:30:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 21:30:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 479 ms
[2024-05-31 21:30:36] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 694 PT places and 12142.0 transition bindings in 22 ms.
[2024-05-31 21:30:37] [INFO ] Unfolded HLPN to a Petri net with 694 places and 12080 transitions 112619 arcs in 186 ms.
[2024-05-31 21:30:37] [INFO ] Unfolded 38 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-31 21:30:37] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-31 21:30:37] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-31 21:30:37] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 30 places in 26 ms
Reduce places removed 30 places and 30 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2024-05-31 21:30:38] [INFO ] Flatten gal took : 831 ms
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1230 ms. (steps per millisecond=8 ) properties (out of 36) seen :6
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 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 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
[2024-05-31 21:30:38] [INFO ] Flatten gal took : 209 ms
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 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 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 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 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 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 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 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
[2024-05-31 21:30:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8781683096226285135.gal : 81 ms
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
[2024-05-31 21:30:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15292214768483941672.prop : 18 ms
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8781683096226285135.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15292214768483941672.prop' '--nowitness' '--gen-order' 'FOLLOW'
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 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
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 :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 26) seen :16
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
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
Running SMT prover for 10 properties.
[2024-05-31 21:30:39] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2024-05-31 21:30:39] [INFO ] Computed 92 invariants in 95 ms
Loading property file /tmp/ReachabilityCardinality15292214768483941672.prop.
Reachability property qltransition_31 is true.
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
[2024-05-31 21:30:41] [INFO ] [Real]Absence check using 85 positive place invariants in 34 ms returned sat
SDD proceeding with computation,32 properties remain. new max is 4
SDD size :5 after 6
[2024-05-31 21:30:41] [INFO ] [Real]Absence check using 85 positive and 7 generalized place invariants in 25 ms returned sat
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
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
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
[2024-05-31 21:30:42] [INFO ] After 1086ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:8
[2024-05-31 21:30:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Reachability property qltransition_33 is true.
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :123 after 185
[2024-05-31 21:30:42] [INFO ] After 275ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:8
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :185 after 260
[2024-05-31 21:30:43] [INFO ] After 670ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:8
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-31 21:30:43] [INFO ] After 2830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:8
[2024-05-31 21:30:43] [INFO ] [Nat]Absence check using 85 positive place invariants in 32 ms returned sat
[2024-05-31 21:30:43] [INFO ] [Nat]Absence check using 85 positive and 7 generalized place invariants in 29 ms returned sat
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
[2024-05-31 21:30:50] [INFO ] After 6136ms 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
[2024-05-31 21:30:51] [INFO ] After 1743ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-31 21:30:53] [INFO ] Deduced a trap composed of 337 places in 578 ms of which 1 ms to minimize.
[2024-05-31 21:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 769 ms
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :6015 after 12291
[2024-05-31 21:31:05] [INFO ] After 15588ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 2229 ms.
[2024-05-31 21:31:07] [INFO ] After 24430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 2101 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 1 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 318 ms. Remains 583 /664 variables (removed 81) and now considering 1869/1940 (removed 71) transitions.
[2024-05-31 21:31:10] [INFO ] Flow matrix only has 1860 transitions (discarded 9 similar events)
// Phase 1: matrix 1860 rows 583 cols
[2024-05-31 21:31:10] [INFO ] Computed 82 invariants in 70 ms
[2024-05-31 21:31:11] [INFO ] Dead Transitions using invariants and state equation in 931 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 41 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 1302 ms. Remains : 583/664 places, 1254/1940 transitions.
Incomplete random walk after 1000000 steps, including 65471 resets, run finished after 7664 ms. (steps per millisecond=130 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8811 resets, run finished after 1700 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:31:20] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2024-05-31 21:31:20] [INFO ] Computed 82 invariants in 79 ms
[2024-05-31 21:31:20] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2024-05-31 21:31:20] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-31 21:31:20] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:31:20] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2024-05-31 21:31:20] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 21:31:21] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:31:21] [INFO ] After 236ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:22] [INFO ] Deduced a trap composed of 238 places in 364 ms of which 2 ms to minimize.
[2024-05-31 21:31:22] [INFO ] Deduced a trap composed of 236 places in 321 ms of which 1 ms to minimize.
[2024-05-31 21:31:22] [INFO ] Deduced a trap composed of 236 places in 320 ms of which 1 ms to minimize.
[2024-05-31 21:31:23] [INFO ] Deduced a trap composed of 240 places in 366 ms of which 0 ms to minimize.
[2024-05-31 21:31:23] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 1 ms to minimize.
[2024-05-31 21:31:23] [INFO ] Deduced a trap composed of 236 places in 309 ms of which 1 ms to minimize.
[2024-05-31 21:31:24] [INFO ] Deduced a trap composed of 228 places in 301 ms of which 1 ms to minimize.
[2024-05-31 21:31:24] [INFO ] Deduced a trap composed of 234 places in 304 ms of which 1 ms to minimize.
[2024-05-31 21:31:24] [INFO ] Deduced a trap composed of 238 places in 300 ms of which 0 ms to minimize.
[2024-05-31 21:31:25] [INFO ] Deduced a trap composed of 244 places in 380 ms of which 0 ms to minimize.
[2024-05-31 21:31:26] [INFO ] Deduced a trap composed of 240 places in 382 ms of which 0 ms to minimize.
[2024-05-31 21:31:26] [INFO ] Deduced a trap composed of 234 places in 399 ms of which 0 ms to minimize.
[2024-05-31 21:31:27] [INFO ] Deduced a trap composed of 232 places in 389 ms of which 1 ms to minimize.
[2024-05-31 21:31:27] [INFO ] Deduced a trap composed of 236 places in 360 ms of which 0 ms to minimize.
[2024-05-31 21:31:28] [INFO ] Deduced a trap composed of 242 places in 326 ms of which 0 ms to minimize.
[2024-05-31 21:31:28] [INFO ] Deduced a trap composed of 234 places in 303 ms of which 0 ms to minimize.
[2024-05-31 21:31:28] [INFO ] Deduced a trap composed of 228 places in 347 ms of which 1 ms to minimize.
[2024-05-31 21:31:29] [INFO ] Deduced a trap composed of 226 places in 332 ms of which 0 ms to minimize.
[2024-05-31 21:31:29] [INFO ] Deduced a trap composed of 232 places in 351 ms of which 1 ms to minimize.
[2024-05-31 21:31:30] [INFO ] Deduced a trap composed of 240 places in 317 ms of which 1 ms to minimize.
[2024-05-31 21:31:31] [INFO ] Deduced a trap composed of 236 places in 358 ms of which 1 ms to minimize.
[2024-05-31 21:31:31] [INFO ] Deduced a trap composed of 238 places in 349 ms of which 1 ms to minimize.
[2024-05-31 21:31:32] [INFO ] Deduced a trap composed of 232 places in 392 ms of which 1 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 0 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 232 places in 354 ms of which 1 ms to minimize.
Reachability property qltransition_23 is true.
[2024-05-31 21:31:34] [INFO ] Deduced a trap composed of 230 places in 329 ms of which 1 ms to minimize.
[2024-05-31 21:31:34] [INFO ] Deduced a trap composed of 232 places in 336 ms of which 0 ms to minimize.
Reachability property qltransition_18 is true.
[2024-05-31 21:31:34] [INFO ] Deduced a trap composed of 228 places in 343 ms of which 1 ms to minimize.
Reachability property qltransition_12 is true.
[2024-05-31 21:31:35] [INFO ] Deduced a trap composed of 238 places in 393 ms of which 1 ms to minimize.
[2024-05-31 21:31:35] [INFO ] Deduced a trap composed of 236 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:31:36] [INFO ] Deduced a trap composed of 240 places in 352 ms of which 1 ms to minimize.
[2024-05-31 21:31:36] [INFO ] Deduced a trap composed of 230 places in 346 ms of which 7 ms to minimize.
[2024-05-31 21:31:37] [INFO ] Deduced a trap composed of 238 places in 324 ms of which 0 ms to minimize.
[2024-05-31 21:31:37] [INFO ] Deduced a trap composed of 230 places in 353 ms of which 1 ms to minimize.
Reachability property qltransition_0 is true.
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :12291 after 50070
[2024-05-31 21:31:38] [INFO ] Deduced a trap composed of 234 places in 347 ms of which 0 ms to minimize.
[2024-05-31 21:31:38] [INFO ] Deduced a trap composed of 236 places in 351 ms of which 2 ms to minimize.
[2024-05-31 21:31:38] [INFO ] Deduced a trap composed of 232 places in 368 ms of which 2 ms to minimize.
[2024-05-31 21:31:39] [INFO ] Deduced a trap composed of 232 places in 388 ms of which 1 ms to minimize.
[2024-05-31 21:31:40] [INFO ] Deduced a trap composed of 232 places in 390 ms of which 1 ms to minimize.
[2024-05-31 21:31:41] [INFO ] Deduced a trap composed of 226 places in 345 ms of which 1 ms to minimize.
[2024-05-31 21:31:41] [INFO ] Deduced a trap composed of 232 places in 303 ms of which 1 ms to minimize.
[2024-05-31 21:31:41] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 0 ms to minimize.
[2024-05-31 21:31:42] [INFO ] Deduced a trap composed of 230 places in 312 ms of which 1 ms to minimize.
[2024-05-31 21:31:42] [INFO ] Deduced a trap composed of 232 places in 296 ms of which 1 ms to minimize.
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 1 ms to minimize.
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 236 places in 340 ms of which 0 ms to minimize.
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 232 places in 377 ms of which 1 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 228 places in 358 ms of which 2 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 224 places in 358 ms of which 1 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 226 places in 340 ms of which 0 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 228 places in 362 ms of which 1 ms to minimize.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 228 places in 367 ms of which 0 ms to minimize.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 226 places in 403 ms of which 13 ms to minimize.
[2024-05-31 21:31:47] [INFO ] Deduced a trap composed of 228 places in 387 ms of which 1 ms to minimize.
[2024-05-31 21:31:48] [INFO ] Deduced a trap composed of 232 places in 390 ms of which 0 ms to minimize.
[2024-05-31 21:31:49] [INFO ] Deduced a trap composed of 236 places in 385 ms of which 1 ms to minimize.
[2024-05-31 21:31:50] [INFO ] Deduced a trap composed of 226 places in 352 ms of which 1 ms to minimize.
[2024-05-31 21:31:50] [INFO ] Deduced a trap composed of 234 places in 359 ms of which 2 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :50070 after 161419
[2024-05-31 21:31:51] [INFO ] Deduced a trap composed of 234 places in 353 ms of which 0 ms to minimize.
[2024-05-31 21:31:52] [INFO ] Deduced a trap composed of 232 places in 354 ms of which 0 ms to minimize.
[2024-05-31 21:32:01] [INFO ] Deduced a trap composed of 238 places in 391 ms of which 2 ms to minimize.
[2024-05-31 21:32:02] [INFO ] Deduced a trap composed of 242 places in 410 ms of which 3 ms to minimize.
[2024-05-31 21:32:03] [INFO ] Deduced a trap composed of 252 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:32:05] [INFO ] Deduced a trap composed of 242 places in 400 ms of which 4 ms to minimize.
[2024-05-31 21:32:06] [INFO ] Deduced a trap composed of 232 places in 408 ms of which 15 ms to minimize.
[2024-05-31 21:32:06] [INFO ] Deduced a trap composed of 238 places in 396 ms of which 2 ms to minimize.
[2024-05-31 21:32:07] [INFO ] Deduced a trap composed of 236 places in 382 ms of which 1 ms to minimize.
[2024-05-31 21:32:08] [INFO ] Deduced a trap composed of 234 places in 385 ms of which 1 ms to minimize.
[2024-05-31 21:32:08] [INFO ] Deduced a trap composed of 230 places in 379 ms of which 1 ms to minimize.
[2024-05-31 21:32:09] [INFO ] Deduced a trap composed of 230 places in 397 ms of which 1 ms to minimize.
[2024-05-31 21:32:09] [INFO ] Deduced a trap composed of 232 places in 380 ms of which 1 ms to minimize.
[2024-05-31 21:32:10] [INFO ] Deduced a trap composed of 232 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:32:10] [INFO ] Deduced a trap composed of 236 places in 333 ms of which 1 ms to minimize.
[2024-05-31 21:32:10] [INFO ] Deduced a trap composed of 224 places in 315 ms of which 0 ms to minimize.
[2024-05-31 21:32:11] [INFO ] Deduced a trap composed of 234 places in 334 ms of which 0 ms to minimize.
[2024-05-31 21:32:12] [INFO ] Deduced a trap composed of 232 places in 314 ms of which 0 ms to minimize.
[2024-05-31 21:32:12] [INFO ] Deduced a trap composed of 232 places in 370 ms of which 0 ms to minimize.
[2024-05-31 21:32:13] [INFO ] Deduced a trap composed of 230 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:32:13] [INFO ] Deduced a trap composed of 230 places in 352 ms of which 1 ms to minimize.
[2024-05-31 21:32:14] [INFO ] Deduced a trap composed of 232 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:32:14] [INFO ] Deduced a trap composed of 234 places in 384 ms of which 0 ms to minimize.
[2024-05-31 21:32:15] [INFO ] Deduced a trap composed of 232 places in 380 ms of which 1 ms to minimize.
[2024-05-31 21:32:15] [INFO ] Deduced a trap composed of 240 places in 379 ms of which 1 ms to minimize.
[2024-05-31 21:32:16] [INFO ] Deduced a trap composed of 238 places in 364 ms of which 0 ms to minimize.
[2024-05-31 21:32:17] [INFO ] Deduced a trap composed of 232 places in 399 ms of which 1 ms to minimize.
[2024-05-31 21:32:18] [INFO ] Deduced a trap composed of 232 places in 386 ms of which 1 ms to minimize.
[2024-05-31 21:32:18] [INFO ] Deduced a trap composed of 236 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:32:19] [INFO ] Deduced a trap composed of 232 places in 358 ms of which 1 ms to minimize.
[2024-05-31 21:32:19] [INFO ] Deduced a trap composed of 232 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:32:20] [INFO ] Deduced a trap composed of 228 places in 401 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :161419 after 413650
[2024-05-31 21:32:20] [INFO ] Deduced a trap composed of 226 places in 397 ms of which 1 ms to minimize.
[2024-05-31 21:32:21] [INFO ] Deduced a trap composed of 234 places in 393 ms of which 3 ms to minimize.
[2024-05-31 21:32:22] [INFO ] Deduced a trap composed of 240 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:32:22] [INFO ] Deduced a trap composed of 236 places in 401 ms of which 0 ms to minimize.
[2024-05-31 21:32:23] [INFO ] Deduced a trap composed of 238 places in 382 ms of which 0 ms to minimize.
[2024-05-31 21:32:23] [INFO ] Deduced a trap composed of 234 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:32:24] [INFO ] Deduced a trap composed of 238 places in 405 ms of which 0 ms to minimize.
[2024-05-31 21:32:24] [INFO ] Deduced a trap composed of 234 places in 347 ms of which 1 ms to minimize.
[2024-05-31 21:32:25] [INFO ] Deduced a trap composed of 232 places in 373 ms of which 1 ms to minimize.
[2024-05-31 21:32:25] [INFO ] Deduced a trap composed of 240 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 238 places in 368 ms of which 0 ms to minimize.
[2024-05-31 21:32:26] [INFO ] Deduced a trap composed of 242 places in 368 ms of which 0 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 244 places in 385 ms of which 1 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Deduced a trap composed of 236 places in 390 ms of which 3 ms to minimize.
[2024-05-31 21:32:28] [INFO ] Deduced a trap composed of 234 places in 368 ms of which 0 ms to minimize.
[2024-05-31 21:32:28] [INFO ] Deduced a trap composed of 238 places in 322 ms of which 0 ms to minimize.
[2024-05-31 21:32:29] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 1 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 232 places in 331 ms of which 1 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 236 places in 393 ms of which 1 ms to minimize.
[2024-05-31 21:32:31] [INFO ] Deduced a trap composed of 228 places in 353 ms of which 0 ms to minimize.
[2024-05-31 21:32:32] [INFO ] Deduced a trap composed of 230 places in 349 ms of which 1 ms to minimize.
[2024-05-31 21:32:32] [INFO ] Deduced a trap composed of 228 places in 368 ms of which 1 ms to minimize.
[2024-05-31 21:32:33] [INFO ] Deduced a trap composed of 234 places in 383 ms of which 0 ms to minimize.
[2024-05-31 21:32:33] [INFO ] Deduced a trap composed of 230 places in 387 ms of which 0 ms to minimize.
[2024-05-31 21:32:34] [INFO ] Deduced a trap composed of 230 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:32:36] [INFO ] Deduced a trap composed of 244 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:32:45] [INFO ] Trap strengthening (SAT) tested/added 116/116 trap constraints in 83702 ms
[2024-05-31 21:32:45] [INFO ] After 84047ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:32:45] [INFO ] After 84559ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 37 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 1 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 126 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 126 ms. Remains : 580/583 places, 1251/1254 transitions.
Incomplete random walk after 1000000 steps, including 72506 resets, run finished after 9629 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8868 resets, run finished after 1665 ms. (steps per millisecond=600 ) properties (out of 1) seen :0
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :413650 after 939448
Interrupted probabilistic random walk after 5078622 steps, run timeout after 33001 ms. (steps per millisecond=153 ) properties seen :{}
Probabilistic random walk after 5078622 steps, saw 873667 distinct states, run finished after 33004 ms. (steps per millisecond=153 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:33:29] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2024-05-31 21:33:29] [INFO ] Computed 82 invariants in 53 ms
[2024-05-31 21:33:30] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 21:33:30] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:33:30] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:33:30] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 21:33:30] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 21:33:31] [INFO ] After 819ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:33:31] [INFO ] After 62ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 234 places in 313 ms of which 1 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 1 ms to minimize.
[2024-05-31 21:33:32] [INFO ] Deduced a trap composed of 232 places in 330 ms of which 1 ms to minimize.
[2024-05-31 21:33:32] [INFO ] Deduced a trap composed of 230 places in 327 ms of which 1 ms to minimize.
[2024-05-31 21:33:32] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 0 ms to minimize.
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 0 ms to minimize.
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 0 ms to minimize.
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 1 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 240 places in 260 ms of which 0 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 232 places in 266 ms of which 0 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 232 places in 255 ms of which 1 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 234 places in 239 ms of which 0 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 1 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 238 places in 322 ms of which 0 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 230 places in 373 ms of which 1 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 218 places in 347 ms of which 1 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 226 places in 384 ms of which 1 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 230 places in 364 ms of which 1 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 236 places in 359 ms of which 0 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 234 places in 314 ms of which 1 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 240 places in 312 ms of which 0 ms to minimize.
[2024-05-31 21:33:39] [INFO ] Deduced a trap composed of 228 places in 317 ms of which 0 ms to minimize.
[2024-05-31 21:33:40] [INFO ] Deduced a trap composed of 224 places in 293 ms of which 0 ms to minimize.
[2024-05-31 21:33:40] [INFO ] Deduced a trap composed of 243 places in 319 ms of which 2 ms to minimize.
[2024-05-31 21:33:40] [INFO ] Deduced a trap composed of 228 places in 327 ms of which 1 ms to minimize.
[2024-05-31 21:33:41] [INFO ] Deduced a trap composed of 226 places in 295 ms of which 2 ms to minimize.
[2024-05-31 21:33:41] [INFO ] Deduced a trap composed of 230 places in 327 ms of which 0 ms to minimize.
[2024-05-31 21:33:42] [INFO ] Deduced a trap composed of 232 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:33:42] [INFO ] Deduced a trap composed of 230 places in 372 ms of which 0 ms to minimize.
[2024-05-31 21:33:43] [INFO ] Deduced a trap composed of 228 places in 335 ms of which 1 ms to minimize.
[2024-05-31 21:33:43] [INFO ] Deduced a trap composed of 236 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:33:44] [INFO ] Deduced a trap composed of 238 places in 359 ms of which 1 ms to minimize.
[2024-05-31 21:33:44] [INFO ] Deduced a trap composed of 224 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:33:45] [INFO ] Deduced a trap composed of 232 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:33:45] [INFO ] Deduced a trap composed of 226 places in 315 ms of which 1 ms to minimize.
[2024-05-31 21:33:45] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 1 ms to minimize.
[2024-05-31 21:33:46] [INFO ] Deduced a trap composed of 232 places in 345 ms of which 1 ms to minimize.
[2024-05-31 21:33:46] [INFO ] Deduced a trap composed of 228 places in 311 ms of which 1 ms to minimize.
[2024-05-31 21:33:47] [INFO ] Deduced a trap composed of 234 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:33:48] [INFO ] Deduced a trap composed of 234 places in 365 ms of which 1 ms to minimize.
[2024-05-31 21:33:48] [INFO ] Deduced a trap composed of 240 places in 323 ms of which 1 ms to minimize.
[2024-05-31 21:33:49] [INFO ] Deduced a trap composed of 230 places in 316 ms of which 0 ms to minimize.
[2024-05-31 21:33:49] [INFO ] Deduced a trap composed of 230 places in 329 ms of which 0 ms to minimize.
[2024-05-31 21:33:50] [INFO ] Deduced a trap composed of 230 places in 331 ms of which 1 ms to minimize.
[2024-05-31 21:33:50] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 1 ms to minimize.
[2024-05-31 21:33:51] [INFO ] Deduced a trap composed of 232 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:34:00] [INFO ] Deduced a trap composed of 234 places in 383 ms of which 1 ms to minimize.
[2024-05-31 21:34:09] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 37889 ms
[2024-05-31 21:34:09] [INFO ] After 38027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:34:09] [INFO ] After 38989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 43 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 74 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 74 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 47 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 21:34:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:34:09] [INFO ] Invariant cache hit.
[2024-05-31 21:34:09] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-31 21:34:09] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:34:09] [INFO ] Invariant cache hit.
[2024-05-31 21:34:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:34:12] [INFO ] Implicit Places using invariants and state equation in 2540 ms returned []
Implicit Place search using SMT with State Equation took 3105 ms to find 0 implicit places.
[2024-05-31 21:34:12] [INFO ] Redundant transitions in 116 ms returned []
[2024-05-31 21:34:12] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:34:12] [INFO ] Invariant cache hit.
[2024-05-31 21:34:13] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3852 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7233 resets, run finished after 1089 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:34:14] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:34:14] [INFO ] Invariant cache hit.
[2024-05-31 21:34:14] [INFO ] [Real]Absence check using 75 positive place invariants in 41 ms returned sat
[2024-05-31 21:34:14] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 21:34:14] [INFO ] After 403ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:34:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:34:14] [INFO ] After 7ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:34:14] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:34:14] [INFO ] After 654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:34:14] [INFO ] [Nat]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 21:34:14] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 21:34:15] [INFO ] After 422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:34:15] [INFO ] After 93ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 230 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 236 places in 353 ms of which 1 ms to minimize.
[2024-05-31 21:34:16] [INFO ] Deduced a trap composed of 232 places in 364 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 226 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 232 places in 348 ms of which 1 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 232 places in 389 ms of which 1 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 230 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 241 places in 335 ms of which 1 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 242 places in 329 ms of which 1 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 230 places in 335 ms of which 0 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 228 places in 334 ms of which 1 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 230 places in 335 ms of which 0 ms to minimize.
[2024-05-31 21:34:20] [INFO ] Deduced a trap composed of 232 places in 339 ms of which 1 ms to minimize.
[2024-05-31 21:34:21] [INFO ] Deduced a trap composed of 232 places in 367 ms of which 0 ms to minimize.
[2024-05-31 21:34:21] [INFO ] Deduced a trap composed of 230 places in 351 ms of which 1 ms to minimize.
[2024-05-31 21:34:22] [INFO ] Deduced a trap composed of 239 places in 324 ms of which 0 ms to minimize.
[2024-05-31 21:34:22] [INFO ] Deduced a trap composed of 238 places in 343 ms of which 1 ms to minimize.
[2024-05-31 21:34:23] [INFO ] Deduced a trap composed of 234 places in 354 ms of which 1 ms to minimize.
[2024-05-31 21:34:23] [INFO ] Deduced a trap composed of 239 places in 327 ms of which 1 ms to minimize.
[2024-05-31 21:34:24] [INFO ] Deduced a trap composed of 226 places in 380 ms of which 1 ms to minimize.
[2024-05-31 21:34:24] [INFO ] Deduced a trap composed of 232 places in 354 ms of which 1 ms to minimize.
[2024-05-31 21:34:25] [INFO ] Deduced a trap composed of 234 places in 341 ms of which 1 ms to minimize.
[2024-05-31 21:34:25] [INFO ] Deduced a trap composed of 234 places in 320 ms of which 1 ms to minimize.
[2024-05-31 21:34:25] [INFO ] Deduced a trap composed of 226 places in 340 ms of which 1 ms to minimize.
[2024-05-31 21:34:26] [INFO ] Deduced a trap composed of 228 places in 351 ms of which 1 ms to minimize.
[2024-05-31 21:34:26] [INFO ] Deduced a trap composed of 236 places in 340 ms of which 1 ms to minimize.
[2024-05-31 21:34:27] [INFO ] Deduced a trap composed of 228 places in 305 ms of which 1 ms to minimize.
[2024-05-31 21:34:27] [INFO ] Deduced a trap composed of 236 places in 341 ms of which 0 ms to minimize.
[2024-05-31 21:34:27] [INFO ] Deduced a trap composed of 232 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:34:28] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 1 ms to minimize.
[2024-05-31 21:34:28] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 1 ms to minimize.
[2024-05-31 21:34:29] [INFO ] Deduced a trap composed of 232 places in 337 ms of which 1 ms to minimize.
[2024-05-31 21:34:29] [INFO ] Deduced a trap composed of 226 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:34:30] [INFO ] Deduced a trap composed of 232 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:34:30] [INFO ] Deduced a trap composed of 228 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:34:31] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 1 ms to minimize.
[2024-05-31 21:34:31] [INFO ] Deduced a trap composed of 224 places in 384 ms of which 1 ms to minimize.
[2024-05-31 21:34:32] [INFO ] Deduced a trap composed of 224 places in 379 ms of which 1 ms to minimize.
[2024-05-31 21:34:32] [INFO ] Deduced a trap composed of 224 places in 388 ms of which 1 ms to minimize.
[2024-05-31 21:34:33] [INFO ] Deduced a trap composed of 228 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:34:34] [INFO ] Deduced a trap composed of 220 places in 362 ms of which 1 ms to minimize.
[2024-05-31 21:34:34] [INFO ] Deduced a trap composed of 230 places in 365 ms of which 1 ms to minimize.
[2024-05-31 21:34:35] [INFO ] Deduced a trap composed of 236 places in 363 ms of which 0 ms to minimize.
[2024-05-31 21:34:35] [INFO ] Deduced a trap composed of 234 places in 385 ms of which 0 ms to minimize.
[2024-05-31 21:34:44] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 29219 ms
[2024-05-31 21:34:44] [INFO ] After 29437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:34:44] [INFO ] After 30010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72667 resets, run finished after 9131 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8897 resets, run finished after 1602 ms. (steps per millisecond=624 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5238581 steps, run timeout after 30001 ms. (steps per millisecond=174 ) properties seen :{}
Probabilistic random walk after 5238581 steps, saw 902094 distinct states, run finished after 30001 ms. (steps per millisecond=174 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:35:25] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:35:25] [INFO ] Invariant cache hit.
[2024-05-31 21:35:25] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 21:35:25] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 21:35:25] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:35:25] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2024-05-31 21:35:25] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-31 21:35:26] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:35:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:35:26] [INFO ] After 133ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:35:26] [INFO ] Deduced a trap composed of 230 places in 368 ms of which 0 ms to minimize.
[2024-05-31 21:35:27] [INFO ] Deduced a trap composed of 236 places in 352 ms of which 1 ms to minimize.
[2024-05-31 21:35:27] [INFO ] Deduced a trap composed of 232 places in 342 ms of which 0 ms to minimize.
[2024-05-31 21:35:28] [INFO ] Deduced a trap composed of 226 places in 333 ms of which 1 ms to minimize.
[2024-05-31 21:35:28] [INFO ] Deduced a trap composed of 232 places in 332 ms of which 1 ms to minimize.
[2024-05-31 21:35:28] [INFO ] Deduced a trap composed of 232 places in 341 ms of which 1 ms to minimize.
[2024-05-31 21:35:29] [INFO ] Deduced a trap composed of 230 places in 354 ms of which 1 ms to minimize.
[2024-05-31 21:35:29] [INFO ] Deduced a trap composed of 241 places in 352 ms of which 1 ms to minimize.
[2024-05-31 21:35:30] [INFO ] Deduced a trap composed of 242 places in 355 ms of which 0 ms to minimize.
[2024-05-31 21:35:30] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 1 ms to minimize.
[2024-05-31 21:35:30] [INFO ] Deduced a trap composed of 228 places in 263 ms of which 1 ms to minimize.
[2024-05-31 21:35:31] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 0 ms to minimize.
[2024-05-31 21:35:31] [INFO ] Deduced a trap composed of 232 places in 209 ms of which 1 ms to minimize.
[2024-05-31 21:35:31] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2024-05-31 21:35:31] [INFO ] Deduced a trap composed of 230 places in 245 ms of which 0 ms to minimize.
[2024-05-31 21:35:32] [INFO ] Deduced a trap composed of 239 places in 244 ms of which 0 ms to minimize.
[2024-05-31 21:35:32] [INFO ] Deduced a trap composed of 238 places in 245 ms of which 1 ms to minimize.
[2024-05-31 21:35:32] [INFO ] Deduced a trap composed of 234 places in 232 ms of which 0 ms to minimize.
[2024-05-31 21:35:33] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 1 ms to minimize.
[2024-05-31 21:35:33] [INFO ] Deduced a trap composed of 226 places in 299 ms of which 0 ms to minimize.
[2024-05-31 21:35:33] [INFO ] Deduced a trap composed of 232 places in 213 ms of which 0 ms to minimize.
[2024-05-31 21:35:34] [INFO ] Deduced a trap composed of 234 places in 236 ms of which 1 ms to minimize.
[2024-05-31 21:35:34] [INFO ] Deduced a trap composed of 234 places in 243 ms of which 1 ms to minimize.
[2024-05-31 21:35:34] [INFO ] Deduced a trap composed of 226 places in 226 ms of which 1 ms to minimize.
[2024-05-31 21:35:34] [INFO ] Deduced a trap composed of 228 places in 217 ms of which 0 ms to minimize.
[2024-05-31 21:35:35] [INFO ] Deduced a trap composed of 236 places in 211 ms of which 0 ms to minimize.
[2024-05-31 21:35:35] [INFO ] Deduced a trap composed of 228 places in 265 ms of which 1 ms to minimize.
[2024-05-31 21:35:35] [INFO ] Deduced a trap composed of 236 places in 212 ms of which 1 ms to minimize.
[2024-05-31 21:35:36] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2024-05-31 21:35:36] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 0 ms to minimize.
[2024-05-31 21:35:36] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 1 ms to minimize.
[2024-05-31 21:35:37] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 1 ms to minimize.
[2024-05-31 21:35:37] [INFO ] Deduced a trap composed of 226 places in 299 ms of which 1 ms to minimize.
[2024-05-31 21:35:37] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 0 ms to minimize.
[2024-05-31 21:35:38] [INFO ] Deduced a trap composed of 228 places in 300 ms of which 1 ms to minimize.
[2024-05-31 21:35:38] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 0 ms to minimize.
[2024-05-31 21:35:38] [INFO ] Deduced a trap composed of 224 places in 288 ms of which 1 ms to minimize.
[2024-05-31 21:35:39] [INFO ] Deduced a trap composed of 224 places in 319 ms of which 1 ms to minimize.
[2024-05-31 21:35:39] [INFO ] Deduced a trap composed of 224 places in 303 ms of which 16 ms to minimize.
[2024-05-31 21:35:40] [INFO ] Deduced a trap composed of 228 places in 337 ms of which 0 ms to minimize.
[2024-05-31 21:35:41] [INFO ] Deduced a trap composed of 220 places in 277 ms of which 0 ms to minimize.
[2024-05-31 21:35:41] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 0 ms to minimize.
[2024-05-31 21:35:41] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2024-05-31 21:35:41] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 0 ms to minimize.
[2024-05-31 21:35:50] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 24436 ms
[2024-05-31 21:35:51] [INFO ] After 24766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:35:51] [INFO ] After 25347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 37 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 58 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 58 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 32 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 21:35:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:35:51] [INFO ] Invariant cache hit.
[2024-05-31 21:35:51] [INFO ] Implicit Places using invariants in 745 ms returned []
[2024-05-31 21:35:51] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:35:51] [INFO ] Invariant cache hit.
[2024-05-31 21:35:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:35:54] [INFO ] Implicit Places using invariants and state equation in 2427 ms returned []
Implicit Place search using SMT with State Equation took 3186 ms to find 0 implicit places.
[2024-05-31 21:35:54] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-31 21:35:54] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:35:54] [INFO ] Invariant cache hit.
[2024-05-31 21:35:54] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3777 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 100000 steps, including 7250 resets, run finished after 1049 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:35:56] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:35:56] [INFO ] Invariant cache hit.
[2024-05-31 21:35:56] [INFO ] [Real]Absence check using 75 positive place invariants in 20 ms returned sat
[2024-05-31 21:35:56] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 21 ms returned sat
[2024-05-31 21:35:56] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:35:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:35:56] [INFO ] After 6ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:35:56] [INFO ] After 68ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:35:56] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:35:56] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2024-05-31 21:35:56] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 20 ms returned sat
[2024-05-31 21:35:57] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:35:57] [INFO ] After 61ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:35:57] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 1 ms to minimize.
[2024-05-31 21:35:57] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 3 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 232 places in 242 ms of which 1 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 226 places in 212 ms of which 0 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 232 places in 225 ms of which 0 ms to minimize.
[2024-05-31 21:35:58] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 1 ms to minimize.
[2024-05-31 21:35:59] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 0 ms to minimize.
[2024-05-31 21:35:59] [INFO ] Deduced a trap composed of 241 places in 218 ms of which 0 ms to minimize.
[2024-05-31 21:35:59] [INFO ] Deduced a trap composed of 242 places in 210 ms of which 0 ms to minimize.
[2024-05-31 21:36:00] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 1 ms to minimize.
[2024-05-31 21:36:00] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 0 ms to minimize.
[2024-05-31 21:36:00] [INFO ] Deduced a trap composed of 230 places in 227 ms of which 0 ms to minimize.
[2024-05-31 21:36:00] [INFO ] Deduced a trap composed of 232 places in 224 ms of which 1 ms to minimize.
[2024-05-31 21:36:01] [INFO ] Deduced a trap composed of 232 places in 246 ms of which 0 ms to minimize.
[2024-05-31 21:36:01] [INFO ] Deduced a trap composed of 230 places in 229 ms of which 1 ms to minimize.
[2024-05-31 21:36:01] [INFO ] Deduced a trap composed of 239 places in 234 ms of which 1 ms to minimize.
[2024-05-31 21:36:01] [INFO ] Deduced a trap composed of 238 places in 252 ms of which 0 ms to minimize.
[2024-05-31 21:36:02] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 0 ms to minimize.
[2024-05-31 21:36:02] [INFO ] Deduced a trap composed of 239 places in 242 ms of which 0 ms to minimize.
[2024-05-31 21:36:03] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 1 ms to minimize.
[2024-05-31 21:36:03] [INFO ] Deduced a trap composed of 232 places in 218 ms of which 0 ms to minimize.
[2024-05-31 21:36:03] [INFO ] Deduced a trap composed of 234 places in 216 ms of which 1 ms to minimize.
[2024-05-31 21:36:03] [INFO ] Deduced a trap composed of 234 places in 226 ms of which 0 ms to minimize.
[2024-05-31 21:36:04] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 0 ms to minimize.
[2024-05-31 21:36:04] [INFO ] Deduced a trap composed of 228 places in 241 ms of which 1 ms to minimize.
[2024-05-31 21:36:04] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 1 ms to minimize.
[2024-05-31 21:36:04] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 1 ms to minimize.
[2024-05-31 21:36:05] [INFO ] Deduced a trap composed of 236 places in 216 ms of which 1 ms to minimize.
[2024-05-31 21:36:05] [INFO ] Deduced a trap composed of 232 places in 281 ms of which 0 ms to minimize.
[2024-05-31 21:36:05] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 0 ms to minimize.
[2024-05-31 21:36:06] [INFO ] Deduced a trap composed of 234 places in 237 ms of which 0 ms to minimize.
[2024-05-31 21:36:06] [INFO ] Deduced a trap composed of 232 places in 235 ms of which 0 ms to minimize.
[2024-05-31 21:36:06] [INFO ] Deduced a trap composed of 226 places in 231 ms of which 1 ms to minimize.
[2024-05-31 21:36:07] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 0 ms to minimize.
[2024-05-31 21:36:07] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 1 ms to minimize.
[2024-05-31 21:36:07] [INFO ] Deduced a trap composed of 232 places in 229 ms of which 1 ms to minimize.
[2024-05-31 21:36:08] [INFO ] Deduced a trap composed of 224 places in 280 ms of which 0 ms to minimize.
[2024-05-31 21:36:08] [INFO ] Deduced a trap composed of 224 places in 285 ms of which 0 ms to minimize.
[2024-05-31 21:36:09] [INFO ] Deduced a trap composed of 224 places in 297 ms of which 1 ms to minimize.
[2024-05-31 21:36:09] [INFO ] Deduced a trap composed of 228 places in 299 ms of which 0 ms to minimize.
[2024-05-31 21:36:10] [INFO ] Deduced a trap composed of 220 places in 272 ms of which 1 ms to minimize.
[2024-05-31 21:36:10] [INFO ] Deduced a trap composed of 230 places in 291 ms of which 0 ms to minimize.
[2024-05-31 21:36:10] [INFO ] Deduced a trap composed of 236 places in 281 ms of which 1 ms to minimize.
[2024-05-31 21:36:11] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 0 ms to minimize.
[2024-05-31 21:36:20] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 23081 ms
[2024-05-31 21:36:20] [INFO ] After 23271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:36:20] [INFO ] After 23868ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 713 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 428545 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 428545 steps, saw 69002 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:36:23] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:36:23] [INFO ] Invariant cache hit.
[2024-05-31 21:36:23] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2024-05-31 21:36:23] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 14 ms returned sat
[2024-05-31 21:36:23] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:36:23] [INFO ] [Nat]Absence check using 75 positive place invariants in 16 ms returned sat
[2024-05-31 21:36:23] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 21:36:24] [INFO ] After 520ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:36:24] [INFO ] After 147ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:24] [INFO ] Deduced a trap composed of 228 places in 269 ms of which 1 ms to minimize.
[2024-05-31 21:36:25] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 1 ms to minimize.
[2024-05-31 21:36:25] [INFO ] Deduced a trap composed of 232 places in 214 ms of which 1 ms to minimize.
[2024-05-31 21:36:25] [INFO ] Deduced a trap composed of 230 places in 233 ms of which 0 ms to minimize.
[2024-05-31 21:36:26] [INFO ] Deduced a trap composed of 236 places in 278 ms of which 0 ms to minimize.
[2024-05-31 21:36:26] [INFO ] Deduced a trap composed of 232 places in 227 ms of which 0 ms to minimize.
[2024-05-31 21:36:26] [INFO ] Deduced a trap composed of 234 places in 227 ms of which 1 ms to minimize.
[2024-05-31 21:36:26] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 0 ms to minimize.
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 226 places in 257 ms of which 0 ms to minimize.
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 1 ms to minimize.
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 234 places in 253 ms of which 1 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 232 places in 234 ms of which 1 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 1 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 1 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 226 places in 227 ms of which 1 ms to minimize.
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 0 ms to minimize.
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 236 places in 226 ms of which 1 ms to minimize.
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 226 places in 261 ms of which 0 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 226 places in 235 ms of which 1 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 1 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 238 places in 237 ms of which 1 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 234 places in 229 ms of which 0 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 230 places in 278 ms of which 0 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 0 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 228 places in 314 ms of which 1 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 226 places in 271 ms of which 0 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 1 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 230 places in 300 ms of which 1 ms to minimize.
[2024-05-31 21:36:34] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 1 ms to minimize.
[2024-05-31 21:36:34] [INFO ] Deduced a trap composed of 232 places in 207 ms of which 1 ms to minimize.
[2024-05-31 21:36:35] [INFO ] Deduced a trap composed of 232 places in 328 ms of which 0 ms to minimize.
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 232 places in 312 ms of which 1 ms to minimize.
[2024-05-31 21:36:43] [INFO ] Deduced a trap composed of 236 places in 297 ms of which 1 ms to minimize.
[2024-05-31 21:36:44] [INFO ] Deduced a trap composed of 228 places in 318 ms of which 1 ms to minimize.
[2024-05-31 21:36:44] [INFO ] Deduced a trap composed of 236 places in 217 ms of which 0 ms to minimize.
[2024-05-31 21:36:44] [INFO ] Deduced a trap composed of 232 places in 221 ms of which 1 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 0 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 222 places in 232 ms of which 0 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 0 ms to minimize.
[2024-05-31 21:36:46] [INFO ] Deduced a trap composed of 234 places in 225 ms of which 1 ms to minimize.
[2024-05-31 21:36:47] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 0 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 524288
[2024-05-31 21:36:47] [INFO ] Deduced a trap composed of 228 places in 261 ms of which 1 ms to minimize.
[2024-05-31 21:36:47] [INFO ] Deduced a trap composed of 228 places in 302 ms of which 1 ms to minimize.
[2024-05-31 21:36:48] [INFO ] Deduced a trap composed of 237 places in 286 ms of which 1 ms to minimize.
SDD size :939448 after 1.8482e+06
[2024-05-31 21:36:48] [INFO ] Deduced a trap composed of 240 places in 279 ms of which 0 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:256)
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:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 21:36:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:36:48] [INFO ] After 25133ms 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 46 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 21:36:48] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:36:48] [INFO ] Invariant cache hit.
[2024-05-31 21:36:49] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 638 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 731 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 526391 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 526391 steps, saw 85010 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:36:52] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:36:52] [INFO ] Invariant cache hit.
[2024-05-31 21:36:52] [INFO ] [Real]Absence check using 75 positive place invariants in 18 ms returned sat
[2024-05-31 21:36:52] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-31 21:36:52] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:36:52] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2024-05-31 21:36:52] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 21:36:53] [INFO ] After 383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:36:53] [INFO ] After 161ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:53] [INFO ] Deduced a trap composed of 228 places in 330 ms of which 1 ms to minimize.
[2024-05-31 21:36:54] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 0 ms to minimize.
[2024-05-31 21:36:54] [INFO ] Deduced a trap composed of 232 places in 239 ms of which 1 ms to minimize.
[2024-05-31 21:36:54] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 0 ms to minimize.
[2024-05-31 21:36:55] [INFO ] Deduced a trap composed of 236 places in 266 ms of which 0 ms to minimize.
[2024-05-31 21:36:55] [INFO ] Deduced a trap composed of 232 places in 233 ms of which 1 ms to minimize.
[2024-05-31 21:36:55] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 1 ms to minimize.
[2024-05-31 21:36:55] [INFO ] Deduced a trap composed of 234 places in 223 ms of which 1 ms to minimize.
[2024-05-31 21:36:56] [INFO ] Deduced a trap composed of 226 places in 221 ms of which 1 ms to minimize.
[2024-05-31 21:36:56] [INFO ] Deduced a trap composed of 224 places in 224 ms of which 1 ms to minimize.
[2024-05-31 21:36:56] [INFO ] Deduced a trap composed of 234 places in 224 ms of which 0 ms to minimize.
[2024-05-31 21:36:57] [INFO ] Deduced a trap composed of 232 places in 213 ms of which 1 ms to minimize.
[2024-05-31 21:36:57] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2024-05-31 21:36:57] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 0 ms to minimize.
[2024-05-31 21:36:57] [INFO ] Deduced a trap composed of 226 places in 228 ms of which 0 ms to minimize.
[2024-05-31 21:36:58] [INFO ] Deduced a trap composed of 236 places in 234 ms of which 0 ms to minimize.
[2024-05-31 21:36:58] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 1 ms to minimize.
[2024-05-31 21:36:58] [INFO ] Deduced a trap composed of 226 places in 260 ms of which 1 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 226 places in 217 ms of which 1 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 230 places in 217 ms of which 1 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 0 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 234 places in 234 ms of which 1 ms to minimize.
[2024-05-31 21:37:00] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 0 ms to minimize.
[2024-05-31 21:37:00] [INFO ] Deduced a trap composed of 230 places in 222 ms of which 0 ms to minimize.
[2024-05-31 21:37:01] [INFO ] Deduced a trap composed of 228 places in 321 ms of which 1 ms to minimize.
[2024-05-31 21:37:01] [INFO ] Deduced a trap composed of 226 places in 271 ms of which 1 ms to minimize.
[2024-05-31 21:37:02] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 0 ms to minimize.
[2024-05-31 21:37:02] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 0 ms to minimize.
[2024-05-31 21:37:03] [INFO ] Deduced a trap composed of 228 places in 306 ms of which 0 ms to minimize.
[2024-05-31 21:37:03] [INFO ] Deduced a trap composed of 232 places in 229 ms of which 0 ms to minimize.
[2024-05-31 21:37:04] [INFO ] Deduced a trap composed of 232 places in 314 ms of which 0 ms to minimize.
[2024-05-31 21:37:05] [INFO ] Deduced a trap composed of 232 places in 313 ms of which 0 ms to minimize.
[2024-05-31 21:37:12] [INFO ] Deduced a trap composed of 236 places in 314 ms of which 0 ms to minimize.
[2024-05-31 21:37:13] [INFO ] Deduced a trap composed of 228 places in 288 ms of which 1 ms to minimize.
[2024-05-31 21:37:13] [INFO ] Deduced a trap composed of 236 places in 202 ms of which 0 ms to minimize.
[2024-05-31 21:37:14] [INFO ] Deduced a trap composed of 232 places in 216 ms of which 1 ms to minimize.
[2024-05-31 21:37:14] [INFO ] Deduced a trap composed of 232 places in 306 ms of which 1 ms to minimize.
[2024-05-31 21:37:14] [INFO ] Deduced a trap composed of 222 places in 217 ms of which 0 ms to minimize.
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 230 places in 215 ms of which 0 ms to minimize.
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 234 places in 222 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 236 places in 322 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 228 places in 266 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 228 places in 294 ms of which 0 ms to minimize.
[2024-05-31 21:37:17] [INFO ] Deduced a trap composed of 237 places in 346 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:256)
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:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 21:37:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:37:17] [INFO ] After 25146ms 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 27 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 40 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 21 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2024-05-31 21:37:18] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:37:18] [INFO ] Invariant cache hit.
[2024-05-31 21:37:18] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-31 21:37:18] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:37:18] [INFO ] Invariant cache hit.
[2024-05-31 21:37:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:37:20] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 2887 ms to find 0 implicit places.
[2024-05-31 21:37:20] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-31 21:37:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2024-05-31 21:37:20] [INFO ] Invariant cache hit.
[2024-05-31 21:37:21] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3561 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 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 162 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
[2024-05-31 21:37:21] [INFO ] Computed 82 invariants in 20 ms
[2024-05-31 21:37:21] [INFO ] [Real]Absence check using 75 positive place invariants in 11 ms returned sat
[2024-05-31 21:37:21] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 13 ms returned sat
[2024-05-31 21:37:21] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:37:21] [INFO ] [Nat]Absence check using 75 positive place invariants in 11 ms returned sat
[2024-05-31 21:37:21] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 21:37:22] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 238 places in 292 ms of which 1 ms to minimize.
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 228 places in 316 ms of which 0 ms to minimize.
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 228 places in 463 ms of which 1 ms to minimize.
[2024-05-31 21:37:24] [INFO ] Deduced a trap composed of 228 places in 357 ms of which 1 ms to minimize.
[2024-05-31 21:37:24] [INFO ] Deduced a trap composed of 230 places in 478 ms of which 1 ms to minimize.
[2024-05-31 21:37:25] [INFO ] Deduced a trap composed of 236 places in 367 ms of which 1 ms to minimize.
[2024-05-31 21:37:25] [INFO ] Deduced a trap composed of 226 places in 277 ms of which 1 ms to minimize.
[2024-05-31 21:37:26] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 1 ms to minimize.
[2024-05-31 21:37:26] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2024-05-31 21:37:26] [INFO ] Deduced a trap composed of 238 places in 248 ms of which 1 ms to minimize.
[2024-05-31 21:37:26] [INFO ] Deduced a trap composed of 236 places in 294 ms of which 1 ms to minimize.
[2024-05-31 21:37:27] [INFO ] Deduced a trap composed of 228 places in 240 ms of which 0 ms to minimize.
[2024-05-31 21:37:27] [INFO ] Deduced a trap composed of 230 places in 353 ms of which 1 ms to minimize.
[2024-05-31 21:37:28] [INFO ] Deduced a trap composed of 226 places in 373 ms of which 0 ms to minimize.
[2024-05-31 21:37:28] [INFO ] Deduced a trap composed of 226 places in 327 ms of which 1 ms to minimize.
[2024-05-31 21:37:28] [INFO ] Deduced a trap composed of 226 places in 204 ms of which 1 ms to minimize.
[2024-05-31 21:37:28] [INFO ] Deduced a trap composed of 230 places in 207 ms of which 1 ms to minimize.
[2024-05-31 21:37:29] [INFO ] Deduced a trap composed of 228 places in 203 ms of which 0 ms to minimize.
[2024-05-31 21:37:29] [INFO ] Deduced a trap composed of 224 places in 202 ms of which 0 ms to minimize.
[2024-05-31 21:37:29] [INFO ] Deduced a trap composed of 226 places in 201 ms of which 0 ms to minimize.
[2024-05-31 21:37:29] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 0 ms to minimize.
[2024-05-31 21:37:30] [INFO ] Deduced a trap composed of 228 places in 202 ms of which 1 ms to minimize.
[2024-05-31 21:37:30] [INFO ] Deduced a trap composed of 230 places in 207 ms of which 0 ms to minimize.
[2024-05-31 21:37:30] [INFO ] Deduced a trap composed of 228 places in 206 ms of which 0 ms to minimize.
[2024-05-31 21:37:30] [INFO ] Deduced a trap composed of 228 places in 202 ms of which 0 ms to minimize.
[2024-05-31 21:37:31] [INFO ] Deduced a trap composed of 226 places in 207 ms of which 1 ms to minimize.
[2024-05-31 21:37:31] [INFO ] Deduced a trap composed of 226 places in 197 ms of which 0 ms to minimize.
[2024-05-31 21:37:31] [INFO ] Deduced a trap composed of 226 places in 200 ms of which 0 ms to minimize.
[2024-05-31 21:37:31] [INFO ] Deduced a trap composed of 228 places in 199 ms of which 0 ms to minimize.
[2024-05-31 21:37:32] [INFO ] Deduced a trap composed of 224 places in 204 ms of which 0 ms to minimize.
[2024-05-31 21:37:32] [INFO ] Deduced a trap composed of 224 places in 212 ms of which 0 ms to minimize.
[2024-05-31 21:37:32] [INFO ] Deduced a trap composed of 224 places in 186 ms of which 1 ms to minimize.
[2024-05-31 21:37:32] [INFO ] Deduced a trap composed of 226 places in 202 ms of which 0 ms to minimize.
[2024-05-31 21:37:32] [INFO ] Deduced a trap composed of 228 places in 187 ms of which 0 ms to minimize.
[2024-05-31 21:37:33] [INFO ] Deduced a trap composed of 228 places in 181 ms of which 1 ms to minimize.
[2024-05-31 21:37:33] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 1 ms to minimize.
[2024-05-31 21:37:33] [INFO ] Deduced a trap composed of 228 places in 195 ms of which 0 ms to minimize.
[2024-05-31 21:37:33] [INFO ] Deduced a trap composed of 238 places in 204 ms of which 1 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 232 places in 201 ms of which 1 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 230 places in 209 ms of which 0 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 232 places in 240 ms of which 0 ms to minimize.
[2024-05-31 21:37:34] [INFO ] Deduced a trap composed of 226 places in 185 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 226 places in 182 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 228 places in 200 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 228 places in 208 ms of which 0 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 226 places in 200 ms of which 1 ms to minimize.
[2024-05-31 21:37:35] [INFO ] Deduced a trap composed of 230 places in 199 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 232 places in 209 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 232 places in 197 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 244 places in 208 ms of which 1 ms to minimize.
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 230 places in 206 ms of which 0 ms to minimize.
[2024-05-31 21:37:37] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 0 ms to minimize.
[2024-05-31 21:37:37] [INFO ] Deduced a trap composed of 226 places in 205 ms of which 1 ms to minimize.
[2024-05-31 21:37:37] [INFO ] Deduced a trap composed of 232 places in 205 ms of which 1 ms to minimize.
[2024-05-31 21:37:37] [INFO ] Deduced a trap composed of 228 places in 188 ms of which 0 ms to minimize.
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 0 ms to minimize.
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 228 places in 201 ms of which 0 ms to minimize.
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 226 places in 191 ms of which 1 ms to minimize.
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 230 places in 199 ms of which 1 ms to minimize.
[2024-05-31 21:37:39] [INFO ] Deduced a trap composed of 228 places in 200 ms of which 0 ms to minimize.
[2024-05-31 21:37:39] [INFO ] Deduced a trap composed of 230 places in 210 ms of which 1 ms to minimize.
[2024-05-31 21:37:39] [INFO ] Deduced a trap composed of 230 places in 181 ms of which 0 ms to minimize.
[2024-05-31 21:37:39] [INFO ] Deduced a trap composed of 228 places in 204 ms of which 0 ms to minimize.
[2024-05-31 21:37:40] [INFO ] Deduced a trap composed of 230 places in 184 ms of which 1 ms to minimize.
[2024-05-31 21:37:40] [INFO ] Deduced a trap composed of 226 places in 207 ms of which 0 ms to minimize.
[2024-05-31 21:37:40] [INFO ] Deduced a trap composed of 228 places in 201 ms of which 1 ms to minimize.
[2024-05-31 21:37:40] [INFO ] Deduced a trap composed of 226 places in 211 ms of which 0 ms to minimize.
[2024-05-31 21:37:41] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 0 ms to minimize.
[2024-05-31 21:37:41] [INFO ] Deduced a trap composed of 224 places in 202 ms of which 0 ms to minimize.
[2024-05-31 21:37:41] [INFO ] Deduced a trap composed of 224 places in 201 ms of which 0 ms to minimize.
[2024-05-31 21:37:41] [INFO ] Deduced a trap composed of 224 places in 228 ms of which 1 ms to minimize.
[2024-05-31 21:37:42] [INFO ] Deduced a trap composed of 226 places in 210 ms of which 0 ms to minimize.
[2024-05-31 21:37:42] [INFO ] Deduced a trap composed of 224 places in 204 ms of which 0 ms to minimize.
[2024-05-31 21:37:42] [INFO ] Deduced a trap composed of 224 places in 181 ms of which 1 ms to minimize.
[2024-05-31 21:37:42] [INFO ] Deduced a trap composed of 224 places in 186 ms of which 1 ms to minimize.
[2024-05-31 21:37:42] [INFO ] Deduced a trap composed of 228 places in 184 ms of which 1 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 224 places in 203 ms of which 0 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 224 places in 198 ms of which 0 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 230 places in 198 ms of which 0 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 228 places in 199 ms of which 0 ms to minimize.
[2024-05-31 21:37:44] [INFO ] Deduced a trap composed of 224 places in 206 ms of which 1 ms to minimize.
[2024-05-31 21:37:44] [INFO ] Deduced a trap composed of 228 places in 195 ms of which 1 ms to minimize.
[2024-05-31 21:37:44] [INFO ] Deduced a trap composed of 228 places in 196 ms of which 0 ms to minimize.
[2024-05-31 21:37:44] [INFO ] Deduced a trap composed of 224 places in 183 ms of which 0 ms to minimize.
[2024-05-31 21:37:44] [INFO ] Deduced a trap composed of 230 places in 200 ms of which 0 ms to minimize.
[2024-05-31 21:37:45] [INFO ] Deduced a trap composed of 230 places in 200 ms of which 0 ms to minimize.
[2024-05-31 21:37:45] [INFO ] Deduced a trap composed of 232 places in 203 ms of which 1 ms to minimize.
[2024-05-31 21:37:45] [INFO ] Deduced a trap composed of 232 places in 203 ms of which 0 ms to minimize.
[2024-05-31 21:37:45] [INFO ] Deduced a trap composed of 234 places in 197 ms of which 0 ms to minimize.
[2024-05-31 21:37:46] [INFO ] Deduced a trap composed of 234 places in 207 ms of which 1 ms to minimize.
[2024-05-31 21:37:46] [INFO ] Deduced a trap composed of 228 places in 258 ms of which 1 ms to minimize.
[2024-05-31 21:37:46] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 1 ms to minimize.
[2024-05-31 21:37:47] [INFO ] Deduced a trap composed of 226 places in 262 ms of which 1 ms to minimize.
[2024-05-31 21:37:49] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 1 ms to minimize.
[2024-05-31 21:37:49] [INFO ] Deduced a trap composed of 232 places in 268 ms of which 1 ms to minimize.
[2024-05-31 21:37:51] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 1 ms to minimize.
[2024-05-31 21:37:51] [INFO ] Deduced a trap composed of 232 places in 248 ms of which 0 ms to minimize.
[2024-05-31 21:37:51] [INFO ] Deduced a trap composed of 230 places in 306 ms of which 1 ms to minimize.
[2024-05-31 21:37:54] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 1 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 1 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 0 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 230 places in 219 ms of which 1 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 228 places in 209 ms of which 0 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 224 places in 197 ms of which 1 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 224 places in 187 ms of which 0 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 0 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 232 places in 199 ms of which 0 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 226 places in 197 ms of which 0 ms to minimize.
[2024-05-31 21:37:58] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 0 ms to minimize.
[2024-05-31 21:37:59] [INFO ] Deduced a trap composed of 226 places in 275 ms of which 0 ms to minimize.
[2024-05-31 21:37:59] [INFO ] Deduced a trap composed of 230 places in 241 ms of which 1 ms to minimize.
[2024-05-31 21:37:59] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2024-05-31 21:38:00] [INFO ] Deduced a trap composed of 234 places in 238 ms of which 0 ms to minimize.
[2024-05-31 21:38:00] [INFO ] Deduced a trap composed of 228 places in 205 ms of which 0 ms to minimize.
[2024-05-31 21:38:00] [INFO ] Deduced a trap composed of 230 places in 212 ms of which 0 ms to minimize.
[2024-05-31 21:38:00] [INFO ] Deduced a trap composed of 232 places in 214 ms of which 1 ms to minimize.
[2024-05-31 21:38:01] [INFO ] Deduced a trap composed of 226 places in 198 ms of which 1 ms to minimize.
[2024-05-31 21:38:02] [INFO ] Deduced a trap composed of 226 places in 277 ms of which 1 ms to minimize.
[2024-05-31 21:38:11] [INFO ] Trap strengthening (SAT) tested/added 118/118 trap constraints in 48403 ms
[2024-05-31 21:38:11] [INFO ] After 49751ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:38:11] [INFO ] After 49843ms 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 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 182 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
[2024-05-31 21:38:11] [INFO ] Invariant cache hit.
[2024-05-31 21:38:12] [INFO ] [Real]Absence check using 75 positive place invariants in 38 ms returned sat
[2024-05-31 21:38:12] [INFO ] [Real]Absence check using 75 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 21:38:12] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:38:12] [INFO ] [Nat]Absence check using 75 positive place invariants in 15 ms returned sat
[2024-05-31 21:38:12] [INFO ] [Nat]Absence check using 75 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:38:12] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:12] [INFO ] Deduced a trap composed of 222 places in 232 ms of which 1 ms to minimize.
[2024-05-31 21:38:13] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 1 ms to minimize.
[2024-05-31 21:38:13] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 0 ms to minimize.
[2024-05-31 21:38:13] [INFO ] Deduced a trap composed of 230 places in 202 ms of which 1 ms to minimize.
[2024-05-31 21:38:13] [INFO ] Deduced a trap composed of 226 places in 235 ms of which 1 ms to minimize.
[2024-05-31 21:38:14] [INFO ] Deduced a trap composed of 220 places in 225 ms of which 0 ms to minimize.
[2024-05-31 21:38:14] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 2 ms to minimize.
[2024-05-31 21:38:14] [INFO ] Deduced a trap composed of 228 places in 206 ms of which 1 ms to minimize.
[2024-05-31 21:38:14] [INFO ] Deduced a trap composed of 228 places in 248 ms of which 1 ms to minimize.
[2024-05-31 21:38:15] [INFO ] Deduced a trap composed of 230 places in 199 ms of which 1 ms to minimize.
[2024-05-31 21:38:15] [INFO ] Deduced a trap composed of 222 places in 237 ms of which 0 ms to minimize.
[2024-05-31 21:38:15] [INFO ] Deduced a trap composed of 222 places in 181 ms of which 1 ms to minimize.
[2024-05-31 21:38:15] [INFO ] Deduced a trap composed of 224 places in 198 ms of which 1 ms to minimize.
[2024-05-31 21:38:16] [INFO ] Deduced a trap composed of 226 places in 196 ms of which 0 ms to minimize.
[2024-05-31 21:38:16] [INFO ] Deduced a trap composed of 216 places in 200 ms of which 1 ms to minimize.
[2024-05-31 21:38:16] [INFO ] Deduced a trap composed of 224 places in 192 ms of which 0 ms to minimize.
[2024-05-31 21:38:16] [INFO ] Deduced a trap composed of 218 places in 201 ms of which 0 ms to minimize.
[2024-05-31 21:38:17] [INFO ] Deduced a trap composed of 234 places in 193 ms of which 1 ms to minimize.
[2024-05-31 21:38:17] [INFO ] Deduced a trap composed of 220 places in 194 ms of which 1 ms to minimize.
[2024-05-31 21:38:17] [INFO ] Deduced a trap composed of 220 places in 193 ms of which 0 ms to minimize.
[2024-05-31 21:38:17] [INFO ] Deduced a trap composed of 220 places in 207 ms of which 0 ms to minimize.
[2024-05-31 21:38:17] [INFO ] Deduced a trap composed of 222 places in 197 ms of which 0 ms to minimize.
[2024-05-31 21:38:18] [INFO ] Deduced a trap composed of 222 places in 197 ms of which 0 ms to minimize.
[2024-05-31 21:38:18] [INFO ] Deduced a trap composed of 224 places in 199 ms of which 0 ms to minimize.
[2024-05-31 21:38:18] [INFO ] Deduced a trap composed of 226 places in 197 ms of which 1 ms to minimize.
[2024-05-31 21:38:18] [INFO ] Deduced a trap composed of 228 places in 204 ms of which 0 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 232 places in 205 ms of which 1 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 220 places in 203 ms of which 0 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 222 places in 202 ms of which 0 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 222 places in 199 ms of which 1 ms to minimize.
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 226 places in 199 ms of which 0 ms to minimize.
[2024-05-31 21:38:20] [INFO ] Deduced a trap composed of 226 places in 192 ms of which 1 ms to minimize.
[2024-05-31 21:38:20] [INFO ] Deduced a trap composed of 222 places in 179 ms of which 0 ms to minimize.
[2024-05-31 21:38:20] [INFO ] Deduced a trap composed of 235 places in 197 ms of which 0 ms to minimize.
[2024-05-31 21:38:20] [INFO ] Deduced a trap composed of 223 places in 206 ms of which 0 ms to minimize.
[2024-05-31 21:38:21] [INFO ] Deduced a trap composed of 232 places in 199 ms of which 1 ms to minimize.
[2024-05-31 21:38:21] [INFO ] Deduced a trap composed of 214 places in 196 ms of which 1 ms to minimize.
[2024-05-31 21:38:21] [INFO ] Deduced a trap composed of 222 places in 193 ms of which 0 ms to minimize.
[2024-05-31 21:38:21] [INFO ] Deduced a trap composed of 224 places in 191 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2024-05-31 21:40:39] [INFO ] Flatten gal took : 317 ms
[2024-05-31 21:40:39] [INFO ] Applying decomposition
[2024-05-31 21:40:39] [INFO ] Flatten gal took : 232 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9916840080127862349.txt' '-o' '/tmp/graph9916840080127862349.bin' '-w' '/tmp/graph9916840080127862349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9916840080127862349.bin' '-l' '-1' '-v' '-w' '/tmp/graph9916840080127862349.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:40:40] [INFO ] Decomposing Gal with order
[2024-05-31 21:40:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:40:41] [INFO ] Removed a total of 6114 redundant transitions.
[2024-05-31 21:40:41] [INFO ] Flatten gal took : 571 ms
[2024-05-31 21:40:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 364 labels/synchronizations in 130 ms.
[2024-05-31 21:40:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15383074459835260630.gal : 45 ms
[2024-05-31 21:40:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4132868960132025197.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15383074459835260630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4132868960132025197.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality4132868960132025197.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 55
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :356 after 362
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :362 after 366
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :366 after 369
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :369 after 382
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :382 after 870
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :870 after 920
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4586 after 4801
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4801 after 138471
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :138471 after 146769
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :146769 after 159265
[2024-05-31 21:41:57] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 224599 ms
[2024-05-31 21:41:57] [INFO ] After 224910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:41:57] [INFO ] After 225013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:41:57] [INFO ] Flatten gal took : 51 ms
[2024-05-31 21:41:57] [INFO ] Flatten gal took : 50 ms
[2024-05-31 21:41:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1411758945509545439.gal : 9 ms
[2024-05-31 21:41:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3641269917808309562.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1411758945509545439.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3641269917808309562.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3641269917808309562.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
Detected timeout of ITS tools.
[2024-05-31 21:42:12] [INFO ] Flatten gal took : 128 ms
[2024-05-31 21:42:12] [INFO ] Applying decomposition
[2024-05-31 21:42:12] [INFO ] Flatten gal took : 69 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1232651335021959487.txt' '-o' '/tmp/graph1232651335021959487.bin' '-w' '/tmp/graph1232651335021959487.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1232651335021959487.bin' '-l' '-1' '-v' '-w' '/tmp/graph1232651335021959487.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:42:12] [INFO ] Decomposing Gal with order
[2024-05-31 21:42:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:42:12] [INFO ] Removed a total of 3447 redundant transitions.
[2024-05-31 21:42:12] [INFO ] Flatten gal took : 160 ms
[2024-05-31 21:42:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 248 labels/synchronizations in 73 ms.
[2024-05-31 21:42:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14373344996083785983.gal : 13 ms
[2024-05-31 21:42:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2847856080366459622.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14373344996083785983.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2847856080366459622.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2847856080366459622.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18081077713221956847
[2024-05-31 21:42:28] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18081077713221956847
Running compilation step : cd /tmp/ltsmin18081077713221956847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2968 ms.
Running link step : cd /tmp/ltsmin18081077713221956847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin18081077713221956847;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-31 21:42:43] [INFO ] Flatten gal took : 85 ms
[2024-05-31 21:42:43] [INFO ] Flatten gal took : 66 ms
[2024-05-31 21:42:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17586683134593271736.gal : 11 ms
[2024-05-31 21:42:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4380525994318018668.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17586683134593271736.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4380525994318018668.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability4380525994318018668.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.
[2024-05-31 21:42:46] [INFO ] Flatten gal took : 46 ms
[2024-05-31 21:42:46] [INFO ] Applying decomposition
[2024-05-31 21:42:46] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4875283986820357960.txt' '-o' '/tmp/graph4875283986820357960.bin' '-w' '/tmp/graph4875283986820357960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4875283986820357960.bin' '-l' '-1' '-v' '-w' '/tmp/graph4875283986820357960.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:42:46] [INFO ] Decomposing Gal with order
[2024-05-31 21:42:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:42:46] [INFO ] Removed a total of 3160 redundant transitions.
[2024-05-31 21:42:46] [INFO ] Flatten gal took : 115 ms
[2024-05-31 21:42:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 31 ms.
[2024-05-31 21:42:46] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability18101179003086291394.gal : 14 ms
[2024-05-31 21:42:46] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4746978553812275482.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability18101179003086291394.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4746978553812275482.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability4746978553812275482.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 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12783589970781654931
[2024-05-31 21:42:50] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12783589970781654931
Running compilation step : cd /tmp/ltsmin12783589970781654931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12783589970781654931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12783589970781654931;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-31 21:42:52] [INFO ] Flatten gal took : 95 ms
[2024-05-31 21:42:52] [INFO ] Flatten gal took : 72 ms
[2024-05-31 21:42:52] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6140026039385212650.gal : 11 ms
[2024-05-31 21:42:52] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9814274665412321670.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6140026039385212650.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9814274665412321670.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability9814274665412321670.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.
[2024-05-31 21:43:22] [INFO ] Flatten gal took : 77 ms
[2024-05-31 21:43:22] [INFO ] Applying decomposition
[2024-05-31 21:43:22] [INFO ] Flatten gal took : 63 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5015226208431533483.txt' '-o' '/tmp/graph5015226208431533483.bin' '-w' '/tmp/graph5015226208431533483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5015226208431533483.bin' '-l' '-1' '-v' '-w' '/tmp/graph5015226208431533483.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:43:22] [INFO ] Decomposing Gal with order
[2024-05-31 21:43:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:43:22] [INFO ] Removed a total of 3070 redundant transitions.
[2024-05-31 21:43:22] [INFO ] Flatten gal took : 91 ms
[2024-05-31 21:43:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 25 ms.
[2024-05-31 21:43:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10483568631179800384.gal : 12 ms
[2024-05-31 21:43:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12724224672061446874.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10483568631179800384.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability12724224672061446874.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityFireability12724224672061446874.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 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1 after 8098
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8098 after 8098
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :8098 after 9132
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9132 after 9142
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9142 after 9171
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9171 after 14698
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :14698 after 14930
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :14930 after 15440
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin875930690711970040
[2024-05-31 21:43:53] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin875930690711970040
Running compilation step : cd /tmp/ltsmin875930690711970040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2964 ms.
Running link step : cd /tmp/ltsmin875930690711970040;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin875930690711970040;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 21:44:23] [INFO ] Flatten gal took : 89 ms
[2024-05-31 21:44:23] [INFO ] Flatten gal took : 60 ms
[2024-05-31 21:44:23] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10961824383626732209.gal : 9 ms
[2024-05-31 21:44:23] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability18141835569517208925.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10961824383626732209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability18141835569517208925.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityFireability18141835569517208925.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
Detected timeout of ITS tools.
[2024-05-31 21:49:24] [INFO ] Flatten gal took : 99 ms
[2024-05-31 21:49:24] [INFO ] Applying decomposition
[2024-05-31 21:49:24] [INFO ] Flatten gal took : 54 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6505786946477587210.txt' '-o' '/tmp/graph6505786946477587210.bin' '-w' '/tmp/graph6505786946477587210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6505786946477587210.bin' '-l' '-1' '-v' '-w' '/tmp/graph6505786946477587210.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:49:25] [INFO ] Decomposing Gal with order
[2024-05-31 21:49:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:49:25] [INFO ] Removed a total of 3070 redundant transitions.
[2024-05-31 21:49:25] [INFO ] Flatten gal took : 252 ms
[2024-05-31 21:49:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 341 labels/synchronizations in 64 ms.
[2024-05-31 21:49:26] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12232909171544895001.gal : 42 ms
[2024-05-31 21:49:26] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4188713892178312127.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability12232909171544895001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4188713892178312127.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability4188713892178312127.prop.
Detected timeout of ITS tools.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8460187060394339443
[2024-05-31 21:54:26] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8460187060394339443
Running compilation step : cd /tmp/ltsmin8460187060394339443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 3261 ms.
Running link step : cd /tmp/ltsmin8460187060394339443;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin8460187060394339443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.072: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.070: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.074: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.070: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.074: There are 1252 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.074: State length is 580, there are 1251 groups
pins2lts-mc-linux64( 0/ 8), 0.074: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.074: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.074: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.074: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.072: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.072: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.071: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.073: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.156: ~4 levels ~960 states ~8088 transitions
pins2lts-mc-linux64( 0/ 8), 0.219: ~5 levels ~1920 states ~15064 transitions
pins2lts-mc-linux64( 0/ 8), 0.391: ~6 levels ~3840 states ~27808 transitions
pins2lts-mc-linux64( 0/ 8), 0.742: ~6 levels ~7680 states ~54216 transitions
pins2lts-mc-linux64( 3/ 8), 1.019: ~4 levels ~15360 states ~70536 transitions
pins2lts-mc-linux64( 3/ 8), 1.517: ~5 levels ~30720 states ~115728 transitions
pins2lts-mc-linux64( 3/ 8), 2.367: ~6 levels ~61440 states ~179760 transitions
pins2lts-mc-linux64( 3/ 8), 3.792: ~8 levels ~122880 states ~250016 transitions
pins2lts-mc-linux64( 3/ 8), 6.577: ~11 levels ~245760 states ~1153832 transitions
pins2lts-mc-linux64( 3/ 8), 11.964: ~12 levels ~491520 states ~2974888 transitions
pins2lts-mc-linux64( 3/ 8), 22.643: ~13 levels ~983040 states ~6432984 transitions
pins2lts-mc-linux64( 3/ 8), 44.127: ~13 levels ~1966080 states ~12802224 transitions
pins2lts-mc-linux64( 1/ 8), 87.013: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 89.362:
pins2lts-mc-linux64( 0/ 8), 89.362: mean standard work distribution: 18.5% (states) 27.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 89.362:
pins2lts-mc-linux64( 0/ 8), 89.362: Explored 2638991 states 64096540 transitions, fanout: 24.288
pins2lts-mc-linux64( 0/ 8), 89.362: Total exploration time 89.290 sec (86.980 sec minimum, 87.595 sec on average)
pins2lts-mc-linux64( 0/ 8), 89.362: States per second: 29555, Transitions per second: 717847
pins2lts-mc-linux64( 0/ 8), 89.362:
pins2lts-mc-linux64( 0/ 8), 89.362: Queue width: 8B, total height: 18936574, memory: 144.47MB
pins2lts-mc-linux64( 0/ 8), 89.362: Tree memory: 420.6MB, 20.4 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 89.362: Tree fill ratio (roots/leafs): 16.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 89.362: Stored 1593 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 89.362: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 89.362: Est. total memory use: 565.1MB (~1168.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8460187060394339443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8460187060394339443;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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)
[2024-05-31 21:55:59] [INFO ] Flatten gal took : 61 ms
[2024-05-31 21:55:59] [INFO ] Flatten gal took : 60 ms
[2024-05-31 21:55:59] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5966360533608388509.gal : 9 ms
[2024-05-31 21:55:59] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17291121081457015504.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.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability5966360533608388509.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17291121081457015504.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.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability17291121081457015504.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: 16393340 kB
MemFree: 10865116 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16205812 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r308-tajo-171654461500257"
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 ;