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.r393-oct2-167903716800271.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 ltsminxred
Input is ShieldIIPt-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 25 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 167K 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 ShieldIIPt-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679435845226

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:57:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 21:57:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:57:27] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-21 21:57:28] [INFO ] Transformed 703 places.
[2023-03-21 21:57:28] [INFO ] Transformed 653 transitions.
[2023-03-21 21:57:28] [INFO ] Found NUPN structural information;
[2023-03-21 21:57:28] [INFO ] Parsed PT model containing 703 places and 653 transitions and 1626 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 653 rows 703 cols
[2023-03-21 21:57:28] [INFO ] Computed 91 place invariants in 14 ms
[2023-03-21 21:57:29] [INFO ] [Real]Absence check using 91 positive place invariants in 30 ms returned sat
[2023-03-21 21:57:29] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 21:57:29] [INFO ] [Nat]Absence check using 91 positive place invariants in 41 ms returned sat
[2023-03-21 21:57:31] [INFO ] After 1316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 21:57:31] [INFO ] Deduced a trap composed of 17 places in 315 ms of which 12 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 1 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 20 places in 191 ms of which 2 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 1 ms to minimize.
[2023-03-21 21:57:32] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 4 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 13 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-03-21 21:57:33] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 0 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-21 21:57:34] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2924 ms
[2023-03-21 21:57:34] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 1 ms to minimize.
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 0 ms to minimize.
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2023-03-21 21:57:35] [INFO ] Deduced a trap composed of 28 places in 314 ms of which 1 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 19 places in 161 ms of which 0 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 0 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 1 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2023-03-21 21:57:36] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 1 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 27 places in 206 ms of which 1 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 0 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 1 ms to minimize.
[2023-03-21 21:57:37] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2023-03-21 21:57:38] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 0 ms to minimize.
[2023-03-21 21:57:38] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2023-03-21 21:57:38] [INFO ] Deduced a trap composed of 31 places in 117 ms of which 0 ms to minimize.
[2023-03-21 21:57:38] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 1 ms to minimize.
[2023-03-21 21:57:39] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 1 ms to minimize.
[2023-03-21 21:57:39] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 14 ms to minimize.
[2023-03-21 21:57:39] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 4704 ms
[2023-03-21 21:57:39] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 1 ms to minimize.
[2023-03-21 21:57:39] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 1 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 1 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 24 places in 146 ms of which 1 ms to minimize.
[2023-03-21 21:57:40] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 10 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 20 places in 436 ms of which 4 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 1 ms to minimize.
[2023-03-21 21:57:41] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 13 ms to minimize.
[2023-03-21 21:57:42] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2023-03-21 21:57:42] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2023-03-21 21:57:42] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2892 ms
[2023-03-21 21:57:42] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 0 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 1 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 0 ms to minimize.
[2023-03-21 21:57:43] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 0 ms to minimize.
[2023-03-21 21:57:44] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 16 ms to minimize.
[2023-03-21 21:57:44] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2023-03-21 21:57:44] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 1 ms to minimize.
[2023-03-21 21:57:44] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 1 ms to minimize.
[2023-03-21 21:57:44] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 0 ms to minimize.
[2023-03-21 21:57:45] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2023-03-21 21:57:45] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 1 ms to minimize.
[2023-03-21 21:57:45] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2023-03-21 21:57:45] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2023-03-21 21:57:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2940 ms
[2023-03-21 21:57:45] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 0 ms to minimize.
[2023-03-21 21:57:46] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
[2023-03-21 21:57:46] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2023-03-21 21:57:46] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2023-03-21 21:57:46] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 4 ms to minimize.
[2023-03-21 21:57:47] [INFO ] Deduced a trap composed of 24 places in 204 ms of which 3 ms to minimize.
[2023-03-21 21:57:47] [INFO ] Deduced a trap composed of 31 places in 161 ms of which 0 ms to minimize.
[2023-03-21 21:57:47] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 0 ms to minimize.
[2023-03-21 21:57:47] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 10 ms to minimize.
[2023-03-21 21:57:47] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 1 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 14 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2023-03-21 21:57:48] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2603 ms
[2023-03-21 21:57:48] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 1 ms to minimize.
[2023-03-21 21:57:49] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 1 ms to minimize.
[2023-03-21 21:57:49] [INFO ] Deduced a trap composed of 30 places in 192 ms of which 1 ms to minimize.
[2023-03-21 21:57:49] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 0 ms to minimize.
[2023-03-21 21:57:49] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 0 ms to minimize.
[2023-03-21 21:57:50] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 1 ms to minimize.
[2023-03-21 21:57:50] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 0 ms to minimize.
[2023-03-21 21:57:50] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 1 ms to minimize.
[2023-03-21 21:57:50] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 0 ms to minimize.
[2023-03-21 21:57:50] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 1 ms to minimize.
[2023-03-21 21:57:51] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 0 ms to minimize.
[2023-03-21 21:57:51] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 1 ms to minimize.
[2023-03-21 21:57:51] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 1 ms to minimize.
[2023-03-21 21:57:51] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2023-03-21 21:57:52] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 2 ms to minimize.
[2023-03-21 21:57:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3647 ms
[2023-03-21 21:57:52] [INFO ] Deduced a trap composed of 22 places in 133 ms of which 0 ms to minimize.
[2023-03-21 21:57:52] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 2 ms to minimize.
[2023-03-21 21:57:52] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 0 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 1 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 1 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2023-03-21 21:57:53] [INFO ] Deduced a trap composed of 23 places in 159 ms of which 1 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 0 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 0 ms to minimize.
[2023-03-21 21:57:54] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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-21 21:57:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 21:57:54] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 173 ms.
Support contains 183 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 703 transition count 590
Reduce places removed 63 places and 0 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Iterating post reduction 1 with 96 rules applied. Total rules applied 159 place count 640 transition count 557
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 192 place count 607 transition count 557
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 192 place count 607 transition count 523
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 260 place count 573 transition count 523
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 309 place count 524 transition count 474
Iterating global reduction 3 with 49 rules applied. Total rules applied 358 place count 524 transition count 474
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 358 place count 524 transition count 466
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 374 place count 516 transition count 466
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 554 place count 426 transition count 376
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 572 place count 417 transition count 376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 573 place count 417 transition count 375
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 577 place count 417 transition count 371
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 581 place count 413 transition count 371
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 586 place count 413 transition count 371
Applied a total of 586 rules in 150 ms. Remains 413 /703 variables (removed 290) and now considering 371/653 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 413/703 places, 371/653 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 8) seen :2
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 371 rows 413 cols
[2023-03-21 21:57:55] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 21:57:55] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 21:57:55] [INFO ] [Nat]Absence check using 91 positive place invariants in 22 ms returned sat
[2023-03-21 21:57:56] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 21:57:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-21 21:57:56] [INFO ] After 269ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 21:57:56] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-21 21:57:56] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-21 21:57:56] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 17 places in 119 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2023-03-21 21:57:57] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2023-03-21 21:57:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1429 ms
[2023-03-21 21:57:58] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2023-03-21 21:57:58] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 1 ms to minimize.
[2023-03-21 21:57:58] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 0 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-21 21:57:59] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2023-03-21 21:58:00] [INFO ] Deduced a trap composed of 10 places in 102 ms of which 1 ms to minimize.
[2023-03-21 21:58:00] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2023-03-21 21:58:00] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-03-21 21:58:00] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-03-21 21:58:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2365 ms
[2023-03-21 21:58:00] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 13 ms to minimize.
[2023-03-21 21:58:00] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-21 21:58:01] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-21 21:58:01] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 1 ms to minimize.
[2023-03-21 21:58:01] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2023-03-21 21:58:01] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-21 21:58:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 923 ms
[2023-03-21 21:58:01] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-21 21:58:01] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-21 21:58:02] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 1 ms to minimize.
[2023-03-21 21:58:02] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2023-03-21 21:58:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 616 ms
[2023-03-21 21:58:02] [INFO ] After 5999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-21 21:58:02] [INFO ] After 6933ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 85 ms.
Support contains 105 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 371/371 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 413 transition count 365
Reduce places removed 6 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 15 rules applied. Total rules applied 21 place count 407 transition count 356
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 30 place count 398 transition count 356
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 30 place count 398 transition count 340
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 62 place count 382 transition count 340
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 378 transition count 336
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 378 transition count 336
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 152 place count 337 transition count 295
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 160 place count 333 transition count 297
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 162 place count 333 transition count 295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 164 place count 331 transition count 295
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 331 transition count 295
Applied a total of 166 rules in 57 ms. Remains 331 /413 variables (removed 82) and now considering 295/371 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 331/413 places, 295/371 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 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 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 181771 steps, run timeout after 3004 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181771 steps, saw 123720 distinct states, run finished after 3007 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 295 rows 331 cols
[2023-03-21 21:58:06] [INFO ] Computed 91 place invariants in 2 ms
[2023-03-21 21:58:06] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 21:58:06] [INFO ] [Nat]Absence check using 91 positive place invariants in 12 ms returned sat
[2023-03-21 21:58:06] [INFO ] After 304ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 21:58:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 21:58:06] [INFO ] After 316ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 21:58:07] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-21 21:58:07] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2023-03-21 21:58:07] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 1 ms to minimize.
[2023-03-21 21:58:07] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2023-03-21 21:58:07] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-21 21:58:07] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-21 21:58:07] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 0 ms to minimize.
[2023-03-21 21:58:07] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 950 ms
[2023-03-21 21:58:08] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 0 ms to minimize.
[2023-03-21 21:58:08] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-21 21:58:08] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 13 ms to minimize.
[2023-03-21 21:58:08] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-21 21:58:08] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2023-03-21 21:58:08] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-21 21:58:08] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 1 ms to minimize.
[2023-03-21 21:58:09] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-21 21:58:09] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-21 21:58:09] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 1 ms to minimize.
[2023-03-21 21:58:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1396 ms
[2023-03-21 21:58:09] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2023-03-21 21:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-21 21:58:09] [INFO ] After 3255ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-21 21:58:10] [INFO ] After 4016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 54 ms.
Support contains 105 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 295/295 transitions.
Applied a total of 0 rules in 8 ms. Remains 331 /331 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 331/331 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 295/295 transitions.
Applied a total of 0 rules in 8 ms. Remains 331 /331 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2023-03-21 21:58:10] [INFO ] Invariant cache hit.
[2023-03-21 21:58:10] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-21 21:58:10] [INFO ] Invariant cache hit.
[2023-03-21 21:58:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 21:58:10] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-21 21:58:10] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-21 21:58:10] [INFO ] Invariant cache hit.
[2023-03-21 21:58:11] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 852 ms. Remains : 331/331 places, 295/295 transitions.
Graph (complete) has 748 edges and 331 vertex of which 330 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 12 place count 330 transition count 295
Applied a total of 12 rules in 28 ms. Remains 330 /331 variables (removed 1) and now considering 295/295 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 295 rows 330 cols
[2023-03-21 21:58:11] [INFO ] Computed 90 place invariants in 2 ms
[2023-03-21 21:58:11] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 21:58:11] [INFO ] [Nat]Absence check using 90 positive place invariants in 60 ms returned sat
[2023-03-21 21:58:11] [INFO ] After 233ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 21:58:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 21:58:11] [INFO ] After 238ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2023-03-21 21:58:12] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-21 21:58:13] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 0 ms to minimize.
[2023-03-21 21:58:13] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 0 ms to minimize.
[2023-03-21 21:58:13] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2023-03-21 21:58:13] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 0 ms to minimize.
[2023-03-21 21:58:13] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2023-03-21 21:58:13] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1606 ms
[2023-03-21 21:58:13] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-21 21:58:13] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 0 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 1 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1048 ms
[2023-03-21 21:58:14] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 0 ms to minimize.
[2023-03-21 21:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-21 21:58:14] [INFO ] After 3220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 276 ms.
[2023-03-21 21:58:15] [INFO ] After 3930ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-21 21:58:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2023-03-21 21:58:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 331 places, 295 transitions and 1020 arcs took 4 ms.
[2023-03-21 21:58:15] [INFO ] Flatten gal took : 58 ms
Total runtime 47918 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1035/inv_0_ --invariant=/tmp/1035/inv_1_ --invariant=/tmp/1035/inv_2_ --invariant=/tmp/1035/inv_3_ --inv-par
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679435905886

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

+ 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//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name ShieldIIPt-PT-010B-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/1035/inv_0_
rfs formula name ShieldIIPt-PT-010B-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/1035/inv_1_
rfs formula name ShieldIIPt-PT-010B-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/1035/inv_2_
rfs formula name ShieldIIPt-PT-010B-ReachabilityFireability-15
rfs formula type EF
rfs formula formula --invariant=/tmp/1035/inv_3_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 331 places, 295 transitions and 1020 arcs
pnml2lts-sym: Petri net ShieldIIPt_PT_010B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 295->263 groups
pnml2lts-sym: Regrouping took 0.040 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 331; there are 263 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/1035/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/1035/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 577878 group checks and 0 next state calls
pnml2lts-sym: reachability took 9.300 real 37.170 user 0.000 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.080 user 0.000 sys
pnml2lts-sym: state space has 1.66615817667656e+40 states, 47881 nodes
pnml2lts-sym: group_next: 2359 nodes total
pnml2lts-sym: group_explored: 2563 nodes, 25651 short vectors total
pnml2lts-sym: max token count: 1

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="ShieldIIPt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPt-PT-010B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716800271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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