Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905974900174.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974900174
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 18:21 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 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 1.3M 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 ShieldRVs-PT-100B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679170741341

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=ShieldRVs-PT-100B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-18 20:19:03] [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 20:19:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:19:03] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2023-03-18 20:19:03] [INFO ] Transformed 4003 places.
[2023-03-18 20:19:03] [INFO ] Transformed 4503 transitions.
[2023-03-18 20:19:03] [INFO ] Found NUPN structural information;
[2023-03-18 20:19:03] [INFO ] Parsed PT model containing 4003 places and 4503 transitions and 14400 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 11) seen :8
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
[2023-03-18 20:19:04] [INFO ] Flatten gal took : 305 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 4503 rows 4003 cols
[2023-03-18 20:19:04] [INFO ] Computed 401 place invariants in 91 ms
[2023-03-18 20:19:04] [INFO ] Flatten gal took : 200 ms
[2023-03-18 20:19:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5298686242285235802.gal : 59 ms
[2023-03-18 20:19:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14194946714306582504.prop : 2 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/ReachabilityCardinality5298686242285235802.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14194946714306582504.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/ReachabilityCardinality14194946714306582504.prop.
[2023-03-18 20:19:05] [INFO ] After 1049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:19:06] [INFO ] [Nat]Absence check using 401 positive place invariants in 217 ms returned sat
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 250
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :250 after 1.7328e+10
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :1.7328e+10 after 4.17975e+27
[2023-03-18 20:19:17] [INFO ] After 10972ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 20:19:20] [INFO ] Deduced a trap composed of 23 places in 2282 ms of which 10 ms to minimize.
[2023-03-18 20:19:22] [INFO ] Deduced a trap composed of 21 places in 1893 ms of which 2 ms to minimize.
[2023-03-18 20:19:24] [INFO ] Deduced a trap composed of 32 places in 1834 ms of which 3 ms to minimize.
[2023-03-18 20:19:26] [INFO ] Deduced a trap composed of 23 places in 1806 ms of which 3 ms to minimize.
[2023-03-18 20:19:28] [INFO ] Deduced a trap composed of 33 places in 1696 ms of which 12 ms to minimize.
[2023-03-18 20:19:29] [INFO ] Deduced a trap composed of 49 places in 1628 ms of which 3 ms to minimize.
[2023-03-18 20:19:31] [INFO ] Deduced a trap composed of 24 places in 1578 ms of which 6 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 20:19:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 20:19:31] [INFO ] After 25947ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 559 ms.
Support contains 26 out of 4003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4003/4003 places, 4503/4503 transitions.
Drop transitions removed 394 transitions
Trivial Post-agglo rules discarded 394 transitions
Performed 394 trivial Post agglomeration. Transition count delta: 394
Iterating post reduction 0 with 394 rules applied. Total rules applied 394 place count 4003 transition count 4109
Reduce places removed 394 places and 0 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 788 place count 3609 transition count 4109
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 788 place count 3609 transition count 3612
Deduced a syphon composed of 497 places in 31 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 1782 place count 3112 transition count 3612
Discarding 694 places :
Symmetric choice reduction at 2 with 694 rule applications. Total rules 2476 place count 2418 transition count 2918
Iterating global reduction 2 with 694 rules applied. Total rules applied 3170 place count 2418 transition count 2918
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 290 Pre rules applied. Total rules applied 3170 place count 2418 transition count 2628
Deduced a syphon composed of 290 places in 10 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 2 with 580 rules applied. Total rules applied 3750 place count 2128 transition count 2628
Performed 692 Post agglomeration using F-continuation condition.Transition count delta: 692
Deduced a syphon composed of 692 places in 17 ms
Reduce places removed 692 places and 0 transitions.
Iterating global reduction 2 with 1384 rules applied. Total rules applied 5134 place count 1436 transition count 1936
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 2 with 201 rules applied. Total rules applied 5335 place count 1436 transition count 1936
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5336 place count 1435 transition count 1935
Applied a total of 5336 rules in 1332 ms. Remains 1435 /4003 variables (removed 2568) and now considering 1935/4503 (removed 2568) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1334 ms. Remains : 1435/4003 places, 1935/4503 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 3) seen :1
FORMULA ShieldRVs-PT-100B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1935 rows 1435 cols
[2023-03-18 20:19:33] [INFO ] Computed 401 place invariants in 23 ms
[2023-03-18 20:19:34] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:19:34] [INFO ] [Nat]Absence check using 401 positive place invariants in 66 ms returned sat
[2023-03-18 20:19:35] [INFO ] After 900ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:19:35] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2023-03-18 20:19:36] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 0 ms to minimize.
[2023-03-18 20:19:36] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 0 ms to minimize.
[2023-03-18 20:19:36] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 1 ms to minimize.
[2023-03-18 20:19:37] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 1 ms to minimize.
[2023-03-18 20:19:37] [INFO ] Deduced a trap composed of 14 places in 211 ms of which 0 ms to minimize.
[2023-03-18 20:19:37] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 0 ms to minimize.
[2023-03-18 20:19:38] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 0 ms to minimize.
[2023-03-18 20:19:38] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 2 ms to minimize.
[2023-03-18 20:19:38] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 1 ms to minimize.
[2023-03-18 20:19:38] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-18 20:19:39] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 0 ms to minimize.
[2023-03-18 20:19:39] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
[2023-03-18 20:19:39] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2023-03-18 20:19:40] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 1 ms to minimize.
[2023-03-18 20:19:41] [INFO ] Deduced a trap composed of 8 places in 1224 ms of which 1 ms to minimize.
[2023-03-18 20:19:41] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 1 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 1 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 1 ms to minimize.
[2023-03-18 20:19:42] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 1 ms to minimize.
[2023-03-18 20:19:43] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 1 ms to minimize.
[2023-03-18 20:19:43] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2023-03-18 20:19:43] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 1 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2023-03-18 20:19:44] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 1 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 6 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 1 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2023-03-18 20:19:45] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2023-03-18 20:19:46] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 0 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2023-03-18 20:19:47] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 0 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 3 ms to minimize.
[2023-03-18 20:19:48] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 0 ms to minimize.
[2023-03-18 20:19:49] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2023-03-18 20:19:49] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 2 ms to minimize.
[2023-03-18 20:19:49] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-18 20:19:49] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 3 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 1 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 0 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 13 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2023-03-18 20:19:50] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 0 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 0 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 0 ms to minimize.
[2023-03-18 20:19:51] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 16537 ms
[2023-03-18 20:19:52] [INFO ] After 17811ms 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 20:19:52] [INFO ] After 18479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 88 ms.
Support contains 25 out of 1435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1435/1435 places, 1935/1935 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1434 transition count 1934
Applied a total of 2 rules in 588 ms. Remains 1434 /1435 variables (removed 1) and now considering 1934/1935 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 588 ms. Remains : 1434/1435 places, 1934/1935 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 124001 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124001 steps, saw 70794 distinct states, run finished after 3003 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1934 rows 1434 cols
[2023-03-18 20:19:56] [INFO ] Computed 401 place invariants in 41 ms
[2023-03-18 20:19:56] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:19:57] [INFO ] [Nat]Absence check using 401 positive place invariants in 94 ms returned sat
[2023-03-18 20:19:59] [INFO ] After 2695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:20:00] [INFO ] Deduced a trap composed of 11 places in 322 ms of which 1 ms to minimize.
[2023-03-18 20:20:00] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 1 ms to minimize.
[2023-03-18 20:20:01] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 2 ms to minimize.
[2023-03-18 20:20:01] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2023-03-18 20:20:01] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 5 ms to minimize.
[2023-03-18 20:20:02] [INFO ] Deduced a trap composed of 8 places in 271 ms of which 2 ms to minimize.
[2023-03-18 20:20:02] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 0 ms to minimize.
[2023-03-18 20:20:02] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2023-03-18 20:20:03] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 1 ms to minimize.
[2023-03-18 20:20:03] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 0 ms to minimize.
[2023-03-18 20:20:03] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:20:04] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 1 ms to minimize.
[2023-03-18 20:20:04] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 2 ms to minimize.
[2023-03-18 20:20:04] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2023-03-18 20:20:05] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 0 ms to minimize.
[2023-03-18 20:20:05] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 0 ms to minimize.
[2023-03-18 20:20:05] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 0 ms to minimize.
[2023-03-18 20:20:05] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 1 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-18 20:20:06] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 1 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 0 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2023-03-18 20:20:07] [INFO ] Deduced a trap composed of 16 places in 249 ms of which 0 ms to minimize.
[2023-03-18 20:20:08] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2023-03-18 20:20:08] [INFO ] Deduced a trap composed of 12 places in 243 ms of which 0 ms to minimize.
[2023-03-18 20:20:08] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2023-03-18 20:20:09] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 0 ms to minimize.
[2023-03-18 20:20:09] [INFO ] Deduced a trap composed of 8 places in 241 ms of which 1 ms to minimize.
[2023-03-18 20:20:09] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 0 ms to minimize.
[2023-03-18 20:20:10] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2023-03-18 20:20:10] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 1 ms to minimize.
[2023-03-18 20:20:10] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-18 20:20:11] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 0 ms to minimize.
[2023-03-18 20:20:11] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2023-03-18 20:20:11] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 1 ms to minimize.
[2023-03-18 20:20:12] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-18 20:20:12] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 0 ms to minimize.
[2023-03-18 20:20:12] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 1 ms to minimize.
[2023-03-18 20:20:12] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 0 ms to minimize.
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 0 ms to minimize.
[2023-03-18 20:20:13] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 0 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 16 places in 196 ms of which 1 ms to minimize.
[2023-03-18 20:20:14] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 1 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 24 places in 144 ms of which 1 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 0 ms to minimize.
[2023-03-18 20:20:15] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 1 ms to minimize.
[2023-03-18 20:20:16] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2023-03-18 20:20:16] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2023-03-18 20:20:16] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 16433 ms
[2023-03-18 20:20:16] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-18 20:20:16] [INFO ] Deduced a trap composed of 15 places in 150 ms of which 0 ms to minimize.
[2023-03-18 20:20:17] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2023-03-18 20:20:17] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2023-03-18 20:20:17] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2023-03-18 20:20:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1270 ms
[2023-03-18 20:20:17] [INFO ] After 20780ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 480 ms.
[2023-03-18 20:20:18] [INFO ] After 21598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 109 ms.
Support contains 25 out of 1434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 76 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1434/1434 places, 1934/1934 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 78 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
[2023-03-18 20:20:18] [INFO ] Invariant cache hit.
[2023-03-18 20:20:19] [INFO ] Implicit Places using invariants in 803 ms returned []
[2023-03-18 20:20:19] [INFO ] Invariant cache hit.
[2023-03-18 20:20:21] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2539 ms to find 0 implicit places.
[2023-03-18 20:20:21] [INFO ] Redundant transitions in 481 ms returned []
[2023-03-18 20:20:21] [INFO ] Invariant cache hit.
[2023-03-18 20:20:22] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4054 ms. Remains : 1434/1434 places, 1934/1934 transitions.
Applied a total of 0 rules in 55 ms. Remains 1434 /1434 variables (removed 0) and now considering 1934/1934 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-18 20:20:22] [INFO ] Invariant cache hit.
[2023-03-18 20:20:22] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:20:22] [INFO ] [Nat]Absence check using 401 positive place invariants in 72 ms returned sat
[2023-03-18 20:20:24] [INFO ] After 1018ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:20:24] [INFO ] Deduced a trap composed of 11 places in 350 ms of which 1 ms to minimize.
[2023-03-18 20:20:25] [INFO ] Deduced a trap composed of 10 places in 341 ms of which 1 ms to minimize.
[2023-03-18 20:20:25] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-18 20:20:26] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 1 ms to minimize.
[2023-03-18 20:20:26] [INFO ] Deduced a trap composed of 7 places in 295 ms of which 1 ms to minimize.
[2023-03-18 20:20:26] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 1 ms to minimize.
[2023-03-18 20:20:27] [INFO ] Deduced a trap composed of 8 places in 300 ms of which 1 ms to minimize.
[2023-03-18 20:20:27] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 1 ms to minimize.
[2023-03-18 20:20:28] [INFO ] Deduced a trap composed of 15 places in 254 ms of which 0 ms to minimize.
[2023-03-18 20:20:28] [INFO ] Deduced a trap composed of 8 places in 265 ms of which 1 ms to minimize.
[2023-03-18 20:20:28] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 0 ms to minimize.
[2023-03-18 20:20:29] [INFO ] Deduced a trap composed of 12 places in 267 ms of which 1 ms to minimize.
[2023-03-18 20:20:29] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2023-03-18 20:20:29] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 3 ms to minimize.
[2023-03-18 20:20:30] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 0 ms to minimize.
[2023-03-18 20:20:30] [INFO ] Deduced a trap composed of 15 places in 259 ms of which 1 ms to minimize.
[2023-03-18 20:20:30] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 0 ms to minimize.
[2023-03-18 20:20:31] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-18 20:20:31] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 2 ms to minimize.
[2023-03-18 20:20:31] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 1 ms to minimize.
[2023-03-18 20:20:32] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-18 20:20:32] [INFO ] Deduced a trap composed of 12 places in 202 ms of which 1 ms to minimize.
[2023-03-18 20:20:32] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 0 ms to minimize.
[2023-03-18 20:20:33] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-18 20:20:33] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-18 20:20:33] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 1 ms to minimize.
[2023-03-18 20:20:34] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2023-03-18 20:20:34] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2023-03-18 20:20:34] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 1 ms to minimize.
[2023-03-18 20:20:34] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-18 20:20:35] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 1 ms to minimize.
[2023-03-18 20:20:35] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-18 20:20:35] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-18 20:20:36] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2023-03-18 20:20:36] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:20:36] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 0 ms to minimize.
[2023-03-18 20:20:36] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-18 20:20:37] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 1 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 0 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 0 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 1 ms to minimize.
[2023-03-18 20:20:38] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 1 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 1 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 0 ms to minimize.
[2023-03-18 20:20:39] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 0 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 1 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 1 ms to minimize.
[2023-03-18 20:20:40] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 0 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:20:41] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 1 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2023-03-18 20:20:42] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 40 places in 132 ms of which 1 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 1 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 0 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 0 ms to minimize.
[2023-03-18 20:20:43] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 1 ms to minimize.
[2023-03-18 20:20:44] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 0 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 1 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 0 ms to minimize.
[2023-03-18 20:20:45] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 0 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 0 ms to minimize.
[2023-03-18 20:20:46] [INFO ] Trap strengthening (SAT) tested/added 81/80 trap constraints in 22160 ms
[2023-03-18 20:20:46] [INFO ] After 23696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 299 ms.
[2023-03-18 20:20:47] [INFO ] After 24258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-18 20:20:47] [INFO ] Flatten gal took : 147 ms
[2023-03-18 20:20:47] [INFO ] Flatten gal took : 135 ms
[2023-03-18 20:20:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality469721833973752065.gal : 18 ms
[2023-03-18 20:20:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7379154044430817298.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/ReachabilityCardinality469721833973752065.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7379154044430817298.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 ...327
Loading property file /tmp/ReachabilityCardinality7379154044430817298.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 29
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :29 after 83
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :83 after 245
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :245 after 731
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :731 after 26246
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.88971e+06 after 1.33548e+07
Detected timeout of ITS tools.
[2023-03-18 20:21:02] [INFO ] Flatten gal took : 128 ms
[2023-03-18 20:21:02] [INFO ] Applying decomposition
[2023-03-18 20:21:02] [INFO ] Flatten gal took : 104 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/graph9030217947196050693.txt' '-o' '/tmp/graph9030217947196050693.bin' '-w' '/tmp/graph9030217947196050693.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9030217947196050693.bin' '-l' '-1' '-v' '-w' '/tmp/graph9030217947196050693.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:21:03] [INFO ] Decomposing Gal with order
[2023-03-18 20:21:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:21:03] [INFO ] Removed a total of 2232 redundant transitions.
[2023-03-18 20:21:03] [INFO ] Flatten gal took : 196 ms
[2023-03-18 20:21:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2452 labels/synchronizations in 143 ms.
[2023-03-18 20:21:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2460831174727610293.gal : 21 ms
[2023-03-18 20:21:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4286402521449015099.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/ReachabilityCardinality2460831174727610293.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4286402521449015099.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/ReachabilityCardinality4286402521449015099.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 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 5
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12114243834902934085
[2023-03-18 20:21:18] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12114243834902934085
Running compilation step : cd /tmp/ltsmin12114243834902934085;'/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'
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/ltsmin12114243834902934085;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12114243834902934085;'/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' 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)
[2023-03-18 20:21:22] [INFO ] Flatten gal took : 195 ms
[2023-03-18 20:21:22] [INFO ] Applying decomposition
[2023-03-18 20:21:22] [INFO ] Flatten gal took : 183 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/graph13129418434311924262.txt' '-o' '/tmp/graph13129418434311924262.bin' '-w' '/tmp/graph13129418434311924262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13129418434311924262.bin' '-l' '-1' '-v' '-w' '/tmp/graph13129418434311924262.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:21:22] [INFO ] Decomposing Gal with order
[2023-03-18 20:21:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:21:23] [INFO ] Removed a total of 3591 redundant transitions.
[2023-03-18 20:21:23] [INFO ] Flatten gal took : 326 ms
[2023-03-18 20:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 23 ms.
[2023-03-18 20:21:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17892999841921725140.gal : 77 ms
[2023-03-18 20:21:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4303260051789288806.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/ReachabilityCardinality17892999841921725140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4303260051789288806.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/ReachabilityCardinality4303260051789288806.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 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 8.88915e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5.76933e+12 after 2.22631e+48
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.22631e+48 after 3.33947e+50
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.33947e+50 after 7.93165e+220
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7.93165e+220 after 7.93165e+220
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-18 20:51:28] [INFO ] Flatten gal took : 778 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2359581818106984054
[2023-03-18 20:51:28] [INFO ] Too many transitions (1934) to apply POR reductions. Disabling POR matrices.
[2023-03-18 20:51:28] [INFO ] Built C files in 301ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2359581818106984054
Running compilation step : cd /tmp/ltsmin2359581818106984054;'/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'
[2023-03-18 20:51:29] [INFO ] Applying decomposition
[2023-03-18 20:51:29] [INFO ] Flatten gal took : 467 ms
Compilation finished in 4480 ms.
Running link step : cd /tmp/ltsmin2359581818106984054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2359581818106984054;'/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' 'ShieldRVsPT100BReachabilityCardinality03==true'
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/graph439166839932190725.txt' '-o' '/tmp/graph439166839932190725.bin' '-w' '/tmp/graph439166839932190725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph439166839932190725.bin' '-l' '-1' '-v' '-w' '/tmp/graph439166839932190725.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:51:34] [INFO ] Decomposing Gal with order
[2023-03-18 20:51:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:51:35] [INFO ] Removed a total of 2212 redundant transitions.
[2023-03-18 20:51:35] [INFO ] Flatten gal took : 439 ms
[2023-03-18 20:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2464 labels/synchronizations in 206 ms.
[2023-03-18 20:51:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15913928778316943739.gal : 126 ms
[2023-03-18 20:51:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17180586184444671324.prop : 38 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/ReachabilityCardinality15913928778316943739.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17180586184444671324.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/ReachabilityCardinality17180586184444671324.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 2
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :3 after 3
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :5 after 29
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :29 after 4376
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :4376 after 4376
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5280044 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16084672 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ShieldRVs-PT-100B"
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 ShieldRVs-PT-100B, 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 r421-tajo-167905974900174"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-100B.tgz
mv ShieldRVs-PT-100B 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 ;