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-171654461500262.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-S10J40, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r308-tajo-171654461500262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 8.5K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 12 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 12 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 13:00 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 1717191041657

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-S10J40
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202304061127
[2024-05-31 21:30:43] [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:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:30:43] [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:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 21:30:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 547 ms
[2024-05-31 21:30:44] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 894 PT places and 12462.0 transition bindings in 19 ms.
[2024-05-31 21:30:44] [INFO ] Unfolded HLPN to a Petri net with 894 places and 12380 transitions 114079 arcs in 193 ms.
[2024-05-31 21:30:44] [INFO ] Unfolded 38 HLPN properties in 4 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-31 21:30:44] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-31 21:30:44] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-31 21:30:44] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 40 places in 39 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2024-05-31 21:30:45] [INFO ] Flatten gal took : 555 ms
[2024-05-31 21:30:45] [INFO ] Flatten gal took : 281 ms
[2024-05-31 21:30:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7041405753775882636.gal : 207 ms
[2024-05-31 21:30:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7070130923482856545.prop : 19 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/ReachabilityCardinality7041405753775882636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7070130923482856545.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/ReachabilityCardinality7070130923482856545.prop.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 2723 ms. (steps per millisecond=3 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) 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 1000 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 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 11) 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 11) seen :0
Running SMT prover for 11 properties.
[2024-05-31 21:30:47] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 854 cols
[2024-05-31 21:30:48] [INFO ] Computed 112 invariants in 236 ms
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
SDD proceeding with computation,32 properties remain. new max is 4
SDD size :5 after 6
Reachability property qltransition_27 is true.
Reachability property qltransition_20 is true.
Reachability property qltransition_15 is true.
SDD proceeding with computation,29 properties remain. new max is 4
SDD size :6 after 14
Reachability property qltransition_21 is true.
SDD proceeding with computation,28 properties remain. new max is 4
SDD size :14 after 15
Reachability property qltransition_6 is true.
SDD proceeding with computation,27 properties remain. new max is 4
SDD size :15 after 16
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,23 properties remain. new max is 4
SDD size :16 after 20
Reachability property qltransition_9 is true.
SDD proceeding with computation,22 properties remain. new max is 4
SDD size :20 after 21
Reachability property qltransition_36 is true.
Reachability property qltransition_10 is true.
Reachability property qltransition_8 is true.
SDD proceeding with computation,19 properties remain. new max is 4
SDD size :21 after 24
[2024-05-31 21:30:50] [INFO ] [Real]Absence check using 105 positive place invariants in 99 ms returned sat
[2024-05-31 21:30:50] [INFO ] [Real]Absence check using 105 positive and 7 generalized place invariants in 37 ms returned sat
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 81
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :81 after 110
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :110 after 168
Reachability property qltransition_33 is true.
[2024-05-31 21:30:54] [INFO ] After 2902ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:9
[2024-05-31 21:30:54] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :168 after 282
[2024-05-31 21:30:54] [INFO ] After 458ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:9
[2024-05-31 21:30:54] [INFO ] After 834ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:9
Attempting to minimize the solution found.
Minimization took 344 ms.
[2024-05-31 21:30:55] [INFO ] After 5514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:9
[2024-05-31 21:30:55] [INFO ] [Nat]Absence check using 105 positive place invariants in 110 ms returned sat
[2024-05-31 21:30:56] [INFO ] [Nat]Absence check using 105 positive and 7 generalized place invariants in 36 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :282 after 378
[2024-05-31 21:31:00] [INFO ] After 4639ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
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 4096
SDD size :378 after 1353
[2024-05-31 21:31:03] [INFO ] After 2941ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :1353 after 2543
[2024-05-31 21:31:06] [INFO ] After 6072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :2543 after 4832
Minimization took 2746 ms.
[2024-05-31 21:31:09] [INFO ] After 14407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 2324 ms.
Support contains 145 out of 854 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 844 transition count 2185
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 100 place count 799 transition count 2185
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 100 place count 799 transition count 2142
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 186 place count 756 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 755 transition count 2141
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 755 transition count 2141
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 192 place count 753 transition count 2139
Applied a total of 192 rules in 310 ms. Remains 753 /854 variables (removed 101) and now considering 2139/2230 (removed 91) transitions.
[2024-05-31 21:31:12] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2024-05-31 21:31:12] [INFO ] Computed 102 invariants in 46 ms
[2024-05-31 21:31:13] [INFO ] Dead Transitions using invariants and state equation in 990 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 : 753/854 places, 1524/2230 transitions.
Applied a total of 0 rules in 44 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1348 ms. Remains : 753/854 places, 1524/2230 transitions.
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :4832 after 9794
Incomplete random walk after 1000000 steps, including 65089 resets, run finished after 6901 ms. (steps per millisecond=144 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 1000000 steps, including 8187 resets, run finished after 1585 ms. (steps per millisecond=630 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:31:21] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 753 cols
[2024-05-31 21:31:21] [INFO ] Computed 102 invariants in 54 ms
[2024-05-31 21:31:22] [INFO ] [Real]Absence check using 95 positive place invariants in 21 ms returned sat
[2024-05-31 21:31:22] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 12 ms returned sat
[2024-05-31 21:31:22] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:31:22] [INFO ] [Nat]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-05-31 21:31:22] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:31:22] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:31:22] [INFO ] After 92ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:31:23] [INFO ] Deduced a trap composed of 304 places in 516 ms of which 1 ms to minimize.
[2024-05-31 21:31:23] [INFO ] Deduced a trap composed of 302 places in 439 ms of which 2 ms to minimize.
[2024-05-31 21:31:24] [INFO ] Deduced a trap composed of 308 places in 446 ms of which 1 ms to minimize.
[2024-05-31 21:31:25] [INFO ] Deduced a trap composed of 308 places in 424 ms of which 1 ms to minimize.
[2024-05-31 21:31:25] [INFO ] Deduced a trap composed of 296 places in 388 ms of which 0 ms to minimize.
[2024-05-31 21:31:25] [INFO ] Deduced a trap composed of 292 places in 364 ms of which 1 ms to minimize.
[2024-05-31 21:31:26] [INFO ] Deduced a trap composed of 298 places in 356 ms of which 1 ms to minimize.
[2024-05-31 21:31:26] [INFO ] Deduced a trap composed of 292 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:31:27] [INFO ] Deduced a trap composed of 288 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:31:27] [INFO ] Deduced a trap composed of 298 places in 414 ms of which 1 ms to minimize.
[2024-05-31 21:31:28] [INFO ] Deduced a trap composed of 304 places in 388 ms of which 1 ms to minimize.
[2024-05-31 21:31:28] [INFO ] Deduced a trap composed of 306 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:31:29] [INFO ] Deduced a trap composed of 314 places in 450 ms of which 1 ms to minimize.
[2024-05-31 21:31:29] [INFO ] Deduced a trap composed of 310 places in 440 ms of which 1 ms to minimize.
[2024-05-31 21:31:30] [INFO ] Deduced a trap composed of 308 places in 450 ms of which 1 ms to minimize.
[2024-05-31 21:31:30] [INFO ] Deduced a trap composed of 302 places in 433 ms of which 1 ms to minimize.
[2024-05-31 21:31:31] [INFO ] Deduced a trap composed of 294 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:31:31] [INFO ] Deduced a trap composed of 304 places in 432 ms of which 1 ms to minimize.
[2024-05-31 21:31:32] [INFO ] Deduced a trap composed of 305 places in 431 ms of which 1 ms to minimize.
[2024-05-31 21:31:32] [INFO ] Deduced a trap composed of 302 places in 428 ms of which 2 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 292 places in 448 ms of which 1 ms to minimize.
[2024-05-31 21:31:33] [INFO ] Deduced a trap composed of 310 places in 431 ms of which 1 ms to minimize.
[2024-05-31 21:31:34] [INFO ] Deduced a trap composed of 286 places in 419 ms of which 1 ms to minimize.
[2024-05-31 21:31:34] [INFO ] Deduced a trap composed of 296 places in 421 ms of which 0 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :9794 after 19746
[2024-05-31 21:31:43] [INFO ] Deduced a trap composed of 304 places in 477 ms of which 1 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 310 places in 402 ms of which 1 ms to minimize.
[2024-05-31 21:31:44] [INFO ] Deduced a trap composed of 298 places in 342 ms of which 1 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 290 places in 338 ms of which 1 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 302 places in 363 ms of which 0 ms to minimize.
[2024-05-31 21:31:45] [INFO ] Deduced a trap composed of 290 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 286 places in 353 ms of which 0 ms to minimize.
[2024-05-31 21:31:46] [INFO ] Deduced a trap composed of 300 places in 358 ms of which 2 ms to minimize.
[2024-05-31 21:31:47] [INFO ] Deduced a trap composed of 312 places in 397 ms of which 5 ms to minimize.
[2024-05-31 21:31:47] [INFO ] Deduced a trap composed of 294 places in 457 ms of which 1 ms to minimize.
[2024-05-31 21:31:52] [INFO ] Deduced a trap composed of 306 places in 454 ms of which 1 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 300 places in 437 ms of which 2 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 304 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:31:53] [INFO ] Deduced a trap composed of 302 places in 369 ms of which 2 ms to minimize.
[2024-05-31 21:31:54] [INFO ] Deduced a trap composed of 304 places in 412 ms of which 1 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 304 places in 396 ms of which 2 ms to minimize.
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 304 places in 427 ms of which 1 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 300 places in 450 ms of which 1 ms to minimize.
[2024-05-31 21:31:56] [INFO ] Deduced a trap composed of 304 places in 432 ms of which 0 ms to minimize.
[2024-05-31 21:31:57] [INFO ] Deduced a trap composed of 300 places in 454 ms of which 1 ms to minimize.
[2024-05-31 21:31:57] [INFO ] Deduced a trap composed of 300 places in 423 ms of which 0 ms to minimize.
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 296 places in 427 ms of which 1 ms to minimize.
[2024-05-31 21:31:58] [INFO ] Deduced a trap composed of 304 places in 425 ms of which 1 ms to minimize.
[2024-05-31 21:31:59] [INFO ] Deduced a trap composed of 298 places in 421 ms of which 1 ms to minimize.
[2024-05-31 21:32:00] [INFO ] Deduced a trap composed of 300 places in 451 ms of which 2 ms to minimize.
[2024-05-31 21:32:00] [INFO ] Deduced a trap composed of 312 places in 466 ms of which 1 ms to minimize.
[2024-05-31 21:32:01] [INFO ] Deduced a trap composed of 304 places in 448 ms of which 1 ms to minimize.
[2024-05-31 21:32:01] [INFO ] Deduced a trap composed of 308 places in 419 ms of which 9 ms to minimize.
[2024-05-31 21:32:02] [INFO ] Deduced a trap composed of 308 places in 425 ms of which 1 ms to minimize.
[2024-05-31 21:32:02] [INFO ] Deduced a trap composed of 308 places in 425 ms of which 10 ms to minimize.
[2024-05-31 21:32:03] [INFO ] Deduced a trap composed of 306 places in 475 ms of which 1 ms to minimize.
[2024-05-31 21:32:03] [INFO ] Deduced a trap composed of 296 places in 443 ms of which 1 ms to minimize.
[2024-05-31 21:32:04] [INFO ] Deduced a trap composed of 302 places in 447 ms of which 1 ms to minimize.
[2024-05-31 21:32:05] [INFO ] Deduced a trap composed of 310 places in 448 ms of which 1 ms to minimize.
[2024-05-31 21:32:06] [INFO ] Deduced a trap composed of 298 places in 453 ms of which 1 ms to minimize.
[2024-05-31 21:32:06] [INFO ] Deduced a trap composed of 296 places in 429 ms of which 1 ms to minimize.
[2024-05-31 21:32:07] [INFO ] Deduced a trap composed of 304 places in 426 ms of which 1 ms to minimize.
[2024-05-31 21:32:07] [INFO ] Deduced a trap composed of 290 places in 335 ms of which 1 ms to minimize.
[2024-05-31 21:32:08] [INFO ] Deduced a trap composed of 294 places in 409 ms of which 3 ms to minimize.
[2024-05-31 21:32:09] [INFO ] Deduced a trap composed of 296 places in 439 ms of which 1 ms to minimize.
[2024-05-31 21:32:10] [INFO ] Deduced a trap composed of 302 places in 445 ms of which 2 ms to minimize.
[2024-05-31 21:32:11] [INFO ] Deduced a trap composed of 300 places in 461 ms of which 12 ms to minimize.
[2024-05-31 21:32:12] [INFO ] Deduced a trap composed of 294 places in 424 ms of which 2 ms to minimize.
[2024-05-31 21:32:12] [INFO ] Deduced a trap composed of 296 places in 422 ms of which 0 ms to minimize.
[2024-05-31 21:32:13] [INFO ] Deduced a trap composed of 310 places in 444 ms of which 1 ms to minimize.
[2024-05-31 21:32:13] [INFO ] Deduced a trap composed of 294 places in 432 ms of which 0 ms to minimize.
[2024-05-31 21:32:14] [INFO ] Deduced a trap composed of 310 places in 442 ms of which 1 ms to minimize.
[2024-05-31 21:32:14] [INFO ] Deduced a trap composed of 296 places in 439 ms of which 1 ms to minimize.
[2024-05-31 21:32:15] [INFO ] Deduced a trap composed of 304 places in 455 ms of which 1 ms to minimize.
[2024-05-31 21:32:16] [INFO ] Deduced a trap composed of 298 places in 424 ms of which 1 ms to minimize.
[2024-05-31 21:32:17] [INFO ] Deduced a trap composed of 308 places in 423 ms of which 0 ms to minimize.
[2024-05-31 21:32:17] [INFO ] Deduced a trap composed of 304 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:32:18] [INFO ] Deduced a trap composed of 308 places in 446 ms of which 1 ms to minimize.
[2024-05-31 21:32:27] [INFO ] Trap strengthening (SAT) tested/added 77/77 trap constraints in 65034 ms
[2024-05-31 21:32:28] [INFO ] After 65199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:32:28] [INFO ] After 65910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 1524/1524 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 753 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 752 transition count 1523
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 752 transition count 1521
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 750 transition count 1521
Applied a total of 6 rules in 98 ms. Remains 750 /753 variables (removed 3) and now considering 1521/1524 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 750/753 places, 1521/1524 transitions.
Incomplete random walk after 1000000 steps, including 72612 resets, run finished after 9736 ms. (steps per millisecond=102 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8288 resets, run finished after 2171 ms. (steps per millisecond=460 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4078455 steps, run timeout after 33001 ms. (steps per millisecond=123 ) properties seen :{}
Probabilistic random walk after 4078455 steps, saw 693096 distinct states, run finished after 33006 ms. (steps per millisecond=123 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:33:13] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2024-05-31 21:33:13] [INFO ] Computed 102 invariants in 50 ms
[2024-05-31 21:33:13] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2024-05-31 21:33:13] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-31 21:33:13] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:33:13] [INFO ] [Nat]Absence check using 95 positive place invariants in 24 ms returned sat
[2024-05-31 21:33:13] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 15 ms returned sat
[2024-05-31 21:33:13] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:33:14] [INFO ] After 203ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:14] [INFO ] Deduced a trap composed of 302 places in 414 ms of which 1 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 300 places in 420 ms of which 1 ms to minimize.
[2024-05-31 21:33:15] [INFO ] Deduced a trap composed of 300 places in 416 ms of which 0 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 306 places in 420 ms of which 1 ms to minimize.
[2024-05-31 21:33:16] [INFO ] Deduced a trap composed of 302 places in 416 ms of which 1 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 310 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 1 ms to minimize.
[2024-05-31 21:33:17] [INFO ] Deduced a trap composed of 300 places in 373 ms of which 0 ms to minimize.
[2024-05-31 21:33:18] [INFO ] Deduced a trap composed of 300 places in 369 ms of which 0 ms to minimize.
[2024-05-31 21:33:18] [INFO ] Deduced a trap composed of 304 places in 376 ms of which 2 ms to minimize.
[2024-05-31 21:33:19] [INFO ] Deduced a trap composed of 304 places in 339 ms of which 1 ms to minimize.
[2024-05-31 21:33:19] [INFO ] Deduced a trap composed of 300 places in 391 ms of which 0 ms to minimize.
[2024-05-31 21:33:20] [INFO ] Deduced a trap composed of 298 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:33:21] [INFO ] Deduced a trap composed of 304 places in 410 ms of which 1 ms to minimize.
[2024-05-31 21:33:22] [INFO ] Deduced a trap composed of 298 places in 359 ms of which 0 ms to minimize.
[2024-05-31 21:33:22] [INFO ] Deduced a trap composed of 308 places in 331 ms of which 1 ms to minimize.
[2024-05-31 21:33:23] [INFO ] Deduced a trap composed of 308 places in 365 ms of which 1 ms to minimize.
[2024-05-31 21:33:23] [INFO ] Deduced a trap composed of 306 places in 327 ms of which 1 ms to minimize.
[2024-05-31 21:33:24] [INFO ] Deduced a trap composed of 304 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:33:24] [INFO ] Deduced a trap composed of 310 places in 387 ms of which 1 ms to minimize.
[2024-05-31 21:33:25] [INFO ] Deduced a trap composed of 296 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:33:25] [INFO ] Deduced a trap composed of 302 places in 377 ms of which 1 ms to minimize.
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 296 places in 410 ms of which 1 ms to minimize.
[2024-05-31 21:33:26] [INFO ] Deduced a trap composed of 308 places in 391 ms of which 1 ms to minimize.
[2024-05-31 21:33:27] [INFO ] Deduced a trap composed of 296 places in 439 ms of which 1 ms to minimize.
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 296 places in 436 ms of which 1 ms to minimize.
[2024-05-31 21:33:28] [INFO ] Deduced a trap composed of 290 places in 417 ms of which 1 ms to minimize.
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 288 places in 426 ms of which 0 ms to minimize.
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 304 places in 409 ms of which 1 ms to minimize.
Reachability property qltransition_23 is true.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 300 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 299 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:33:32] [INFO ] Deduced a trap composed of 304 places in 337 ms of which 1 ms to minimize.
[2024-05-31 21:33:32] [INFO ] Deduced a trap composed of 309 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 296 places in 370 ms of which 0 ms to minimize.
Reachability property qltransition_18 is true.
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 301 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:33:33] [INFO ] Deduced a trap composed of 296 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 290 places in 377 ms of which 1 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 294 places in 392 ms of which 0 ms to minimize.
[2024-05-31 21:33:35] [INFO ] Deduced a trap composed of 313 places in 394 ms of which 0 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 298 places in 426 ms of which 1 ms to minimize.
[2024-05-31 21:33:36] [INFO ] Deduced a trap composed of 292 places in 409 ms of which 0 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 302 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:33:37] [INFO ] Deduced a trap composed of 296 places in 390 ms of which 1 ms to minimize.
[2024-05-31 21:33:38] [INFO ] Deduced a trap composed of 299 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:33:40] [INFO ] Deduced a trap composed of 294 places in 428 ms of which 1 ms to minimize.
[2024-05-31 21:33:40] [INFO ] Deduced a trap composed of 306 places in 386 ms of which 1 ms to minimize.
Reachability property qltransition_0 is true.
SDD proceeding with computation,7 properties remain. new max is 65536
SDD size :19746 after 55322
[2024-05-31 21:33:42] [INFO ] Deduced a trap composed of 294 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:33:43] [INFO ] Deduced a trap composed of 290 places in 357 ms of which 0 ms to minimize.
[2024-05-31 21:33:43] [INFO ] Deduced a trap composed of 292 places in 343 ms of which 1 ms to minimize.
[2024-05-31 21:33:43] [INFO ] Deduced a trap composed of 304 places in 324 ms of which 1 ms to minimize.
[2024-05-31 21:33:44] [INFO ] Deduced a trap composed of 294 places in 325 ms of which 1 ms to minimize.
[2024-05-31 21:33:44] [INFO ] Deduced a trap composed of 310 places in 289 ms of which 0 ms to minimize.
[2024-05-31 21:33:44] [INFO ] Deduced a trap composed of 296 places in 344 ms of which 1 ms to minimize.
[2024-05-31 21:33:45] [INFO ] Deduced a trap composed of 298 places in 331 ms of which 0 ms to minimize.
[2024-05-31 21:33:45] [INFO ] Deduced a trap composed of 302 places in 378 ms of which 0 ms to minimize.
[2024-05-31 21:33:46] [INFO ] Deduced a trap composed of 300 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:33:46] [INFO ] Deduced a trap composed of 300 places in 391 ms of which 1 ms to minimize.
[2024-05-31 21:33:50] [INFO ] Deduced a trap composed of 304 places in 418 ms of which 1 ms to minimize.
[2024-05-31 21:33:51] [INFO ] Deduced a trap composed of 296 places in 416 ms of which 1 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 294 places in 427 ms of which 0 ms to minimize.
[2024-05-31 21:33:52] [INFO ] Deduced a trap composed of 298 places in 386 ms of which 1 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 307 places in 370 ms of which 0 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 310 places in 346 ms of which 1 ms to minimize.
[2024-05-31 21:33:53] [INFO ] Deduced a trap composed of 288 places in 307 ms of which 1 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 292 places in 299 ms of which 1 ms to minimize.
[2024-05-31 21:33:54] [INFO ] Deduced a trap composed of 288 places in 355 ms of which 1 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 300 places in 354 ms of which 1 ms to minimize.
[2024-05-31 21:33:55] [INFO ] Deduced a trap composed of 304 places in 361 ms of which 0 ms to minimize.
[2024-05-31 21:33:56] [INFO ] Deduced a trap composed of 304 places in 388 ms of which 1 ms to minimize.
[2024-05-31 21:33:57] [INFO ] Deduced a trap composed of 290 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:33:58] [INFO ] Deduced a trap composed of 301 places in 366 ms of which 0 ms to minimize.
[2024-05-31 21:33:58] [INFO ] Deduced a trap composed of 308 places in 320 ms of which 1 ms to minimize.
[2024-05-31 21:33:59] [INFO ] Deduced a trap composed of 302 places in 421 ms of which 1 ms to minimize.
[2024-05-31 21:33:59] [INFO ] Deduced a trap composed of 306 places in 376 ms of which 1 ms to minimize.
[2024-05-31 21:34:00] [INFO ] Deduced a trap composed of 302 places in 314 ms of which 0 ms to minimize.
[2024-05-31 21:34:01] [INFO ] Deduced a trap composed of 306 places in 383 ms of which 1 ms to minimize.
[2024-05-31 21:34:01] [INFO ] Deduced a trap composed of 292 places in 373 ms of which 0 ms to minimize.
[2024-05-31 21:34:02] [INFO ] Deduced a trap composed of 296 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:34:03] [INFO ] Deduced a trap composed of 309 places in 336 ms of which 1 ms to minimize.
[2024-05-31 21:34:04] [INFO ] Deduced a trap composed of 296 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:34:05] [INFO ] Deduced a trap composed of 294 places in 376 ms of which 10 ms to minimize.
[2024-05-31 21:34:06] [INFO ] Deduced a trap composed of 309 places in 390 ms of which 1 ms to minimize.
[2024-05-31 21:34:08] [INFO ] Deduced a trap composed of 307 places in 352 ms of which 1 ms to minimize.
[2024-05-31 21:34:08] [INFO ] Deduced a trap composed of 311 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:34:09] [INFO ] Deduced a trap composed of 296 places in 353 ms of which 1 ms to minimize.
[2024-05-31 21:34:09] [INFO ] Deduced a trap composed of 292 places in 303 ms of which 1 ms to minimize.
[2024-05-31 21:34:10] [INFO ] Deduced a trap composed of 290 places in 340 ms of which 0 ms to minimize.
[2024-05-31 21:34:10] [INFO ] Deduced a trap composed of 298 places in 367 ms of which 0 ms to minimize.
[2024-05-31 21:34:10] [INFO ] Deduced a trap composed of 294 places in 313 ms of which 1 ms to minimize.
[2024-05-31 21:34:11] [INFO ] Deduced a trap composed of 296 places in 315 ms of which 1 ms to minimize.
[2024-05-31 21:34:11] [INFO ] Deduced a trap composed of 300 places in 367 ms of which 0 ms to minimize.
[2024-05-31 21:34:14] [INFO ] Deduced a trap composed of 296 places in 362 ms of which 1 ms to minimize.
[2024-05-31 21:34:15] [INFO ] Deduced a trap composed of 294 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 292 places in 410 ms of which 1 ms to minimize.
[2024-05-31 21:34:17] [INFO ] Deduced a trap composed of 292 places in 354 ms of which 1 ms to minimize.
[2024-05-31 21:34:18] [INFO ] Deduced a trap composed of 298 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:34:19] [INFO ] Deduced a trap composed of 294 places in 368 ms of which 1 ms to minimize.
[2024-05-31 21:34:21] [INFO ] Deduced a trap composed of 298 places in 381 ms of which 0 ms to minimize.
[2024-05-31 21:34:29] [INFO ] Deduced a trap composed of 288 places in 453 ms of which 1 ms to minimize.
[2024-05-31 21:34:30] [INFO ] Deduced a trap composed of 292 places in 434 ms of which 1 ms to minimize.
[2024-05-31 21:34:35] [INFO ] Deduced a trap composed of 300 places in 450 ms of which 1 ms to minimize.
Reachability property qltransition_12 is true.
[2024-05-31 21:34:39] [INFO ] Deduced a trap composed of 296 places in 455 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :55322 after 215368
[2024-05-31 21:34:48] [INFO ] Trap strengthening (SAT) tested/added 102/102 trap constraints in 94226 ms
[2024-05-31 21:34:48] [INFO ] After 94519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:34:48] [INFO ] After 95096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 37 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 38 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-31 21:34:48] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:34:48] [INFO ] Invariant cache hit.
[2024-05-31 21:34:49] [INFO ] Implicit Places using invariants in 496 ms returned []
[2024-05-31 21:34:49] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:34:49] [INFO ] Invariant cache hit.
[2024-05-31 21:34:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:34:53] [INFO ] Implicit Places using invariants and state equation in 4613 ms returned []
Implicit Place search using SMT with State Equation took 5128 ms to find 0 implicit places.
[2024-05-31 21:34:53] [INFO ] Redundant transitions in 172 ms returned []
[2024-05-31 21:34:53] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:34:53] [INFO ] Invariant cache hit.
[2024-05-31 21:34:54] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6129 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7287 resets, run finished after 1109 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:34:55] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:34:55] [INFO ] Invariant cache hit.
[2024-05-31 21:34:55] [INFO ] [Real]Absence check using 95 positive place invariants in 26 ms returned sat
[2024-05-31 21:34:55] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 21:34:56] [INFO ] After 399ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:34:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:34:56] [INFO ] After 94ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:34:56] [INFO ] After 192ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:34:56] [INFO ] After 765ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:34:56] [INFO ] [Nat]Absence check using 95 positive place invariants in 35 ms returned sat
[2024-05-31 21:34:56] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:34:57] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:34:57] [INFO ] After 133ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:34:57] [INFO ] Deduced a trap composed of 296 places in 410 ms of which 3 ms to minimize.
[2024-05-31 21:34:58] [INFO ] Deduced a trap composed of 300 places in 389 ms of which 1 ms to minimize.
[2024-05-31 21:34:58] [INFO ] Deduced a trap composed of 298 places in 425 ms of which 1 ms to minimize.
[2024-05-31 21:34:59] [INFO ] Deduced a trap composed of 296 places in 418 ms of which 1 ms to minimize.
[2024-05-31 21:34:59] [INFO ] Deduced a trap composed of 294 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:35:00] [INFO ] Deduced a trap composed of 302 places in 401 ms of which 1 ms to minimize.
[2024-05-31 21:35:00] [INFO ] Deduced a trap composed of 304 places in 368 ms of which 0 ms to minimize.
[2024-05-31 21:35:00] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:35:01] [INFO ] Deduced a trap composed of 302 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:35:01] [INFO ] Deduced a trap composed of 310 places in 414 ms of which 1 ms to minimize.
[2024-05-31 21:35:02] [INFO ] Deduced a trap composed of 304 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:35:02] [INFO ] Deduced a trap composed of 302 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:35:03] [INFO ] Deduced a trap composed of 298 places in 362 ms of which 1 ms to minimize.
[2024-05-31 21:35:03] [INFO ] Deduced a trap composed of 296 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:35:04] [INFO ] Deduced a trap composed of 298 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:35:04] [INFO ] Deduced a trap composed of 300 places in 416 ms of which 0 ms to minimize.
[2024-05-31 21:35:05] [INFO ] Deduced a trap composed of 306 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:35:05] [INFO ] Deduced a trap composed of 298 places in 407 ms of which 0 ms to minimize.
[2024-05-31 21:35:06] [INFO ] Deduced a trap composed of 296 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:35:07] [INFO ] Deduced a trap composed of 300 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:35:07] [INFO ] Deduced a trap composed of 296 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:35:08] [INFO ] Deduced a trap composed of 298 places in 415 ms of which 0 ms to minimize.
[2024-05-31 21:35:08] [INFO ] Deduced a trap composed of 298 places in 416 ms of which 1 ms to minimize.
[2024-05-31 21:35:09] [INFO ] Deduced a trap composed of 298 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:35:09] [INFO ] Deduced a trap composed of 290 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:35:10] [INFO ] Deduced a trap composed of 302 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Deduced a trap composed of 304 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:35:11] [INFO ] Deduced a trap composed of 302 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:35:12] [INFO ] Deduced a trap composed of 306 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:35:12] [INFO ] Deduced a trap composed of 296 places in 426 ms of which 1 ms to minimize.
[2024-05-31 21:35:13] [INFO ] Deduced a trap composed of 298 places in 399 ms of which 1 ms to minimize.
[2024-05-31 21:35:13] [INFO ] Deduced a trap composed of 296 places in 408 ms of which 1 ms to minimize.
[2024-05-31 21:35:14] [INFO ] Deduced a trap composed of 296 places in 398 ms of which 1 ms to minimize.
[2024-05-31 21:35:14] [INFO ] Deduced a trap composed of 302 places in 408 ms of which 1 ms to minimize.
[2024-05-31 21:35:15] [INFO ] Deduced a trap composed of 298 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:35:15] [INFO ] Deduced a trap composed of 296 places in 407 ms of which 1 ms to minimize.
[2024-05-31 21:35:16] [INFO ] Deduced a trap composed of 302 places in 397 ms of which 0 ms to minimize.
[2024-05-31 21:35:16] [INFO ] Deduced a trap composed of 308 places in 381 ms of which 1 ms to minimize.
[2024-05-31 21:35:16] [INFO ] Deduced a trap composed of 298 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:35:17] [INFO ] Deduced a trap composed of 294 places in 402 ms of which 1 ms to minimize.
[2024-05-31 21:35:17] [INFO ] Deduced a trap composed of 298 places in 401 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :215368 after 414068
[2024-05-31 21:35:18] [INFO ] Deduced a trap composed of 308 places in 406 ms of which 0 ms to minimize.
[2024-05-31 21:35:21] [INFO ] Deduced a trap composed of 308 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:35:22] [INFO ] Deduced a trap composed of 306 places in 456 ms of which 1 ms to minimize.
[2024-05-31 21:35:22] [INFO ] Deduced a trap composed of 302 places in 399 ms of which 1 ms to minimize.
[2024-05-31 21:35:23] [INFO ] Deduced a trap composed of 302 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:35:23] [INFO ] Deduced a trap composed of 304 places in 383 ms of which 1 ms to minimize.
[2024-05-31 21:35:25] [INFO ] Deduced a trap composed of 298 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:35:26] [INFO ] Deduced a trap composed of 304 places in 415 ms of which 1 ms to minimize.
[2024-05-31 21:35:26] [INFO ] Deduced a trap composed of 296 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:35:28] [INFO ] Deduced a trap composed of 298 places in 424 ms of which 2 ms to minimize.
[2024-05-31 21:35:29] [INFO ] Deduced a trap composed of 308 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:35:33] [INFO ] Deduced a trap composed of 302 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:35:42] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 45760 ms
[2024-05-31 21:35:43] [INFO ] After 46129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:35:43] [INFO ] After 46648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72461 resets, run finished after 8864 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8304 resets, run finished after 1683 ms. (steps per millisecond=594 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4522527 steps, run timeout after 30001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 4522527 steps, saw 771602 distinct states, run finished after 30002 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:36:23] [INFO ] Flow matrix only has 1512 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 95 positive place invariants in 19 ms returned sat
[2024-05-31 21:36:23] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 21:36:23] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:36:24] [INFO ] [Nat]Absence check using 95 positive place invariants in 17 ms returned sat
[2024-05-31 21:36:24] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 16 ms returned sat
[2024-05-31 21:36:24] [INFO ] After 386ms 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 269ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:25] [INFO ] Deduced a trap composed of 129 places in 336 ms of which 1 ms to minimize.
[2024-05-31 21:36:25] [INFO ] Deduced a trap composed of 311 places in 456 ms of which 1 ms to minimize.
[2024-05-31 21:36:26] [INFO ] Deduced a trap composed of 305 places in 453 ms of which 1 ms to minimize.
[2024-05-31 21:36:26] [INFO ] Deduced a trap composed of 290 places in 444 ms of which 1 ms to minimize.
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 305 places in 449 ms of which 0 ms to minimize.
[2024-05-31 21:36:27] [INFO ] Deduced a trap composed of 300 places in 431 ms of which 0 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 307 places in 465 ms of which 1 ms to minimize.
[2024-05-31 21:36:28] [INFO ] Deduced a trap composed of 292 places in 461 ms of which 1 ms to minimize.
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 307 places in 469 ms of which 1 ms to minimize.
[2024-05-31 21:36:29] [INFO ] Deduced a trap composed of 303 places in 463 ms of which 0 ms to minimize.
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 294 places in 454 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 262144
[2024-05-31 21:36:30] [INFO ] Deduced a trap composed of 319 places in 420 ms of which 1 ms to minimize.
SDD size :414068 after 830831
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 309 places in 424 ms of which 1 ms to minimize.
[2024-05-31 21:36:31] [INFO ] Deduced a trap composed of 302 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 316 places in 371 ms of which 2 ms to minimize.
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 300 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 305 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 304 places in 410 ms of which 0 ms to minimize.
[2024-05-31 21:36:34] [INFO ] Deduced a trap composed of 302 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:36:34] [INFO ] Deduced a trap composed of 309 places in 385 ms of which 1 ms to minimize.
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 306 places in 424 ms of which 2 ms to minimize.
[2024-05-31 21:36:37] [INFO ] Deduced a trap composed of 294 places in 439 ms of which 3 ms to minimize.
[2024-05-31 21:36:37] [INFO ] Deduced a trap composed of 300 places in 417 ms of which 2 ms to minimize.
[2024-05-31 21:36:38] [INFO ] Deduced a trap composed of 317 places in 389 ms of which 1 ms to minimize.
[2024-05-31 21:36:38] [INFO ] Deduced a trap composed of 296 places in 391 ms of which 1 ms to minimize.
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 294 places in 377 ms of which 0 ms to minimize.
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 317 places in 415 ms of which 1 ms to minimize.
[2024-05-31 21:36:40] [INFO ] Deduced a trap composed of 300 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:36:41] [INFO ] Deduced a trap composed of 292 places in 397 ms of which 0 ms to minimize.
[2024-05-31 21:36:41] [INFO ] Deduced a trap composed of 308 places in 397 ms of which 1 ms to minimize.
[2024-05-31 21:36:42] [INFO ] Deduced a trap composed of 294 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:36:42] [INFO ] Deduced a trap composed of 302 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:36:43] [INFO ] Deduced a trap composed of 300 places in 415 ms of which 0 ms to minimize.
[2024-05-31 21:36:43] [INFO ] Deduced a trap composed of 300 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:36:43] [INFO ] Deduced a trap composed of 304 places in 418 ms of which 1 ms to minimize.
[2024-05-31 21:36:44] [INFO ] Deduced a trap composed of 296 places in 419 ms of which 0 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 298 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:36:45] [INFO ] Deduced a trap composed of 298 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:36:46] [INFO ] Deduced a trap composed of 296 places in 415 ms of which 1 ms to minimize.
[2024-05-31 21:36:46] [INFO ] Deduced a trap composed of 306 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:36:47] [INFO ] Deduced a trap composed of 300 places in 420 ms of which 1 ms to minimize.
[2024-05-31 21:36:48] [INFO ] Deduced a trap composed of 300 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:36:48] [INFO ] Deduced a trap composed of 298 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:36:49] [INFO ] Deduced a trap composed of 300 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:36:50] [INFO ] Deduced a trap composed of 300 places in 417 ms of which 1 ms to minimize.
[2024-05-31 21:36:51] [INFO ] Deduced a trap composed of 300 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:36:51] [INFO ] Deduced a trap composed of 304 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:36:52] [INFO ] Deduced a trap composed of 294 places in 407 ms of which 1 ms to minimize.
[2024-05-31 21:36:52] [INFO ] Deduced a trap composed of 298 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:36:53] [INFO ] Deduced a trap composed of 306 places in 410 ms of which 1 ms to minimize.
[2024-05-31 21:36:53] [INFO ] Deduced a trap composed of 296 places in 408 ms of which 1 ms to minimize.
[2024-05-31 21:36:54] [INFO ] Deduced a trap composed of 296 places in 421 ms of which 1 ms to minimize.
[2024-05-31 21:36:54] [INFO ] Deduced a trap composed of 294 places in 419 ms of which 1 ms to minimize.
[2024-05-31 21:36:55] [INFO ] Deduced a trap composed of 296 places in 418 ms of which 1 ms to minimize.
[2024-05-31 21:36:58] [INFO ] Deduced a trap composed of 300 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:36:58] [INFO ] Deduced a trap composed of 290 places in 405 ms of which 0 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 298 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 298 places in 412 ms of which 1 ms to minimize.
[2024-05-31 21:37:00] [INFO ] Deduced a trap composed of 294 places in 415 ms of which 0 ms to minimize.
[2024-05-31 21:37:01] [INFO ] Deduced a trap composed of 292 places in 421 ms of which 1 ms to minimize.
[2024-05-31 21:37:01] [INFO ] Deduced a trap composed of 306 places in 412 ms of which 0 ms to minimize.
[2024-05-31 21:37:02] [INFO ] Deduced a trap composed of 298 places in 419 ms of which 1 ms to minimize.
[2024-05-31 21:37:02] [INFO ] Deduced a trap composed of 304 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:37:04] [INFO ] Deduced a trap composed of 302 places in 416 ms of which 1 ms to minimize.
[2024-05-31 21:37:04] [INFO ] Deduced a trap composed of 294 places in 412 ms of which 1 ms to minimize.
[2024-05-31 21:37:05] [INFO ] Deduced a trap composed of 298 places in 419 ms of which 1 ms to minimize.
[2024-05-31 21:37:05] [INFO ] Deduced a trap composed of 304 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:37:06] [INFO ] Deduced a trap composed of 302 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:37:06] [INFO ] Deduced a trap composed of 302 places in 408 ms of which 0 ms to minimize.
[2024-05-31 21:37:08] [INFO ] Deduced a trap composed of 304 places in 418 ms of which 1 ms to minimize.
[2024-05-31 21:37:10] [INFO ] Deduced a trap composed of 292 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:37:11] [INFO ] Deduced a trap composed of 298 places in 386 ms of which 1 ms to minimize.
[2024-05-31 21:37:12] [INFO ] Deduced a trap composed of 306 places in 415 ms of which 1 ms to minimize.
[2024-05-31 21:37:12] [INFO ] Deduced a trap composed of 298 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:37:13] [INFO ] Deduced a trap composed of 300 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:37:13] [INFO ] Deduced a trap composed of 298 places in 377 ms of which 1 ms to minimize.
[2024-05-31 21:37:14] [INFO ] Deduced a trap composed of 304 places in 414 ms of which 1 ms to minimize.
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 304 places in 419 ms of which 1 ms to minimize.
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 298 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:37:17] [INFO ] Deduced a trap composed of 300 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:37:18] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:37:27] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 62616 ms
[2024-05-31 21:37:27] [INFO ] After 62973ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:37:27] [INFO ] After 63489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 39 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 82 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 54 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-31 21:37:27] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:37:27] [INFO ] Invariant cache hit.
[2024-05-31 21:37:28] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-31 21:37:28] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:37:28] [INFO ] Invariant cache hit.
[2024-05-31 21:37:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:37:32] [INFO ] Implicit Places using invariants and state equation in 4752 ms returned []
Implicit Place search using SMT with State Equation took 5363 ms to find 0 implicit places.
[2024-05-31 21:37:33] [INFO ] Redundant transitions in 92 ms returned []
[2024-05-31 21:37:33] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:37:33] [INFO ] Invariant cache hit.
[2024-05-31 21:37:33] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6379 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 100000 steps, including 7289 resets, run finished after 987 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:37:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:37:34] [INFO ] Invariant cache hit.
[2024-05-31 21:37:35] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2024-05-31 21:37:35] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 21:37:35] [INFO ] After 418ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:37:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:37:35] [INFO ] After 140ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-31 21:37:35] [INFO ] After 281ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:37:35] [INFO ] After 869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:37:35] [INFO ] [Nat]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-05-31 21:37:35] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 38 ms returned sat
[2024-05-31 21:37:36] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:37:36] [INFO ] After 195ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:37:37] [INFO ] Deduced a trap composed of 296 places in 454 ms of which 1 ms to minimize.
[2024-05-31 21:37:37] [INFO ] Deduced a trap composed of 300 places in 433 ms of which 1 ms to minimize.
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 298 places in 445 ms of which 1 ms to minimize.
[2024-05-31 21:37:38] [INFO ] Deduced a trap composed of 296 places in 463 ms of which 1 ms to minimize.
[2024-05-31 21:37:39] [INFO ] Deduced a trap composed of 294 places in 457 ms of which 1 ms to minimize.
[2024-05-31 21:37:39] [INFO ] Deduced a trap composed of 302 places in 417 ms of which 1 ms to minimize.
[2024-05-31 21:37:40] [INFO ] Deduced a trap composed of 304 places in 397 ms of which 1 ms to minimize.
[2024-05-31 21:37:40] [INFO ] Deduced a trap composed of 302 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:37:41] [INFO ] Deduced a trap composed of 302 places in 422 ms of which 1 ms to minimize.
[2024-05-31 21:37:41] [INFO ] Deduced a trap composed of 310 places in 457 ms of which 0 ms to minimize.
[2024-05-31 21:37:42] [INFO ] Deduced a trap composed of 304 places in 444 ms of which 1 ms to minimize.
[2024-05-31 21:37:42] [INFO ] Deduced a trap composed of 302 places in 443 ms of which 0 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 298 places in 428 ms of which 1 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 296 places in 455 ms of which 1 ms to minimize.
[2024-05-31 21:37:44] [INFO ] Deduced a trap composed of 298 places in 445 ms of which 1 ms to minimize.
[2024-05-31 21:37:45] [INFO ] Deduced a trap composed of 300 places in 454 ms of which 1 ms to minimize.
[2024-05-31 21:37:45] [INFO ] Deduced a trap composed of 306 places in 430 ms of which 1 ms to minimize.
[2024-05-31 21:37:46] [INFO ] Deduced a trap composed of 298 places in 440 ms of which 1 ms to minimize.
[2024-05-31 21:37:46] [INFO ] Deduced a trap composed of 296 places in 421 ms of which 0 ms to minimize.
[2024-05-31 21:37:47] [INFO ] Deduced a trap composed of 300 places in 453 ms of which 1 ms to minimize.
[2024-05-31 21:37:48] [INFO ] Deduced a trap composed of 296 places in 451 ms of which 1 ms to minimize.
[2024-05-31 21:37:48] [INFO ] Deduced a trap composed of 298 places in 439 ms of which 1 ms to minimize.
[2024-05-31 21:37:49] [INFO ] Deduced a trap composed of 298 places in 458 ms of which 1 ms to minimize.
[2024-05-31 21:37:49] [INFO ] Deduced a trap composed of 298 places in 449 ms of which 1 ms to minimize.
[2024-05-31 21:37:50] [INFO ] Deduced a trap composed of 290 places in 455 ms of which 0 ms to minimize.
[2024-05-31 21:37:51] [INFO ] Deduced a trap composed of 302 places in 446 ms of which 1 ms to minimize.
[2024-05-31 21:37:51] [INFO ] Deduced a trap composed of 304 places in 455 ms of which 1 ms to minimize.
[2024-05-31 21:37:52] [INFO ] Deduced a trap composed of 302 places in 450 ms of which 0 ms to minimize.
[2024-05-31 21:37:52] [INFO ] Deduced a trap composed of 306 places in 435 ms of which 1 ms to minimize.
[2024-05-31 21:37:53] [INFO ] Deduced a trap composed of 296 places in 444 ms of which 1 ms to minimize.
[2024-05-31 21:37:53] [INFO ] Deduced a trap composed of 298 places in 442 ms of which 1 ms to minimize.
[2024-05-31 21:37:54] [INFO ] Deduced a trap composed of 296 places in 429 ms of which 1 ms to minimize.
[2024-05-31 21:37:54] [INFO ] Deduced a trap composed of 296 places in 396 ms of which 0 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 302 places in 393 ms of which 0 ms to minimize.
[2024-05-31 21:37:55] [INFO ] Deduced a trap composed of 298 places in 407 ms of which 0 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 296 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:37:56] [INFO ] Deduced a trap composed of 302 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:37:57] [INFO ] Deduced a trap composed of 308 places in 423 ms of which 1 ms to minimize.
[2024-05-31 21:37:57] [INFO ] Deduced a trap composed of 298 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:37:58] [INFO ] Deduced a trap composed of 294 places in 383 ms of which 1 ms to minimize.
[2024-05-31 21:37:58] [INFO ] Deduced a trap composed of 298 places in 414 ms of which 1 ms to minimize.
[2024-05-31 21:37:59] [INFO ] Deduced a trap composed of 308 places in 449 ms of which 1 ms to minimize.
[2024-05-31 21:38:02] [INFO ] Deduced a trap composed of 308 places in 454 ms of which 1 ms to minimize.
[2024-05-31 21:38:03] [INFO ] Deduced a trap composed of 306 places in 451 ms of which 1 ms to minimize.
[2024-05-31 21:38:04] [INFO ] Deduced a trap composed of 302 places in 464 ms of which 1 ms to minimize.
[2024-05-31 21:38:04] [INFO ] Deduced a trap composed of 302 places in 453 ms of which 1 ms to minimize.
[2024-05-31 21:38:05] [INFO ] Deduced a trap composed of 304 places in 425 ms of which 1 ms to minimize.
[2024-05-31 21:38:06] [INFO ] Deduced a trap composed of 298 places in 447 ms of which 1 ms to minimize.
[2024-05-31 21:38:07] [INFO ] Deduced a trap composed of 304 places in 460 ms of which 1 ms to minimize.
[2024-05-31 21:38:08] [INFO ] Deduced a trap composed of 296 places in 447 ms of which 1 ms to minimize.
[2024-05-31 21:38:10] [INFO ] Deduced a trap composed of 298 places in 448 ms of which 1 ms to minimize.
[2024-05-31 21:38:11] [INFO ] Deduced a trap composed of 308 places in 451 ms of which 0 ms to minimize.
[2024-05-31 21:38:16] [INFO ] Deduced a trap composed of 302 places in 450 ms of which 1 ms to minimize.
[2024-05-31 21:38:25] [INFO ] Trap strengthening (SAT) tested/added 53/53 trap constraints in 48423 ms
[2024-05-31 21:38:25] [INFO ] After 48754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:38:25] [INFO ] After 49480ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 737 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 427116 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 427116 steps, saw 68541 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:38:28] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:38:28] [INFO ] Invariant cache hit.
[2024-05-31 21:38:28] [INFO ] [Real]Absence check using 95 positive place invariants in 25 ms returned sat
[2024-05-31 21:38:28] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-31 21:38:28] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:38:28] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-31 21:38:28] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 24 ms returned sat
[2024-05-31 21:38:29] [INFO ] After 399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:38:29] [INFO ] After 411ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:30] [INFO ] Deduced a trap composed of 129 places in 438 ms of which 1 ms to minimize.
[2024-05-31 21:38:30] [INFO ] Deduced a trap composed of 299 places in 419 ms of which 1 ms to minimize.
[2024-05-31 21:38:31] [INFO ] Deduced a trap composed of 311 places in 412 ms of which 1 ms to minimize.
[2024-05-31 21:38:31] [INFO ] Deduced a trap composed of 309 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:38:32] [INFO ] Deduced a trap composed of 292 places in 411 ms of which 0 ms to minimize.
[2024-05-31 21:38:32] [INFO ] Deduced a trap composed of 306 places in 393 ms of which 1 ms to minimize.
[2024-05-31 21:38:33] [INFO ] Deduced a trap composed of 288 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:38:33] [INFO ] Deduced a trap composed of 292 places in 407 ms of which 1 ms to minimize.
[2024-05-31 21:38:34] [INFO ] Deduced a trap composed of 298 places in 417 ms of which 0 ms to minimize.
[2024-05-31 21:38:34] [INFO ] Deduced a trap composed of 290 places in 421 ms of which 1 ms to minimize.
[2024-05-31 21:38:35] [INFO ] Deduced a trap composed of 302 places in 409 ms of which 1 ms to minimize.
[2024-05-31 21:38:35] [INFO ] Deduced a trap composed of 302 places in 411 ms of which 0 ms to minimize.
[2024-05-31 21:38:36] [INFO ] Deduced a trap composed of 302 places in 384 ms of which 1 ms to minimize.
[2024-05-31 21:38:36] [INFO ] Deduced a trap composed of 298 places in 399 ms of which 1 ms to minimize.
[2024-05-31 21:38:37] [INFO ] Deduced a trap composed of 304 places in 407 ms of which 1 ms to minimize.
[2024-05-31 21:38:37] [INFO ] Deduced a trap composed of 290 places in 397 ms of which 1 ms to minimize.
[2024-05-31 21:38:38] [INFO ] Deduced a trap composed of 304 places in 383 ms of which 0 ms to minimize.
[2024-05-31 21:38:38] [INFO ] Deduced a trap composed of 298 places in 350 ms of which 1 ms to minimize.
[2024-05-31 21:38:39] [INFO ] Deduced a trap composed of 300 places in 364 ms of which 1 ms to minimize.
[2024-05-31 21:38:39] [INFO ] Deduced a trap composed of 300 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:38:40] [INFO ] Deduced a trap composed of 302 places in 368 ms of which 1 ms to minimize.
[2024-05-31 21:38:40] [INFO ] Deduced a trap composed of 302 places in 388 ms of which 1 ms to minimize.
[2024-05-31 21:38:41] [INFO ] Deduced a trap composed of 302 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:38:41] [INFO ] Deduced a trap composed of 304 places in 331 ms of which 1 ms to minimize.
[2024-05-31 21:38:41] [INFO ] Deduced a trap composed of 298 places in 358 ms of which 0 ms to minimize.
[2024-05-31 21:38:42] [INFO ] Deduced a trap composed of 296 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:38:42] [INFO ] Deduced a trap composed of 296 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:38:43] [INFO ] Deduced a trap composed of 298 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:38:43] [INFO ] Deduced a trap composed of 300 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:38:44] [INFO ] Deduced a trap composed of 296 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:38:44] [INFO ] Deduced a trap composed of 302 places in 416 ms of which 1 ms to minimize.
[2024-05-31 21:38:45] [INFO ] Deduced a trap composed of 304 places in 416 ms of which 1 ms to minimize.
[2024-05-31 21:38:45] [INFO ] Deduced a trap composed of 300 places in 418 ms of which 0 ms to minimize.
[2024-05-31 21:38:46] [INFO ] Deduced a trap composed of 298 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:38:47] [INFO ] Deduced a trap composed of 306 places in 445 ms of which 1 ms to minimize.
[2024-05-31 21:38:47] [INFO ] Deduced a trap composed of 296 places in 390 ms of which 1 ms to minimize.
[2024-05-31 21:38:48] [INFO ] Deduced a trap composed of 300 places in 412 ms of which 1 ms to minimize.
[2024-05-31 21:38:48] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:38:49] [INFO ] Deduced a trap composed of 302 places in 423 ms of which 1 ms to minimize.
[2024-05-31 21:38:49] [INFO ] Deduced a trap composed of 296 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:38:50] [INFO ] Deduced a trap composed of 300 places in 407 ms of which 1 ms to minimize.
[2024-05-31 21:38:50] [INFO ] Deduced a trap composed of 300 places in 401 ms of which 1 ms to minimize.
[2024-05-31 21:38:51] [INFO ] Deduced a trap composed of 294 places in 410 ms of which 1 ms to minimize.
[2024-05-31 21:38:51] [INFO ] Deduced a trap composed of 306 places in 414 ms of which 1 ms to minimize.
[2024-05-31 21:38:52] [INFO ] Deduced a trap composed of 307 places in 415 ms of which 1 ms to minimize.
[2024-05-31 21:38:53] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24045 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
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:38:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:38:53] [INFO ] After 25023ms 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 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 29 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-31 21:38:53] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:38:53] [INFO ] Invariant cache hit.
[2024-05-31 21:38:54] [INFO ] Dead Transitions using invariants and state equation in 736 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 750/750 places, 1521/1521 transitions.
Incomplete random walk after 10000 steps, including 721 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 437661 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 437661 steps, saw 70155 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-31 21:38:57] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:38:57] [INFO ] Invariant cache hit.
[2024-05-31 21:38:57] [INFO ] [Real]Absence check using 95 positive place invariants in 27 ms returned sat
[2024-05-31 21:38:57] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-31 21:38:57] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:38:57] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-31 21:38:57] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 23 ms returned sat
[2024-05-31 21:38:58] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:38:58] [INFO ] After 295ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:59] [INFO ] Deduced a trap composed of 129 places in 441 ms of which 1 ms to minimize.
[2024-05-31 21:38:59] [INFO ] Deduced a trap composed of 299 places in 426 ms of which 1 ms to minimize.
[2024-05-31 21:39:00] [INFO ] Deduced a trap composed of 311 places in 423 ms of which 1 ms to minimize.
[2024-05-31 21:39:00] [INFO ] Deduced a trap composed of 309 places in 427 ms of which 1 ms to minimize.
[2024-05-31 21:39:01] [INFO ] Deduced a trap composed of 292 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:39:01] [INFO ] Deduced a trap composed of 306 places in 393 ms of which 1 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 288 places in 402 ms of which 1 ms to minimize.
[2024-05-31 21:39:02] [INFO ] Deduced a trap composed of 292 places in 390 ms of which 1 ms to minimize.
[2024-05-31 21:39:03] [INFO ] Deduced a trap composed of 298 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:39:03] [INFO ] Deduced a trap composed of 290 places in 366 ms of which 1 ms to minimize.
[2024-05-31 21:39:04] [INFO ] Deduced a trap composed of 302 places in 351 ms of which 1 ms to minimize.
[2024-05-31 21:39:04] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2024-05-31 21:39:05] [INFO ] Deduced a trap composed of 302 places in 386 ms of which 1 ms to minimize.
[2024-05-31 21:39:05] [INFO ] Deduced a trap composed of 298 places in 339 ms of which 1 ms to minimize.
[2024-05-31 21:39:06] [INFO ] Deduced a trap composed of 304 places in 385 ms of which 1 ms to minimize.
[2024-05-31 21:39:06] [INFO ] Deduced a trap composed of 290 places in 412 ms of which 1 ms to minimize.
[2024-05-31 21:39:07] [INFO ] Deduced a trap composed of 304 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:39:07] [INFO ] Deduced a trap composed of 298 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:39:08] [INFO ] Deduced a trap composed of 300 places in 392 ms of which 0 ms to minimize.
[2024-05-31 21:39:08] [INFO ] Deduced a trap composed of 300 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:39:09] [INFO ] Deduced a trap composed of 302 places in 357 ms of which 1 ms to minimize.
[2024-05-31 21:39:09] [INFO ] Deduced a trap composed of 302 places in 399 ms of which 0 ms to minimize.
[2024-05-31 21:39:10] [INFO ] Deduced a trap composed of 302 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:39:10] [INFO ] Deduced a trap composed of 304 places in 375 ms of which 1 ms to minimize.
[2024-05-31 21:39:11] [INFO ] Deduced a trap composed of 298 places in 377 ms of which 0 ms to minimize.
[2024-05-31 21:39:11] [INFO ] Deduced a trap composed of 296 places in 407 ms of which 1 ms to minimize.
[2024-05-31 21:39:12] [INFO ] Deduced a trap composed of 296 places in 393 ms of which 1 ms to minimize.
[2024-05-31 21:39:12] [INFO ] Deduced a trap composed of 298 places in 422 ms of which 1 ms to minimize.
[2024-05-31 21:39:12] [INFO ] Deduced a trap composed of 300 places in 394 ms of which 0 ms to minimize.
[2024-05-31 21:39:13] [INFO ] Deduced a trap composed of 296 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:39:14] [INFO ] Deduced a trap composed of 302 places in 405 ms of which 0 ms to minimize.
[2024-05-31 21:39:14] [INFO ] Deduced a trap composed of 304 places in 400 ms of which 1 ms to minimize.
[2024-05-31 21:39:14] [INFO ] Deduced a trap composed of 300 places in 418 ms of which 1 ms to minimize.
[2024-05-31 21:39:15] [INFO ] Deduced a trap composed of 298 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:39:16] [INFO ] Deduced a trap composed of 306 places in 406 ms of which 0 ms to minimize.
[2024-05-31 21:39:16] [INFO ] Deduced a trap composed of 296 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:39:17] [INFO ] Deduced a trap composed of 300 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:39:17] [INFO ] Deduced a trap composed of 302 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:39:18] [INFO ] Deduced a trap composed of 302 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:39:18] [INFO ] Deduced a trap composed of 296 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:39:19] [INFO ] Deduced a trap composed of 300 places in 396 ms of which 1 ms to minimize.
[2024-05-31 21:39:19] [INFO ] Deduced a trap composed of 300 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:39:20] [INFO ] Deduced a trap composed of 294 places in 411 ms of which 1 ms to minimize.
[2024-05-31 21:39:20] [INFO ] Deduced a trap composed of 306 places in 461 ms of which 1 ms to minimize.
[2024-05-31 21:39:21] [INFO ] Deduced a trap composed of 307 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:39:22] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 24066 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
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:39:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:39:22] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 61 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 31 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2024-05-31 21:39:22] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:39:22] [INFO ] Invariant cache hit.
[2024-05-31 21:39:23] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-31 21:39:23] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:39:23] [INFO ] Invariant cache hit.
[2024-05-31 21:39:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:39:27] [INFO ] Implicit Places using invariants and state equation in 4270 ms returned []
Implicit Place search using SMT with State Equation took 4915 ms to find 0 implicit places.
[2024-05-31 21:39:27] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-31 21:39:27] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2024-05-31 21:39:27] [INFO ] Invariant cache hit.
[2024-05-31 21:39:28] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5712 ms. Remains : 750/750 places, 1521/1521 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 750 transition count 1512
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 750 transition count 1511
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 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 178 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2024-05-31 21:39:28] [INFO ] Computed 102 invariants in 49 ms
[2024-05-31 21:39:28] [INFO ] [Real]Absence check using 95 positive place invariants in 23 ms returned sat
[2024-05-31 21:39:28] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-31 21:39:28] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:39:29] [INFO ] [Nat]Absence check using 95 positive place invariants in 23 ms returned sat
[2024-05-31 21:39:29] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:39:29] [INFO ] After 416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:39:29] [INFO ] Deduced a trap composed of 292 places in 304 ms of which 0 ms to minimize.
[2024-05-31 21:39:30] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 1 ms to minimize.
[2024-05-31 21:39:30] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 1 ms to minimize.
[2024-05-31 21:39:30] [INFO ] Deduced a trap composed of 294 places in 317 ms of which 0 ms to minimize.
[2024-05-31 21:39:31] [INFO ] Deduced a trap composed of 288 places in 323 ms of which 0 ms to minimize.
[2024-05-31 21:39:31] [INFO ] Deduced a trap composed of 298 places in 321 ms of which 1 ms to minimize.
[2024-05-31 21:39:32] [INFO ] Deduced a trap composed of 292 places in 335 ms of which 1 ms to minimize.
[2024-05-31 21:39:32] [INFO ] Deduced a trap composed of 300 places in 321 ms of which 1 ms to minimize.
[2024-05-31 21:39:32] [INFO ] Deduced a trap composed of 308 places in 334 ms of which 1 ms to minimize.
[2024-05-31 21:39:33] [INFO ] Deduced a trap composed of 298 places in 338 ms of which 1 ms to minimize.
[2024-05-31 21:39:33] [INFO ] Deduced a trap composed of 296 places in 320 ms of which 1 ms to minimize.
[2024-05-31 21:39:34] [INFO ] Deduced a trap composed of 288 places in 331 ms of which 1 ms to minimize.
[2024-05-31 21:39:34] [INFO ] Deduced a trap composed of 300 places in 322 ms of which 1 ms to minimize.
[2024-05-31 21:39:34] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 1 ms to minimize.
[2024-05-31 21:39:35] [INFO ] Deduced a trap composed of 304 places in 350 ms of which 0 ms to minimize.
[2024-05-31 21:39:35] [INFO ] Deduced a trap composed of 296 places in 319 ms of which 1 ms to minimize.
[2024-05-31 21:39:36] [INFO ] Deduced a trap composed of 302 places in 336 ms of which 1 ms to minimize.
[2024-05-31 21:39:36] [INFO ] Deduced a trap composed of 296 places in 316 ms of which 1 ms to minimize.
[2024-05-31 21:39:36] [INFO ] Deduced a trap composed of 294 places in 325 ms of which 1 ms to minimize.
[2024-05-31 21:39:37] [INFO ] Deduced a trap composed of 302 places in 322 ms of which 0 ms to minimize.
[2024-05-31 21:39:37] [INFO ] Deduced a trap composed of 294 places in 309 ms of which 1 ms to minimize.
[2024-05-31 21:39:37] [INFO ] Deduced a trap composed of 290 places in 314 ms of which 0 ms to minimize.
[2024-05-31 21:39:38] [INFO ] Deduced a trap composed of 288 places in 334 ms of which 0 ms to minimize.
[2024-05-31 21:39:38] [INFO ] Deduced a trap composed of 290 places in 315 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 306 places in 349 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 298 places in 359 ms of which 1 ms to minimize.
[2024-05-31 21:39:39] [INFO ] Deduced a trap composed of 296 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:39:40] [INFO ] Deduced a trap composed of 296 places in 345 ms of which 1 ms to minimize.
[2024-05-31 21:39:40] [INFO ] Deduced a trap composed of 298 places in 371 ms of which 0 ms to minimize.
[2024-05-31 21:39:41] [INFO ] Deduced a trap composed of 300 places in 371 ms of which 0 ms to minimize.
[2024-05-31 21:39:41] [INFO ] Deduced a trap composed of 302 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 304 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 298 places in 363 ms of which 1 ms to minimize.
[2024-05-31 21:39:42] [INFO ] Deduced a trap composed of 306 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:39:43] [INFO ] Deduced a trap composed of 302 places in 366 ms of which 1 ms to minimize.
[2024-05-31 21:39:43] [INFO ] Deduced a trap composed of 300 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:39:44] [INFO ] Deduced a trap composed of 296 places in 376 ms of which 1 ms to minimize.
[2024-05-31 21:39:44] [INFO ] Deduced a trap composed of 306 places in 363 ms of which 1 ms to minimize.
[2024-05-31 21:39:45] [INFO ] Deduced a trap composed of 298 places in 371 ms of which 0 ms to minimize.
[2024-05-31 21:39:45] [INFO ] Deduced a trap composed of 296 places in 358 ms of which 1 ms to minimize.
[2024-05-31 21:39:46] [INFO ] Deduced a trap composed of 298 places in 422 ms of which 1 ms to minimize.
[2024-05-31 21:39:46] [INFO ] Deduced a trap composed of 300 places in 385 ms of which 1 ms to minimize.
[2024-05-31 21:39:46] [INFO ] Deduced a trap composed of 300 places in 360 ms of which 1 ms to minimize.
[2024-05-31 21:39:47] [INFO ] Deduced a trap composed of 298 places in 342 ms of which 1 ms to minimize.
[2024-05-31 21:39:47] [INFO ] Deduced a trap composed of 292 places in 316 ms of which 1 ms to minimize.
[2024-05-31 21:39:48] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 1 ms to minimize.
[2024-05-31 21:39:48] [INFO ] Deduced a trap composed of 298 places in 317 ms of which 1 ms to minimize.
[2024-05-31 21:39:48] [INFO ] Deduced a trap composed of 296 places in 334 ms of which 1 ms to minimize.
[2024-05-31 21:39:49] [INFO ] Deduced a trap composed of 294 places in 313 ms of which 1 ms to minimize.
[2024-05-31 21:39:49] [INFO ] Deduced a trap composed of 296 places in 339 ms of which 1 ms to minimize.
[2024-05-31 21:39:50] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 0 ms to minimize.
[2024-05-31 21:39:50] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 1 ms to minimize.
[2024-05-31 21:39:50] [INFO ] Deduced a trap composed of 296 places in 320 ms of which 0 ms to minimize.
[2024-05-31 21:39:51] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 5 ms to minimize.
[2024-05-31 21:39:51] [INFO ] Deduced a trap composed of 296 places in 315 ms of which 1 ms to minimize.
[2024-05-31 21:39:51] [INFO ] Deduced a trap composed of 298 places in 327 ms of which 1 ms to minimize.
[2024-05-31 21:39:52] [INFO ] Deduced a trap composed of 292 places in 346 ms of which 0 ms to minimize.
[2024-05-31 21:39:52] [INFO ] Deduced a trap composed of 288 places in 314 ms of which 1 ms to minimize.
[2024-05-31 21:39:53] [INFO ] Deduced a trap composed of 296 places in 326 ms of which 1 ms to minimize.
[2024-05-31 21:39:53] [INFO ] Deduced a trap composed of 304 places in 324 ms of which 1 ms to minimize.
[2024-05-31 21:39:53] [INFO ] Deduced a trap composed of 304 places in 319 ms of which 1 ms to minimize.
[2024-05-31 21:39:54] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 1 ms to minimize.
[2024-05-31 21:39:54] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2024-05-31 21:39:55] [INFO ] Deduced a trap composed of 304 places in 324 ms of which 1 ms to minimize.
[2024-05-31 21:39:55] [INFO ] Deduced a trap composed of 294 places in 317 ms of which 1 ms to minimize.
[2024-05-31 21:39:55] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 1 ms to minimize.
[2024-05-31 21:39:56] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 1 ms to minimize.
[2024-05-31 21:39:58] [INFO ] Deduced a trap composed of 292 places in 351 ms of which 1 ms to minimize.
[2024-05-31 21:39:59] [INFO ] Deduced a trap composed of 292 places in 356 ms of which 1 ms to minimize.
[2024-05-31 21:39:59] [INFO ] Deduced a trap composed of 290 places in 376 ms of which 1 ms to minimize.
[2024-05-31 21:40:00] [INFO ] Deduced a trap composed of 296 places in 359 ms of which 1 ms to minimize.
[2024-05-31 21:40:00] [INFO ] Deduced a trap composed of 298 places in 384 ms of which 1 ms to minimize.
[2024-05-31 21:40:01] [INFO ] Deduced a trap composed of 300 places in 399 ms of which 1 ms to minimize.
[2024-05-31 21:40:03] [INFO ] Deduced a trap composed of 304 places in 413 ms of which 1 ms to minimize.
[2024-05-31 21:40:03] [INFO ] Deduced a trap composed of 298 places in 387 ms of which 1 ms to minimize.
[2024-05-31 21:40:04] [INFO ] Deduced a trap composed of 302 places in 396 ms of which 0 ms to minimize.
[2024-05-31 21:40:04] [INFO ] Deduced a trap composed of 298 places in 402 ms of which 1 ms to minimize.
[2024-05-31 21:40:05] [INFO ] Deduced a trap composed of 298 places in 365 ms of which 0 ms to minimize.
[2024-05-31 21:40:05] [INFO ] Deduced a trap composed of 300 places in 381 ms of which 1 ms to minimize.
[2024-05-31 21:40:06] [INFO ] Deduced a trap composed of 298 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:40:06] [INFO ] Deduced a trap composed of 294 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:40:07] [INFO ] Deduced a trap composed of 298 places in 351 ms of which 1 ms to minimize.
[2024-05-31 21:40:07] [INFO ] Deduced a trap composed of 296 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:40:08] [INFO ] Deduced a trap composed of 294 places in 353 ms of which 1 ms to minimize.
[2024-05-31 21:40:08] [INFO ] Deduced a trap composed of 298 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:40:08] [INFO ] Deduced a trap composed of 300 places in 362 ms of which 1 ms to minimize.
[2024-05-31 21:40:09] [INFO ] Deduced a trap composed of 298 places in 377 ms of which 1 ms to minimize.
[2024-05-31 21:40:09] [INFO ] Deduced a trap composed of 312 places in 380 ms of which 0 ms to minimize.
[2024-05-31 21:40:10] [INFO ] Deduced a trap composed of 298 places in 367 ms of which 1 ms to minimize.
[2024-05-31 21:40:11] [INFO ] Deduced a trap composed of 292 places in 386 ms of which 0 ms to minimize.
[2024-05-31 21:40:12] [INFO ] Deduced a trap composed of 302 places in 379 ms of which 1 ms to minimize.
[2024-05-31 21:40:12] [INFO ] Deduced a trap composed of 298 places in 387 ms of which 1 ms to minimize.
[2024-05-31 21:40:13] [INFO ] Deduced a trap composed of 296 places in 394 ms of which 1 ms to minimize.
[2024-05-31 21:40:15] [INFO ] Deduced a trap composed of 300 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:40:15] [INFO ] Deduced a trap composed of 294 places in 387 ms of which 1 ms to minimize.
[2024-05-31 21:40:16] [INFO ] Deduced a trap composed of 302 places in 355 ms of which 1 ms to minimize.
[2024-05-31 21:40:17] [INFO ] Deduced a trap composed of 296 places in 381 ms of which 0 ms to minimize.
[2024-05-31 21:40:22] [INFO ] Deduced a trap composed of 290 places in 415 ms of which 1 ms to minimize.
SDD proceeding with computation,6 properties remain. new max is 524288
[2024-05-31 21:40:22] [INFO ] Deduced a trap composed of 298 places in 421 ms of which 1 ms to minimize.
[2024-05-31 21:40:23] [INFO ] Deduced a trap composed of 300 places in 406 ms of which 1 ms to minimize.
[2024-05-31 21:40:24] [INFO ] Deduced a trap composed of 294 places in 399 ms of which 0 ms to minimize.
[2024-05-31 21:40:24] [INFO ] Deduced a trap composed of 296 places in 419 ms of which 1 ms to minimize.
SDD size :830831 after 1.72238e+06
[2024-05-31 21:40:25] [INFO ] Deduced a trap composed of 302 places in 358 ms of which 1 ms to minimize.
[2024-05-31 21:40:25] [INFO ] Deduced a trap composed of 304 places in 385 ms of which 1 ms to minimize.
[2024-05-31 21:40:25] [INFO ] Deduced a trap composed of 298 places in 371 ms of which 0 ms to minimize.
[2024-05-31 21:40:26] [INFO ] Deduced a trap composed of 296 places in 384 ms of which 1 ms to minimize.
[2024-05-31 21:40:26] [INFO ] Deduced a trap composed of 286 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:40:27] [INFO ] Deduced a trap composed of 302 places in 372 ms of which 0 ms to minimize.
[2024-05-31 21:40:30] [INFO ] Deduced a trap composed of 298 places in 424 ms of which 1 ms to minimize.
[2024-05-31 21:40:30] [INFO ] Deduced a trap composed of 300 places in 417 ms of which 1 ms to minimize.
[2024-05-31 21:40:31] [INFO ] Deduced a trap composed of 302 places in 405 ms of which 1 ms to minimize.
[2024-05-31 21:40:31] [INFO ] Deduced a trap composed of 292 places in 402 ms of which 1 ms to minimize.
[2024-05-31 21:40:32] [INFO ] Deduced a trap composed of 298 places in 410 ms of which 1 ms to minimize.
[2024-05-31 21:40:34] [INFO ] Deduced a trap composed of 304 places in 377 ms of which 0 ms to minimize.
[2024-05-31 21:40:34] [INFO ] Deduced a trap composed of 300 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:40:35] [INFO ] Deduced a trap composed of 302 places in 376 ms of which 1 ms to minimize.
[2024-05-31 21:40:35] [INFO ] Deduced a trap composed of 292 places in 386 ms of which 0 ms to minimize.
[2024-05-31 21:40:36] [INFO ] Deduced a trap composed of 296 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:40:36] [INFO ] Deduced a trap composed of 294 places in 376 ms of which 0 ms to minimize.
[2024-05-31 21:40:36] [INFO ] Deduced a trap composed of 292 places in 372 ms of which 0 ms to minimize.
[2024-05-31 21:40:37] [INFO ] Deduced a trap composed of 298 places in 375 ms of which 1 ms to minimize.
[2024-05-31 21:40:38] [INFO ] Deduced a trap composed of 304 places in 382 ms of which 1 ms to minimize.
[2024-05-31 21:40:38] [INFO ] Deduced a trap composed of 296 places in 375 ms of which 1 ms to minimize.
[2024-05-31 21:40:38] [INFO ] Deduced a trap composed of 300 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:40:39] [INFO ] Deduced a trap composed of 294 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:40:39] [INFO ] Deduced a trap composed of 296 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:40:40] [INFO ] Deduced a trap composed of 304 places in 378 ms of which 0 ms to minimize.
[2024-05-31 21:40:40] [INFO ] Deduced a trap composed of 298 places in 366 ms of which 1 ms to minimize.
[2024-05-31 21:40:41] [INFO ] Deduced a trap composed of 292 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:40:41] [INFO ] Deduced a trap composed of 294 places in 367 ms of which 1 ms to minimize.
[2024-05-31 21:40:42] [INFO ] Deduced a trap composed of 296 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:40:42] [INFO ] Deduced a trap composed of 302 places in 378 ms of which 0 ms to minimize.
[2024-05-31 21:40:43] [INFO ] Deduced a trap composed of 288 places in 380 ms of which 1 ms to minimize.
[2024-05-31 21:40:43] [INFO ] Deduced a trap composed of 282 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:40:43] [INFO ] Deduced a trap composed of 298 places in 364 ms of which 1 ms to minimize.
[2024-05-31 21:40:44] [INFO ] Deduced a trap composed of 304 places in 381 ms of which 1 ms to minimize.
[2024-05-31 21:40:44] [INFO ] Deduced a trap composed of 300 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:40:45] [INFO ] Deduced a trap composed of 300 places in 380 ms of which 1 ms to minimize.
[2024-05-31 21:40:45] [INFO ] Deduced a trap composed of 302 places in 367 ms of which 1 ms to minimize.
[2024-05-31 21:40:46] [INFO ] Deduced a trap composed of 294 places in 369 ms of which 1 ms to minimize.
Detected timeout of ITS tools.
[2024-05-31 21:40:46] [INFO ] Flatten gal took : 156 ms
[2024-05-31 21:40:46] [INFO ] Applying decomposition
[2024-05-31 21:40:46] [INFO ] Flatten gal took : 157 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/graph12104315058940475048.txt' '-o' '/tmp/graph12104315058940475048.bin' '-w' '/tmp/graph12104315058940475048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12104315058940475048.bin' '-l' '-1' '-v' '-w' '/tmp/graph12104315058940475048.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:40:47] [INFO ] Decomposing Gal with order
[2024-05-31 21:40:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:40:47] [INFO ] Removed a total of 1721 redundant transitions.
[2024-05-31 21:40:47] [INFO ] Flatten gal took : 347 ms
[2024-05-31 21:40:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 431 labels/synchronizations in 43 ms.
[2024-05-31 21:40:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17930721849393418000.gal : 26 ms
[2024-05-31 21:40:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6973151794380199049.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/ReachabilityCardinality17930721849393418000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6973151794380199049.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/ReachabilityCardinality6973151794380199049.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 :1286 after 1287
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1287 after 1289
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1289 after 1292
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1292 after 1304
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1304 after 1320
[2024-05-31 21:43:13] [INFO ] Trap strengthening (SAT) tested/added 140/140 trap constraints in 224440 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:772)
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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:218)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:279)
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:43:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-31 21:43:13] [INFO ] After 225023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
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 750 transition count 1512
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 750 transition count 1511
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 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 124 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
[2024-05-31 21:43:14] [INFO ] Invariant cache hit.
[2024-05-31 21:43:14] [INFO ] [Real]Absence check using 95 positive place invariants in 31 ms returned sat
[2024-05-31 21:43:14] [INFO ] [Real]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:43:14] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:43:14] [INFO ] [Nat]Absence check using 95 positive place invariants in 22 ms returned sat
[2024-05-31 21:43:14] [INFO ] [Nat]Absence check using 95 positive and 7 generalized place invariants in 18 ms returned sat
[2024-05-31 21:43:15] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:43:15] [INFO ] Deduced a trap composed of 294 places in 414 ms of which 1 ms to minimize.
[2024-05-31 21:43:16] [INFO ] Deduced a trap composed of 300 places in 416 ms of which 1 ms to minimize.
[2024-05-31 21:43:16] [INFO ] Deduced a trap composed of 300 places in 409 ms of which 0 ms to minimize.
[2024-05-31 21:43:17] [INFO ] Deduced a trap composed of 296 places in 404 ms of which 1 ms to minimize.
[2024-05-31 21:43:17] [INFO ] Deduced a trap composed of 300 places in 379 ms of which 1 ms to minimize.
[2024-05-31 21:43:18] [INFO ] Deduced a trap composed of 302 places in 367 ms of which 1 ms to minimize.
[2024-05-31 21:43:18] [INFO ] Deduced a trap composed of 300 places in 377 ms of which 1 ms to minimize.
[2024-05-31 21:43:19] [INFO ] Deduced a trap composed of 298 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:43:19] [INFO ] Deduced a trap composed of 306 places in 409 ms of which 4 ms to minimize.
[2024-05-31 21:43:20] [INFO ] Deduced a trap composed of 294 places in 363 ms of which 1 ms to minimize.
[2024-05-31 21:43:20] [INFO ] Deduced a trap composed of 308 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:43:21] [INFO ] Deduced a trap composed of 298 places in 376 ms of which 1 ms to minimize.
[2024-05-31 21:43:21] [INFO ] Deduced a trap composed of 300 places in 375 ms of which 1 ms to minimize.
[2024-05-31 21:43:22] [INFO ] Deduced a trap composed of 300 places in 374 ms of which 0 ms to minimize.
[2024-05-31 21:43:22] [INFO ] Deduced a trap composed of 298 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:43:23] [INFO ] Deduced a trap composed of 306 places in 371 ms of which 1 ms to minimize.
[2024-05-31 21:43:23] [INFO ] Deduced a trap composed of 300 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:43:23] [INFO ] Deduced a trap composed of 292 places in 385 ms of which 11 ms to minimize.
[2024-05-31 21:43:24] [INFO ] Deduced a trap composed of 296 places in 368 ms of which 0 ms to minimize.
[2024-05-31 21:43:24] [INFO ] Deduced a trap composed of 298 places in 389 ms of which 1 ms to minimize.
[2024-05-31 21:43:25] [INFO ] Deduced a trap composed of 288 places in 366 ms of which 1 ms to minimize.
[2024-05-31 21:43:25] [INFO ] Deduced a trap composed of 302 places in 375 ms of which 1 ms to minimize.
[2024-05-31 21:43:26] [INFO ] Deduced a trap composed of 296 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:43:26] [INFO ] Deduced a trap composed of 302 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:43:27] [INFO ] Deduced a trap composed of 300 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:43:27] [INFO ] Deduced a trap composed of 304 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:43:28] [INFO ] Deduced a trap composed of 302 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:43:28] [INFO ] Deduced a trap composed of 300 places in 378 ms of which 1 ms to minimize.
[2024-05-31 21:43:28] [INFO ] Deduced a trap composed of 298 places in 383 ms of which 1 ms to minimize.
[2024-05-31 21:43:29] [INFO ] Deduced a trap composed of 298 places in 372 ms of which 1 ms to minimize.
[2024-05-31 21:43:29] [INFO ] Deduced a trap composed of 306 places in 373 ms of which 1 ms to minimize.
[2024-05-31 21:43:30] [INFO ] Deduced a trap composed of 296 places in 357 ms of which 0 ms to minimize.
[2024-05-31 21:43:30] [INFO ] Deduced a trap composed of 300 places in 368 ms of which 1 ms to minimize.
[2024-05-31 21:43:31] [INFO ] Deduced a trap composed of 300 places in 377 ms of which 1 ms to minimize.
[2024-05-31 21:43:31] [INFO ] Deduced a trap composed of 306 places in 390 ms of which 1 ms to minimize.
[2024-05-31 21:43:32] [INFO ] Deduced a trap composed of 304 places in 447 ms of which 1 ms to minimize.
[2024-05-31 21:43:32] [INFO ] Deduced a trap composed of 302 places in 467 ms of which 1 ms to minimize.
[2024-05-31 21:43:33] [INFO ] Deduced a trap composed of 296 places in 384 ms of which 1 ms to minimize.
[2024-05-31 21:43:33] [INFO ] Deduced a trap composed of 294 places in 364 ms of which 0 ms to minimize.
[2024-05-31 21:43:33] [INFO ] Deduced a trap composed of 288 places in 357 ms of which 1 ms to minimize.
[2024-05-31 21:43:34] [INFO ] Deduced a trap composed of 292 places in 266 ms of which 0 ms to minimize.
[2024-05-31 21:43:34] [INFO ] Deduced a trap composed of 302 places in 328 ms of which 1 ms to minimize.
[2024-05-31 21:43:34] [INFO ] Deduced a trap composed of 296 places in 269 ms of which 1 ms to minimize.
[2024-05-31 21:43:35] [INFO ] Deduced a trap composed of 300 places in 266 ms of which 1 ms to minimize.
[2024-05-31 21:43:35] [INFO ] Deduced a trap composed of 300 places in 331 ms of which 1 ms to minimize.
[2024-05-31 21:43:35] [INFO ] Deduced a trap composed of 308 places in 362 ms of which 0 ms to minimize.
[2024-05-31 21:43:36] [INFO ] Deduced a trap composed of 308 places in 327 ms of which 0 ms to minimize.
[2024-05-31 21:43:36] [INFO ] Deduced a trap composed of 302 places in 338 ms of which 0 ms to minimize.
[2024-05-31 21:43:37] [INFO ] Deduced a trap composed of 294 places in 264 ms of which 1 ms to minimize.
[2024-05-31 21:43:37] [INFO ] Deduced a trap composed of 294 places in 323 ms of which 1 ms to minimize.
[2024-05-31 21:43:37] [INFO ] Deduced a trap composed of 296 places in 262 ms of which 1 ms to minimize.
[2024-05-31 21:43:38] [INFO ] Deduced a trap composed of 302 places in 342 ms of which 12 ms to minimize.
[2024-05-31 21:43:38] [INFO ] Deduced a trap composed of 290 places in 269 ms of which 1 ms to minimize.
[2024-05-31 21:43:38] [INFO ] Deduced a trap composed of 296 places in 336 ms of which 0 ms to minimize.
[2024-05-31 21:43:39] [INFO ] Deduced a trap composed of 294 places in 348 ms of which 0 ms to minimize.
[2024-05-31 21:43:39] [INFO ] Deduced a trap composed of 296 places in 330 ms of which 1 ms to minimize.
[2024-05-31 21:43:39] [INFO ] Deduced a trap composed of 306 places in 329 ms of which 0 ms to minimize.
[2024-05-31 21:43:40] [INFO ] Deduced a trap composed of 296 places in 329 ms of which 0 ms to minimize.
[2024-05-31 21:43:42] [INFO ] Deduced a trap composed of 298 places in 402 ms of which 1 ms to minimize.
[2024-05-31 21:43:42] [INFO ] Deduced a trap composed of 306 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:43:43] [INFO ] Deduced a trap composed of 300 places in 364 ms of which 1 ms to minimize.
[2024-05-31 21:43:43] [INFO ] Deduced a trap composed of 294 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:43:43] [INFO ] Deduced a trap composed of 290 places in 364 ms of which 0 ms to minimize.
[2024-05-31 21:43:44] [INFO ] Deduced a trap composed of 300 places in 337 ms of which 1 ms to minimize.
[2024-05-31 21:43:44] [INFO ] Deduced a trap composed of 306 places in 269 ms of which 1 ms to minimize.
[2024-05-31 21:43:44] [INFO ] Deduced a trap composed of 304 places in 345 ms of which 0 ms to minimize.
[2024-05-31 21:43:45] [INFO ] Deduced a trap composed of 294 places in 273 ms of which 1 ms to minimize.
[2024-05-31 21:43:45] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 1 ms to minimize.
[2024-05-31 21:43:46] [INFO ] Deduced a trap composed of 294 places in 340 ms of which 0 ms to minimize.
[2024-05-31 21:43:46] [INFO ] Deduced a trap composed of 298 places in 329 ms of which 1 ms to minimize.
[2024-05-31 21:43:46] [INFO ] Deduced a trap composed of 302 places in 271 ms of which 1 ms to minimize.
[2024-05-31 21:43:47] [INFO ] Deduced a trap composed of 302 places in 343 ms of which 1 ms to minimize.
[2024-05-31 21:43:47] [INFO ] Deduced a trap composed of 298 places in 328 ms of which 0 ms to minimize.
[2024-05-31 21:43:47] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 1 ms to minimize.
[2024-05-31 21:43:48] [INFO ] Deduced a trap composed of 306 places in 391 ms of which 1 ms to minimize.
[2024-05-31 21:43:49] [INFO ] Deduced a trap composed of 306 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:43:53] [INFO ] Deduced a trap composed of 296 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:43:54] [INFO ] Deduced a trap composed of 294 places in 424 ms of which 1 ms to minimize.
[2024-05-31 21:43:54] [INFO ] Deduced a trap composed of 302 places in 393 ms of which 0 ms to minimize.
[2024-05-31 21:43:55] [INFO ] Deduced a trap composed of 294 places in 408 ms of which 0 ms to minimize.
[2024-05-31 21:43:55] [INFO ] Deduced a trap composed of 298 places in 382 ms of which 0 ms to minimize.
[2024-05-31 21:43:56] [INFO ] Deduced a trap composed of 304 places in 368 ms of which 1 ms to minimize.
[2024-05-31 21:43:56] [INFO ] Deduced a trap composed of 296 places in 390 ms of which 1 ms to minimize.
[2024-05-31 21:43:56] [INFO ] Deduced a trap composed of 290 places in 374 ms of which 1 ms to minimize.
[2024-05-31 21:43:57] [INFO ] Deduced a trap composed of 298 places in 380 ms of which 1 ms to minimize.
[2024-05-31 21:43:57] [INFO ] Deduced a trap composed of 298 places in 381 ms of which 1 ms to minimize.
[2024-05-31 21:43:58] [INFO ] Deduced a trap composed of 296 places in 395 ms of which 0 ms to minimize.
[2024-05-31 21:43:58] [INFO ] Deduced a trap composed of 306 places in 371 ms of which 0 ms to minimize.
[2024-05-31 21:43:58] [INFO ] Deduced a trap composed of 298 places in 377 ms of which 0 ms to minimize.
[2024-05-31 21:43:59] [INFO ] Deduced a trap composed of 294 places in 373 ms of which 1 ms to minimize.
[2024-05-31 21:44:01] [INFO ] Deduced a trap composed of 298 places in 372 ms of which 0 ms to minimize.
[2024-05-31 21:44:02] [INFO ] Deduced a trap composed of 294 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:44:03] [INFO ] Deduced a trap composed of 296 places in 383 ms of which 0 ms to minimize.
[2024-05-31 21:44:03] [INFO ] Deduced a trap composed of 304 places in 395 ms of which 1 ms to minimize.
[2024-05-31 21:44:04] [INFO ] Deduced a trap composed of 288 places in 368 ms of which 1 ms to minimize.
[2024-05-31 21:44:04] [INFO ] Deduced a trap composed of 304 places in 391 ms of which 1 ms to minimize.
[2024-05-31 21:44:05] [INFO ] Deduced a trap composed of 290 places in 403 ms of which 1 ms to minimize.
[2024-05-31 21:44:05] [INFO ] Deduced a trap composed of 296 places in 362 ms of which 0 ms to minimize.
[2024-05-31 21:44:06] [INFO ] Deduced a trap composed of 296 places in 387 ms of which 1 ms to minimize.
[2024-05-31 21:44:06] [INFO ] Deduced a trap composed of 298 places in 378 ms of which 0 ms to minimize.
[2024-05-31 21:44:07] [INFO ] Deduced a trap composed of 304 places in 416 ms of which 0 ms to minimize.
[2024-05-31 21:44:07] [INFO ] Deduced a trap composed of 294 places in 392 ms of which 1 ms to minimize.
[2024-05-31 21:44:08] [INFO ] Deduced a trap composed of 294 places in 367 ms of which 0 ms to minimize.
[2024-05-31 21:44:08] [INFO ] Deduced a trap composed of 288 places in 388 ms of which 1 ms to minimize.
[2024-05-31 21:44:08] [INFO ] Deduced a trap composed of 298 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:44:09] [INFO ] Deduced a trap composed of 302 places in 349 ms of which 1 ms to minimize.
[2024-05-31 21:44:09] [INFO ] Deduced a trap composed of 296 places in 337 ms of which 1 ms to minimize.
[2024-05-31 21:44:10] [INFO ] Deduced a trap composed of 300 places in 333 ms of which 1 ms to minimize.
[2024-05-31 21:44:10] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 0 ms to minimize.
[2024-05-31 21:44:10] [INFO ] Deduced a trap composed of 300 places in 269 ms of which 1 ms to minimize.
[2024-05-31 21:44:11] [INFO ] Deduced a trap composed of 302 places in 276 ms of which 0 ms to minimize.
[2024-05-31 21:44:11] [INFO ] Deduced a trap composed of 304 places in 339 ms of which 1 ms to minimize.
[2024-05-31 21:44:11] [INFO ] Deduced a trap composed of 312 places in 339 ms of which 0 ms to minimize.
[2024-05-31 21:44:12] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 1 ms to minimize.
[2024-05-31 21:44:12] [INFO ] Deduced a trap composed of 296 places in 371 ms of which 0 ms to minimize.
[2024-05-31 21:44:13] [INFO ] Deduced a trap composed of 306 places in 354 ms of which 1 ms to minimize.
[2024-05-31 21:44:13] [INFO ] Deduced a trap composed of 294 places in 337 ms of which 1 ms to minimize.
[2024-05-31 21:44:13] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 0 ms to minimize.
[2024-05-31 21:44:14] [INFO ] Deduced a trap composed of 290 places in 346 ms of which 0 ms to minimize.
[2024-05-31 21:44:14] [INFO ] Deduced a trap composed of 300 places in 387 ms of which 1 ms to minimize.
[2024-05-31 21:44:15] [INFO ] Deduced a trap composed of 296 places in 376 ms of which 0 ms to minimize.
[2024-05-31 21:44:15] [INFO ] Deduced a trap composed of 304 places in 388 ms of which 1 ms to minimize.
[2024-05-31 21:44:15] [INFO ] Deduced a trap composed of 300 places in 364 ms of which 0 ms to minimize.
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 300 places in 367 ms of which 1 ms to minimize.
[2024-05-31 21:44:16] [INFO ] Deduced a trap composed of 306 places in 370 ms of which 0 ms to minimize.
[2024-05-31 21:44:17] [INFO ] Deduced a trap composed of 296 places in 379 ms of which 8 ms to minimize.
[2024-05-31 21:44:17] [INFO ] Deduced a trap composed of 298 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:44:18] [INFO ] Deduced a trap composed of 298 places in 366 ms of which 1 ms to minimize.
[2024-05-31 21:44:18] [INFO ] Deduced a trap composed of 294 places in 369 ms of which 1 ms to minimize.
[2024-05-31 21:44:18] [INFO ] Deduced a trap composed of 304 places in 346 ms of which 1 ms to minimize.
[2024-05-31 21:44:19] [INFO ] Deduced a trap composed of 294 places in 353 ms of which 0 ms to minimize.
[2024-05-31 21:44:19] [INFO ] Deduced a trap composed of 300 places in 326 ms of which 0 ms to minimize.
[2024-05-31 21:44:19] [INFO ] Deduced a trap composed of 298 places in 275 ms of which 0 ms to minimize.
[2024-05-31 21:44:20] [INFO ] Deduced a trap composed of 298 places in 265 ms of which 1 ms to minimize.
[2024-05-31 21:44:20] [INFO ] Deduced a trap composed of 304 places in 370 ms of which 1 ms to minimize.
[2024-05-31 21:44:21] [INFO ] Deduced a trap composed of 292 places in 325 ms of which 1 ms to minimize.
[2024-05-31 21:44:21] [INFO ] Deduced a trap composed of 288 places in 266 ms of which 1 ms to minimize.
[2024-05-31 21:44:21] [INFO ] Deduced a trap composed of 296 places in 350 ms of which 1 ms to minimize.
[2024-05-31 21:44:22] [INFO ] Deduced a trap composed of 296 places in 328 ms of which 0 ms to minimize.
[2024-05-31 21:44:22] [INFO ] Deduced a trap composed of 300 places in 326 ms of which 0 ms to minimize.
[2024-05-31 21:44:22] [INFO ] Deduced a trap composed of 296 places in 326 ms of which 0 ms to minimize.
[2024-05-31 21:44:23] [INFO ] Deduced a trap composed of 298 places in 324 ms of which 0 ms to minimize.
[2024-05-31 21:44:23] [INFO ] Deduced a trap composed of 296 places in 265 ms of which 0 ms to minimize.
[2024-05-31 21:44:23] [INFO ] Deduced a trap composed of 298 places in 334 ms of which 1 ms to minimize.
[2024-05-31 21:44:24] [INFO ] Deduced a trap composed of 304 places in 270 ms of which 1 ms to minimize.
[2024-05-31 21:44:24] [INFO ] Deduced a trap composed of 292 places in 341 ms of which 0 ms to minimize.
[2024-05-31 21:44:25] [INFO ] Deduced a trap composed of 292 places in 328 ms of which 1 ms to minimize.
[2024-05-31 21:44:25] [INFO ] Deduced a trap composed of 300 places in 323 ms of which 1 ms to minimize.
[2024-05-31 21:44:25] [INFO ] Deduced a trap composed of 298 places in 361 ms of which 1 ms to minimize.
[2024-05-31 21:44:26] [INFO ] Deduced a trap composed of 302 places in 366 ms of which 0 ms to minimize.
[2024-05-31 21:44:26] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 0 ms to minimize.
[2024-05-31 21:44:27] [INFO ] Deduced a trap composed of 300 places in 361 ms of which 0 ms to minimize.
[2024-05-31 21:44:27] [INFO ] Deduced a trap composed of 304 places in 334 ms of which 1 ms to minimize.
[2024-05-31 21:44:27] [INFO ] Deduced a trap composed of 296 places in 336 ms of which 1 ms to minimize.
[2024-05-31 21:44:28] [INFO ] Deduced a trap composed of 296 places in 383 ms of which 1 ms to minimize.
[2024-05-31 21:44:29] [INFO ] Deduced a trap composed of 294 places in 387 ms of which 0 ms to minimize.
[2024-05-31 21:44:30] [INFO ] Deduced a trap composed of 300 places in 364 ms of which 1 ms to minimize.
[2024-05-31 21:44:30] [INFO ] Deduced a trap composed of 296 places in 373 ms of which 1 ms to minimize.
[2024-05-31 21:44:31] [INFO ] Deduced a trap composed of 300 places in 399 ms of which 1 ms to minimize.
[2024-05-31 21:44:40] [INFO ] Trap strengthening (SAT) tested/added 159/159 trap constraints in 84963 ms
[2024-05-31 21:44:41] [INFO ] After 86574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:44:41] [INFO ] After 86753ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2024-05-31 21:44:41] [INFO ] Flatten gal took : 137 ms
[2024-05-31 21:44:41] [INFO ] Flatten gal took : 143 ms
[2024-05-31 21:44:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3502698513074658669.gal : 39 ms
[2024-05-31 21:44:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5646225257030151236.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/ReachabilityCardinality3502698513074658669.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5646225257030151236.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/ReachabilityCardinality5646225257030151236.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :22 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :26 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 30
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :30 after 32
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :32 after 36
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :36 after 42
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :42 after 56
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :56 after 1827
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1827 after 1882
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1882 after 2271
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2271 after 2458
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2458 after 2971
Detected timeout of ITS tools.
[2024-05-31 21:44:56] [INFO ] Flatten gal took : 101 ms
[2024-05-31 21:44:56] [INFO ] Applying decomposition
[2024-05-31 21:44:56] [INFO ] Flatten gal took : 99 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/graph2893171662036252994.txt' '-o' '/tmp/graph2893171662036252994.bin' '-w' '/tmp/graph2893171662036252994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2893171662036252994.bin' '-l' '-1' '-v' '-w' '/tmp/graph2893171662036252994.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:44:57] [INFO ] Decomposing Gal with order
[2024-05-31 21:44:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:44:57] [INFO ] Removed a total of 3768 redundant transitions.
[2024-05-31 21:44:57] [INFO ] Flatten gal took : 304 ms
[2024-05-31 21:44:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 338 labels/synchronizations in 134 ms.
[2024-05-31 21:44:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9681598488199928236.gal : 58 ms
[2024-05-31 21:44:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16591056865883698058.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/ReachabilityCardinality9681598488199928236.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16591056865883698058.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/ReachabilityCardinality16591056865883698058.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4732270418107522466
[2024-05-31 21:45:13] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4732270418107522466
Running compilation step : cd /tmp/ltsmin4732270418107522466;'/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'
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/ltsmin4732270418107522466;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4732270418107522466;'/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' killed by timeout after 3 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)
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:45:16] [INFO ] Flatten gal took : 67 ms
[2024-05-31 21:45:16] [INFO ] Flatten gal took : 54 ms
[2024-05-31 21:45:16] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3660340192627544348.gal : 10 ms
[2024-05-31 21:45:16] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8436194934403993267.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/ReachabilityFireability3660340192627544348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8436194934403993267.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/ReachabilityFireability8436194934403993267.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
Detected timeout of ITS tools.
[2024-05-31 21:45:19] [INFO ] Flatten gal took : 97 ms
[2024-05-31 21:45:19] [INFO ] Applying decomposition
[2024-05-31 21:45:19] [INFO ] Flatten gal took : 72 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/graph2901634898412419833.txt' '-o' '/tmp/graph2901634898412419833.bin' '-w' '/tmp/graph2901634898412419833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2901634898412419833.bin' '-l' '-1' '-v' '-w' '/tmp/graph2901634898412419833.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:45:19] [INFO ] Decomposing Gal with order
[2024-05-31 21:45:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:45:19] [INFO ] Removed a total of 1319 redundant transitions.
[2024-05-31 21:45:19] [INFO ] Flatten gal took : 243 ms
[2024-05-31 21:45:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 422 labels/synchronizations in 52 ms.
[2024-05-31 21:45:20] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability727687579788622842.gal : 28 ms
[2024-05-31 21:45:20] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5255803817873244204.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/ReachabilityFireability727687579788622842.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5255803817873244204.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 ...306
Loading property file /tmp/ReachabilityFireability5255803817873244204.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
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7212268679186069344
[2024-05-31 21:45:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7212268679186069344
Running compilation step : cd /tmp/ltsmin7212268679186069344;'/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/ltsmin7212268679186069344;'/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/ltsmin7212268679186069344;'/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:45:25] [INFO ] Flatten gal took : 158 ms
[2024-05-31 21:45:25] [INFO ] Flatten gal took : 155 ms
[2024-05-31 21:45:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability7789355529882764925.gal : 26 ms
[2024-05-31 21:45:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8044872610802034017.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/ReachabilityFireability7789355529882764925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8044872610802034017.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/ReachabilityFireability8044872610802034017.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
Detected timeout of ITS tools.
[2024-05-31 21:45:55] [INFO ] Flatten gal took : 185 ms
[2024-05-31 21:45:55] [INFO ] Applying decomposition
[2024-05-31 21:45:56] [INFO ] Flatten gal took : 152 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/graph12503218783614185338.txt' '-o' '/tmp/graph12503218783614185338.bin' '-w' '/tmp/graph12503218783614185338.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12503218783614185338.bin' '-l' '-1' '-v' '-w' '/tmp/graph12503218783614185338.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:45:56] [INFO ] Decomposing Gal with order
[2024-05-31 21:45:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:45:56] [INFO ] Removed a total of 3522 redundant transitions.
[2024-05-31 21:45:56] [INFO ] Flatten gal took : 234 ms
[2024-05-31 21:45:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 167 labels/synchronizations in 77 ms.
[2024-05-31 21:45:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11046010871889440168.gal : 40 ms
[2024-05-31 21:45:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7734643654799177259.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/ReachabilityFireability11046010871889440168.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability7734643654799177259.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/ReachabilityFireability7734643654799177259.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
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16822436548366229431
[2024-05-31 21:46:27] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16822436548366229431
Running compilation step : cd /tmp/ltsmin16822436548366229431;'/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 3430 ms.
Running link step : cd /tmp/ltsmin16822436548366229431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin16822436548366229431;'/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:46:57] [INFO ] Flatten gal took : 112 ms
[2024-05-31 21:46:57] [INFO ] Flatten gal took : 94 ms
[2024-05-31 21:46:57] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9385944567395577172.gal : 12 ms
[2024-05-31 21:46:57] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2236415708580576184.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/ReachabilityFireability9385944567395577172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2236415708580576184.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/ReachabilityFireability2236415708580576184.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :33332 after 95779
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :95779 after 197441
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :197441 after 514794
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2024-05-31 21:51:57] [INFO ] Flatten gal took : 103 ms
[2024-05-31 21:51:57] [INFO ] Applying decomposition
[2024-05-31 21:51:57] [INFO ] Flatten gal took : 100 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/graph17863158924703097607.txt' '-o' '/tmp/graph17863158924703097607.bin' '-w' '/tmp/graph17863158924703097607.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17863158924703097607.bin' '-l' '-1' '-v' '-w' '/tmp/graph17863158924703097607.weights' '-q' '0' '-e' '0.001'
[2024-05-31 21:51:58] [INFO ] Decomposing Gal with order
[2024-05-31 21:51:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 21:51:58] [INFO ] Removed a total of 3400 redundant transitions.
[2024-05-31 21:51:58] [INFO ] Flatten gal took : 145 ms
[2024-05-31 21:51:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 413 labels/synchronizations in 83 ms.
[2024-05-31 21:51:58] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability3383682774444159578.gal : 51 ms
[2024-05-31 21:51:58] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10994703939703643500.prop : 13 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/ReachabilityFireability3383682774444159578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability10994703939703643500.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/ReachabilityFireability10994703939703643500.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2048
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin474229040873470946
[2024-05-31 21:56:58] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin474229040873470946
Running compilation step : cd /tmp/ltsmin474229040873470946;'/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 3291 ms.
Running link step : cd /tmp/ltsmin474229040873470946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin474229040873470946;'/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( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.035: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.086: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.087: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.091: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.088: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.089: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.091: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.092: There are 1522 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.092: State length is 750, there are 1521 groups
pins2lts-mc-linux64( 0/ 8), 0.092: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.092: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.092: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.092: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.090: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.089: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.254: ~4 levels ~960 states ~8200 transitions
pins2lts-mc-linux64( 0/ 8), 0.321: ~5 levels ~1920 states ~14960 transitions
pins2lts-mc-linux64( 0/ 8), 0.444: ~6 levels ~3840 states ~26912 transitions
pins2lts-mc-linux64( 0/ 8), 0.857: ~7 levels ~7680 states ~89864 transitions
pins2lts-mc-linux64( 5/ 8), 1.416: ~7 levels ~15360 states ~109872 transitions
pins2lts-mc-linux64( 5/ 8), 2.124: ~8 levels ~30720 states ~239064 transitions
pins2lts-mc-linux64( 5/ 8), 3.355: ~8 levels ~61440 states ~492128 transitions
pins2lts-mc-linux64( 5/ 8), 5.417: ~9 levels ~122880 states ~962344 transitions
pins2lts-mc-linux64( 5/ 8), 9.358: ~9 levels ~245760 states ~1873920 transitions
pins2lts-mc-linux64( 5/ 8), 17.259: ~10 levels ~491520 states ~3505688 transitions
pins2lts-mc-linux64( 5/ 8), 32.983: ~11 levels ~983040 states ~6455096 transitions
pins2lts-mc-linux64( 5/ 8), 64.446: ~15 levels ~1966080 states ~10996240 transitions
pins2lts-mc-linux64( 4/ 8), 71.048: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 71.941:
pins2lts-mc-linux64( 0/ 8), 71.941: mean standard work distribution: 17.2% (states) 40.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 71.941:
pins2lts-mc-linux64( 0/ 8), 71.941: Explored 1550042 states 44809355 transitions, fanout: 28.908
pins2lts-mc-linux64( 0/ 8), 71.941: Total exploration time 71.840 sec (70.960 sec minimum, 71.394 sec on average)
pins2lts-mc-linux64( 0/ 8), 71.941: States per second: 21576, Transitions per second: 623738
pins2lts-mc-linux64( 0/ 8), 71.941:
pins2lts-mc-linux64( 0/ 8), 71.941: Queue width: 8B, total height: 16161918, memory: 123.31MB
pins2lts-mc-linux64( 0/ 8), 71.941: Tree memory: 391.2MB, 23.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 71.941: Tree fill ratio (roots/leafs): 13.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 71.941: Stored 1563 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 71.941: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 71.941: Est. total memory use: 514.5MB (~1147.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin474229040873470946;'/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/ltsmin474229040873470946;'/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:58:14] [INFO ] Flatten gal took : 88 ms
[2024-05-31 21:58:14] [INFO ] Flatten gal took : 65 ms
[2024-05-31 21:58:14] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17296366276200451245.gal : 12 ms
[2024-05-31 21:58:14] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9071078552514838196.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/ReachabilityFireability17296366276200451245.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9071078552514838196.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/ReachabilityFireability9071078552514838196.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 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 32
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :32 after 160
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :160 after 176
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :176 after 393
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :393 after 1149
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1149 after 1707
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1707 after 2025
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2025 after 7569
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7569 after 33332
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :33332 after 95779
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :95779 after 197441
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :197441 after 514794
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393340 kB
MemFree: 11707576 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16128588 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-S10J40"
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-S10J40, 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-171654461500262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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