Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713200158.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713200158
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 846K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679179281354

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-18 22:41:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:41:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:41:23] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-18 22:41:24] [INFO ] Transformed 3003 places.
[2023-03-18 22:41:24] [INFO ] Transformed 2953 transitions.
[2023-03-18 22:41:24] [INFO ] Found NUPN structural information;
[2023-03-18 22:41:24] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 22:41:24] [INFO ] Flatten gal took : 282 ms
[2023-03-18 22:41:24] [INFO ] Flatten gal took : 185 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 726 ms. (steps per millisecond=13 ) properties (out of 14) seen :10
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
[2023-03-18 22:41:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16361092400039849387.gal : 74 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
[2023-03-18 22:41:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality772446901170353568.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16361092400039849387.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality772446901170353568.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2953 rows 3003 cols
[2023-03-18 22:41:25] [INFO ] Computed 451 place invariants in 34 ms
Loading property file /tmp/ReachabilityCardinality772446901170353568.prop.
[2023-03-18 22:41:26] [INFO ] After 819ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 22:41:26] [INFO ] [Nat]Absence check using 451 positive place invariants in 189 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :19 after 36
Reachability property ShieldIIPs-PT-050B-ReachabilityCardinality-10 is true.
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :36 after 73
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :73 after 392
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :392 after 552
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :552 after 103243
SDD proceeding with computation,13 properties remain. new max is 512
SDD size :103243 after 1.57252e+08
Reachability property ShieldIIPs-PT-050B-ReachabilityCardinality-05 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :1.57252e+08 after 9.31044e+14
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :9.31044e+14 after 9.95461e+21
[2023-03-18 22:41:33] [INFO ] After 6521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 22:41:36] [INFO ] Deduced a trap composed of 19 places in 2133 ms of which 18 ms to minimize.
[2023-03-18 22:41:37] [INFO ] Deduced a trap composed of 18 places in 1154 ms of which 3 ms to minimize.
[2023-03-18 22:41:39] [INFO ] Deduced a trap composed of 21 places in 2104 ms of which 17 ms to minimize.
[2023-03-18 22:41:41] [INFO ] Deduced a trap composed of 17 places in 1225 ms of which 9 ms to minimize.
[2023-03-18 22:41:42] [INFO ] Deduced a trap composed of 18 places in 976 ms of which 16 ms to minimize.
[2023-03-18 22:41:44] [INFO ] Deduced a trap composed of 28 places in 1491 ms of which 5 ms to minimize.
[2023-03-18 22:41:45] [INFO ] Deduced a trap composed of 16 places in 1310 ms of which 5 ms to minimize.
[2023-03-18 22:41:46] [INFO ] Deduced a trap composed of 28 places in 977 ms of which 1 ms to minimize.
[2023-03-18 22:41:49] [INFO ] Deduced a trap composed of 14 places in 1242 ms of which 4 ms to minimize.
[2023-03-18 22:41:50] [INFO ] Deduced a trap composed of 24 places in 1083 ms of which 2 ms to minimize.
[2023-03-18 22:41:52] [INFO ] Deduced a trap composed of 18 places in 1265 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 22:41:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 22:41:52] [INFO ] After 26173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 565 ms.
Support contains 93 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 234 place count 3003 transition count 2719
Reduce places removed 234 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 239 rules applied. Total rules applied 473 place count 2769 transition count 2714
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 478 place count 2764 transition count 2714
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 245 Pre rules applied. Total rules applied 478 place count 2764 transition count 2469
Deduced a syphon composed of 245 places in 6 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 968 place count 2519 transition count 2469
Discarding 330 places :
Symmetric choice reduction at 3 with 330 rule applications. Total rules 1298 place count 2189 transition count 2139
Iterating global reduction 3 with 330 rules applied. Total rules applied 1628 place count 2189 transition count 2139
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 133 Pre rules applied. Total rules applied 1628 place count 2189 transition count 2006
Deduced a syphon composed of 133 places in 15 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 1894 place count 2056 transition count 2006
Performed 700 Post agglomeration using F-continuation condition.Transition count delta: 700
Deduced a syphon composed of 700 places in 4 ms
Reduce places removed 700 places and 0 transitions.
Iterating global reduction 3 with 1400 rules applied. Total rules applied 3294 place count 1356 transition count 1306
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 320 times.
Drop transitions removed 320 transitions
Iterating global reduction 3 with 320 rules applied. Total rules applied 3614 place count 1356 transition count 1306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3615 place count 1355 transition count 1305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3616 place count 1354 transition count 1305
Applied a total of 3616 rules in 896 ms. Remains 1354 /3003 variables (removed 1649) and now considering 1305/2953 (removed 1648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 897 ms. Remains : 1354/3003 places, 1305/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 4) seen :2
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1305 rows 1354 cols
[2023-03-18 22:41:54] [INFO ] Computed 450 place invariants in 35 ms
[2023-03-18 22:41:54] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 22:41:54] [INFO ] [Nat]Absence check using 441 positive place invariants in 92 ms returned sat
[2023-03-18 22:41:54] [INFO ] [Nat]Absence check using 441 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-18 22:41:56] [INFO ] After 1205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 22:41:56] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 1 ms to minimize.
[2023-03-18 22:41:56] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2023-03-18 22:41:57] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 1 ms to minimize.
[2023-03-18 22:41:57] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 1 ms to minimize.
[2023-03-18 22:41:58] [INFO ] Deduced a trap composed of 7 places in 661 ms of which 5 ms to minimize.
[2023-03-18 22:41:58] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2023-03-18 22:41:58] [INFO ] Deduced a trap composed of 6 places in 384 ms of which 0 ms to minimize.
[2023-03-18 22:41:59] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 0 ms to minimize.
[2023-03-18 22:41:59] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 1 ms to minimize.
[2023-03-18 22:41:59] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 1 ms to minimize.
[2023-03-18 22:42:00] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-18 22:42:00] [INFO ] Deduced a trap composed of 10 places in 397 ms of which 1 ms to minimize.
[2023-03-18 22:42:01] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 1 ms to minimize.
[2023-03-18 22:42:01] [INFO ] Deduced a trap composed of 4 places in 460 ms of which 0 ms to minimize.
[2023-03-18 22:42:01] [INFO ] Deduced a trap composed of 5 places in 243 ms of which 1 ms to minimize.
[2023-03-18 22:42:02] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2023-03-18 22:42:02] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2023-03-18 22:42:03] [INFO ] Deduced a trap composed of 5 places in 405 ms of which 0 ms to minimize.
[2023-03-18 22:42:03] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2023-03-18 22:42:03] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2023-03-18 22:42:03] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 2 ms to minimize.
[2023-03-18 22:42:04] [INFO ] Deduced a trap composed of 9 places in 280 ms of which 0 ms to minimize.
[2023-03-18 22:42:04] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 17 ms to minimize.
[2023-03-18 22:42:04] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 0 ms to minimize.
[2023-03-18 22:42:05] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2023-03-18 22:42:05] [INFO ] Deduced a trap composed of 9 places in 454 ms of which 1 ms to minimize.
[2023-03-18 22:42:06] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 0 ms to minimize.
[2023-03-18 22:42:06] [INFO ] Deduced a trap composed of 17 places in 223 ms of which 1 ms to minimize.
[2023-03-18 22:42:06] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 14 ms to minimize.
[2023-03-18 22:42:06] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
[2023-03-18 22:42:07] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-18 22:42:07] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 11006 ms
[2023-03-18 22:42:07] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-18 22:42:08] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 1 ms to minimize.
[2023-03-18 22:42:08] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 0 ms to minimize.
[2023-03-18 22:42:08] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2023-03-18 22:42:09] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-18 22:42:09] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-18 22:42:09] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 1 ms to minimize.
[2023-03-18 22:42:09] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2023-03-18 22:42:10] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 1 ms to minimize.
[2023-03-18 22:42:10] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2023-03-18 22:42:10] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 1 ms to minimize.
[2023-03-18 22:42:11] [INFO ] Deduced a trap composed of 21 places in 220 ms of which 1 ms to minimize.
[2023-03-18 22:42:11] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 0 ms to minimize.
[2023-03-18 22:42:11] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 2 ms to minimize.
[2023-03-18 22:42:11] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 1 ms to minimize.
[2023-03-18 22:42:12] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 0 ms to minimize.
[2023-03-18 22:42:12] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-18 22:42:12] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 0 ms to minimize.
[2023-03-18 22:42:12] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 0 ms to minimize.
[2023-03-18 22:42:13] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-03-18 22:42:13] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2023-03-18 22:42:13] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 15 ms to minimize.
[2023-03-18 22:42:13] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 0 ms to minimize.
[2023-03-18 22:42:14] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 0 ms to minimize.
[2023-03-18 22:42:14] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2023-03-18 22:42:14] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 25 ms to minimize.
[2023-03-18 22:42:14] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7337 ms
[2023-03-18 22:42:14] [INFO ] After 19958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 379 ms.
[2023-03-18 22:42:15] [INFO ] After 20839ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 87 ms.
Support contains 43 out of 1354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1354/1354 places, 1305/1305 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1354 transition count 1301
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1350 transition count 1301
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 8 place count 1350 transition count 1289
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 32 place count 1338 transition count 1289
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 28 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 94 place count 1307 transition count 1258
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 108 place count 1307 transition count 1258
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 1301 transition count 1252
Applied a total of 114 rules in 302 ms. Remains 1301 /1354 variables (removed 53) and now considering 1252/1305 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 1301/1354 places, 1252/1305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 118101 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118101 steps, saw 67321 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1252 rows 1301 cols
[2023-03-18 22:42:19] [INFO ] Computed 450 place invariants in 42 ms
[2023-03-18 22:42:19] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 22:42:19] [INFO ] [Nat]Absence check using 446 positive place invariants in 126 ms returned sat
[2023-03-18 22:42:19] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-18 22:42:22] [INFO ] After 3124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 22:42:23] [INFO ] Deduced a trap composed of 4 places in 269 ms of which 1 ms to minimize.
[2023-03-18 22:42:23] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-18 22:42:23] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2023-03-18 22:42:24] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 0 ms to minimize.
[2023-03-18 22:42:24] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 0 ms to minimize.
[2023-03-18 22:42:25] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-18 22:42:25] [INFO ] Deduced a trap composed of 4 places in 274 ms of which 0 ms to minimize.
[2023-03-18 22:42:25] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2023-03-18 22:42:27] [INFO ] Deduced a trap composed of 8 places in 1089 ms of which 1 ms to minimize.
[2023-03-18 22:42:27] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2023-03-18 22:42:27] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 1 ms to minimize.
[2023-03-18 22:42:28] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2023-03-18 22:42:28] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2023-03-18 22:42:28] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 1 ms to minimize.
[2023-03-18 22:42:28] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 0 ms to minimize.
[2023-03-18 22:42:29] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 0 ms to minimize.
[2023-03-18 22:42:29] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 0 ms to minimize.
[2023-03-18 22:42:29] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 0 ms to minimize.
[2023-03-18 22:42:30] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 1 ms to minimize.
[2023-03-18 22:42:30] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 0 ms to minimize.
[2023-03-18 22:42:30] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2023-03-18 22:42:30] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 0 ms to minimize.
[2023-03-18 22:42:31] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2023-03-18 22:42:31] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2023-03-18 22:42:31] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Deduced a trap composed of 7 places in 201 ms of which 0 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 0 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-18 22:42:32] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 10010 ms
[2023-03-18 22:42:33] [INFO ] Deduced a trap composed of 7 places in 439 ms of which 0 ms to minimize.
[2023-03-18 22:42:33] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
[2023-03-18 22:42:34] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 1 ms to minimize.
[2023-03-18 22:42:34] [INFO ] Deduced a trap composed of 9 places in 339 ms of which 1 ms to minimize.
[2023-03-18 22:42:34] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2023-03-18 22:42:35] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-18 22:42:35] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2023-03-18 22:42:35] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2023-03-18 22:42:35] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 0 ms to minimize.
[2023-03-18 22:42:36] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 1 ms to minimize.
[2023-03-18 22:42:36] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-18 22:42:36] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 0 ms to minimize.
[2023-03-18 22:42:36] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 0 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 1 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 1 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2023-03-18 22:42:37] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 0 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-03-18 22:42:38] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2023-03-18 22:42:39] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 14 ms to minimize.
[2023-03-18 22:42:40] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-18 22:42:40] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 2 ms to minimize.
[2023-03-18 22:42:40] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 0 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2023-03-18 22:42:41] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8819 ms
[2023-03-18 22:42:42] [INFO ] After 22313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 376 ms.
[2023-03-18 22:42:42] [INFO ] After 23080ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 97 ms.
Support contains 43 out of 1301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1301/1301 places, 1252/1252 transitions.
Applied a total of 0 rules in 37 ms. Remains 1301 /1301 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1301/1301 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1301/1301 places, 1252/1252 transitions.
Applied a total of 0 rules in 36 ms. Remains 1301 /1301 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2023-03-18 22:42:42] [INFO ] Invariant cache hit.
[2023-03-18 22:42:43] [INFO ] Implicit Places using invariants in 849 ms returned []
[2023-03-18 22:42:43] [INFO ] Invariant cache hit.
[2023-03-18 22:42:45] [INFO ] Implicit Places using invariants and state equation in 2171 ms returned []
Implicit Place search using SMT with State Equation took 3025 ms to find 0 implicit places.
[2023-03-18 22:42:45] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-18 22:42:45] [INFO ] Invariant cache hit.
[2023-03-18 22:42:46] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3831 ms. Remains : 1301/1301 places, 1252/1252 transitions.
Applied a total of 0 rules in 33 ms. Remains 1301 /1301 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 22:42:46] [INFO ] Invariant cache hit.
[2023-03-18 22:42:46] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 22:42:46] [INFO ] [Nat]Absence check using 446 positive place invariants in 69 ms returned sat
[2023-03-18 22:42:46] [INFO ] [Nat]Absence check using 446 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-18 22:42:47] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 22:42:47] [INFO ] Deduced a trap composed of 6 places in 240 ms of which 1 ms to minimize.
[2023-03-18 22:42:48] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 0 ms to minimize.
[2023-03-18 22:42:48] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 1 ms to minimize.
[2023-03-18 22:42:48] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2023-03-18 22:42:49] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2023-03-18 22:42:49] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2023-03-18 22:42:49] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-18 22:42:50] [INFO ] Deduced a trap composed of 5 places in 349 ms of which 0 ms to minimize.
[2023-03-18 22:42:50] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-18 22:42:50] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 0 ms to minimize.
[2023-03-18 22:42:50] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2023-03-18 22:42:51] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2023-03-18 22:42:51] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 0 ms to minimize.
[2023-03-18 22:42:51] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2023-03-18 22:42:51] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 1 ms to minimize.
[2023-03-18 22:42:52] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 0 ms to minimize.
[2023-03-18 22:42:52] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2023-03-18 22:42:52] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2023-03-18 22:42:52] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-18 22:42:52] [INFO ] Deduced a trap composed of 6 places in 110 ms of which 0 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 0 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2023-03-18 22:42:53] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 0 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 0 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Deduced a trap composed of 12 places in 194 ms of which 0 ms to minimize.
[2023-03-18 22:42:54] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7203 ms
[2023-03-18 22:42:55] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2023-03-18 22:42:55] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 1 ms to minimize.
[2023-03-18 22:42:56] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2023-03-18 22:42:56] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
[2023-03-18 22:42:56] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2023-03-18 22:42:56] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-18 22:42:57] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 1 ms to minimize.
[2023-03-18 22:42:57] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-18 22:42:57] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-18 22:42:58] [INFO ] Deduced a trap composed of 5 places in 233 ms of which 1 ms to minimize.
[2023-03-18 22:42:58] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2023-03-18 22:42:58] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 0 ms to minimize.
[2023-03-18 22:42:58] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2023-03-18 22:42:59] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 1 ms to minimize.
[2023-03-18 22:42:59] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 1 ms to minimize.
[2023-03-18 22:42:59] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2023-03-18 22:43:00] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2023-03-18 22:43:00] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2023-03-18 22:43:00] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2023-03-18 22:43:00] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2023-03-18 22:43:01] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 0 ms to minimize.
[2023-03-18 22:43:01] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-18 22:43:01] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2023-03-18 22:43:02] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-18 22:43:02] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 1 ms to minimize.
[2023-03-18 22:43:02] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2023-03-18 22:43:02] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 1 ms to minimize.
[2023-03-18 22:43:03] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 0 ms to minimize.
[2023-03-18 22:43:03] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7988 ms
[2023-03-18 22:43:03] [INFO ] After 16299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 375 ms.
[2023-03-18 22:43:03] [INFO ] After 16916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 22:43:03] [INFO ] Flatten gal took : 91 ms
[2023-03-18 22:43:03] [INFO ] Flatten gal took : 77 ms
[2023-03-18 22:43:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4955295036306188036.gal : 11 ms
[2023-03-18 22:43:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10540258536967296224.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4955295036306188036.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10540258536967296224.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10540258536967296224.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 588
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :588 after 10584
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.71536e+06 after 2.57191e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2.57191e+07 after 3.34673e+07
Detected timeout of ITS tools.
[2023-03-18 22:43:18] [INFO ] Flatten gal took : 60 ms
[2023-03-18 22:43:18] [INFO ] Applying decomposition
[2023-03-18 22:43:18] [INFO ] Flatten gal took : 61 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10024811394279928462.txt' '-o' '/tmp/graph10024811394279928462.bin' '-w' '/tmp/graph10024811394279928462.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10024811394279928462.bin' '-l' '-1' '-v' '-w' '/tmp/graph10024811394279928462.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:43:19] [INFO ] Decomposing Gal with order
[2023-03-18 22:43:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:43:19] [INFO ] Removed a total of 978 redundant transitions.
[2023-03-18 22:43:19] [INFO ] Flatten gal took : 162 ms
[2023-03-18 22:43:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 1122 labels/synchronizations in 76 ms.
[2023-03-18 22:43:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2530748077611010465.gal : 19 ms
[2023-03-18 22:43:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11608478570049028716.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2530748077611010465.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11608478570049028716.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11608478570049028716.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :4 after 4
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :4 after 4
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16171566563099988181
[2023-03-18 22:43:34] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16171566563099988181
Running compilation step : cd /tmp/ltsmin16171566563099988181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2652 ms.
Running link step : cd /tmp/ltsmin16171566563099988181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16171566563099988181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldIIPsPT050BReachabilityCardinality04==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-18 22:43:50] [INFO ] Flatten gal took : 124 ms
[2023-03-18 22:43:50] [INFO ] Applying decomposition
[2023-03-18 22:43:50] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16850223699663064029.txt' '-o' '/tmp/graph16850223699663064029.bin' '-w' '/tmp/graph16850223699663064029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16850223699663064029.bin' '-l' '-1' '-v' '-w' '/tmp/graph16850223699663064029.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:43:50] [INFO ] Decomposing Gal with order
[2023-03-18 22:43:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:43:50] [INFO ] Removed a total of 1150 redundant transitions.
[2023-03-18 22:43:50] [INFO ] Flatten gal took : 218 ms
[2023-03-18 22:43:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2023-03-18 22:43:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8013308206572721060.gal : 32 ms
[2023-03-18 22:43:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4360594064003510801.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8013308206572721060.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4360594064003510801.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality4360594064003510801.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1227
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1227 after 2.31208e+50
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :2.31208e+50 after 1.5919e+113
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.17916e+139 after 4.33761e+139
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 23:13:55] [INFO ] Flatten gal took : 1038 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin417632618564296278
[2023-03-18 23:13:55] [INFO ] Computing symmetric may disable matrix : 1252 transitions.
[2023-03-18 23:13:55] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:13:55] [INFO ] Computing symmetric may enable matrix : 1252 transitions.
[2023-03-18 23:13:55] [INFO ] Computation of Complete enable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:13:56] [INFO ] Applying decomposition
[2023-03-18 23:13:56] [INFO ] Flatten gal took : 661 ms
[2023-03-18 23:14:01] [INFO ] Computing Do-Not-Accords matrix : 1252 transitions.
[2023-03-18 23:14:01] [INFO ] Computation of Completed DNA matrix. took 77 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 23:14:02] [INFO ] Built C files in 6673ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin417632618564296278
Running compilation step : cd /tmp/ltsmin417632618564296278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph920921605373372217.txt' '-o' '/tmp/graph920921605373372217.bin' '-w' '/tmp/graph920921605373372217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph920921605373372217.bin' '-l' '-1' '-v' '-w' '/tmp/graph920921605373372217.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:14:02] [INFO ] Decomposing Gal with order
[2023-03-18 23:14:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:14:02] [INFO ] Removed a total of 984 redundant transitions.
[2023-03-18 23:14:02] [INFO ] Flatten gal took : 268 ms
[2023-03-18 23:14:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 1027 labels/synchronizations in 31 ms.
[2023-03-18 23:14:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10350425334883891124.gal : 16 ms
[2023-03-18 23:14:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12211443405808912289.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10350425334883891124.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12211443405808912289.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12211443405808912289.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 5
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :5 after 5
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5 after 5
Compilation finished in 4818 ms.
Running link step : cd /tmp/ltsmin417632618564296278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 156 ms.
Running LTSmin : cd /tmp/ltsmin417632618564296278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT050BReachabilityCardinality04==true'
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5 after 29
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6453012 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102184 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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldIIPs-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPs-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713200158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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