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-167903716600123.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 ShieldIIPs-PT-030B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716600123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 16:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 25 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679424582057

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 18:49:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 18:49:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 18:49:44] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-21 18:49:44] [INFO ] Transformed 1803 places.
[2023-03-21 18:49:44] [INFO ] Transformed 1773 transitions.
[2023-03-21 18:49:44] [INFO ] Found NUPN structural information;
[2023-03-21 18:49:44] [INFO ] Parsed PT model containing 1803 places and 1773 transitions and 5346 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-030B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1803/1803 places, 1773/1773 transitions.
Discarding 202 places :
Symmetric choice reduction at 0 with 202 rule applications. Total rules 202 place count 1601 transition count 1571
Iterating global reduction 0 with 202 rules applied. Total rules applied 404 place count 1601 transition count 1571
Applied a total of 404 rules in 317 ms. Remains 1601 /1803 variables (removed 202) and now considering 1571/1773 (removed 202) transitions.
// Phase 1: matrix 1571 rows 1601 cols
[2023-03-21 18:49:45] [INFO ] Computed 271 place invariants in 32 ms
[2023-03-21 18:49:46] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-21 18:49:46] [INFO ] Invariant cache hit.
[2023-03-21 18:49:48] [INFO ] Implicit Places using invariants and state equation in 2008 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
[2023-03-21 18:49:48] [INFO ] Invariant cache hit.
[2023-03-21 18:49:49] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1601/1803 places, 1571/1773 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4422 ms. Remains : 1601/1803 places, 1571/1773 transitions.
Support contains 30 out of 1601 places after structural reductions.
[2023-03-21 18:49:49] [INFO ] Flatten gal took : 164 ms
[2023-03-21 18:49:49] [INFO ] Flatten gal took : 73 ms
[2023-03-21 18:49:49] [INFO ] Input system was already deterministic with 1571 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 18:49:50] [INFO ] Invariant cache hit.
[2023-03-21 18:49:50] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 18:49:50] [INFO ] [Nat]Absence check using 271 positive place invariants in 81 ms returned sat
[2023-03-21 18:49:51] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 18:49:52] [INFO ] Deduced a trap composed of 26 places in 488 ms of which 32 ms to minimize.
[2023-03-21 18:49:52] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 1 ms to minimize.
[2023-03-21 18:49:53] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 1 ms to minimize.
[2023-03-21 18:49:53] [INFO ] Deduced a trap composed of 10 places in 541 ms of which 1 ms to minimize.
[2023-03-21 18:49:54] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 4 ms to minimize.
[2023-03-21 18:49:54] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 3 ms to minimize.
[2023-03-21 18:49:54] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 1 ms to minimize.
[2023-03-21 18:49:55] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 1 ms to minimize.
[2023-03-21 18:49:55] [INFO ] Deduced a trap composed of 36 places in 319 ms of which 0 ms to minimize.
[2023-03-21 18:49:55] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 1 ms to minimize.
[2023-03-21 18:49:56] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 1 ms to minimize.
[2023-03-21 18:49:56] [INFO ] Deduced a trap composed of 30 places in 312 ms of which 1 ms to minimize.
[2023-03-21 18:49:57] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 1 ms to minimize.
[2023-03-21 18:49:57] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 13 ms to minimize.
[2023-03-21 18:49:57] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 0 ms to minimize.
[2023-03-21 18:49:58] [INFO ] Deduced a trap composed of 20 places in 349 ms of which 1 ms to minimize.
[2023-03-21 18:49:58] [INFO ] Deduced a trap composed of 23 places in 346 ms of which 0 ms to minimize.
[2023-03-21 18:49:58] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 1 ms to minimize.
[2023-03-21 18:49:59] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 1 ms to minimize.
[2023-03-21 18:49:59] [INFO ] Deduced a trap composed of 14 places in 311 ms of which 1 ms to minimize.
[2023-03-21 18:50:00] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 1 ms to minimize.
[2023-03-21 18:50:00] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 1 ms to minimize.
[2023-03-21 18:50:00] [INFO ] Deduced a trap composed of 27 places in 311 ms of which 1 ms to minimize.
[2023-03-21 18:50:01] [INFO ] Deduced a trap composed of 41 places in 335 ms of which 1 ms to minimize.
[2023-03-21 18:50:01] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 1 ms to minimize.
[2023-03-21 18:50:01] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 1 ms to minimize.
[2023-03-21 18:50:02] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 1 ms to minimize.
[2023-03-21 18:50:02] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 1 ms to minimize.
[2023-03-21 18:50:02] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 1 ms to minimize.
[2023-03-21 18:50:03] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 1 ms to minimize.
[2023-03-21 18:50:03] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 13 ms to minimize.
[2023-03-21 18:50:03] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 2 ms to minimize.
[2023-03-21 18:50:04] [INFO ] Deduced a trap composed of 38 places in 309 ms of which 0 ms to minimize.
[2023-03-21 18:50:04] [INFO ] Deduced a trap composed of 38 places in 277 ms of which 0 ms to minimize.
[2023-03-21 18:50:04] [INFO ] Deduced a trap composed of 34 places in 251 ms of which 0 ms to minimize.
[2023-03-21 18:50:05] [INFO ] Deduced a trap composed of 22 places in 321 ms of which 1 ms to minimize.
[2023-03-21 18:50:05] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 1 ms to minimize.
[2023-03-21 18:50:05] [INFO ] Deduced a trap composed of 35 places in 336 ms of which 0 ms to minimize.
[2023-03-21 18:50:06] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 1 ms to minimize.
[2023-03-21 18:50:06] [INFO ] Deduced a trap composed of 43 places in 314 ms of which 1 ms to minimize.
[2023-03-21 18:50:06] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 1 ms to minimize.
[2023-03-21 18:50:07] [INFO ] Deduced a trap composed of 41 places in 298 ms of which 1 ms to minimize.
[2023-03-21 18:50:07] [INFO ] Deduced a trap composed of 43 places in 292 ms of which 4 ms to minimize.
[2023-03-21 18:50:07] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 1 ms to minimize.
[2023-03-21 18:50:08] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 1 ms to minimize.
[2023-03-21 18:50:08] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 1 ms to minimize.
[2023-03-21 18:50:08] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 1 ms to minimize.
[2023-03-21 18:50:09] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 1 ms to minimize.
[2023-03-21 18:50:09] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 1 ms to minimize.
[2023-03-21 18:50:09] [INFO ] Deduced a trap composed of 27 places in 316 ms of which 0 ms to minimize.
[2023-03-21 18:50:10] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 13 ms to minimize.
[2023-03-21 18:50:10] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 0 ms to minimize.
[2023-03-21 18:50:10] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 0 ms to minimize.
[2023-03-21 18:50:11] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 2 ms to minimize.
[2023-03-21 18:50:11] [INFO ] Deduced a trap composed of 41 places in 237 ms of which 0 ms to minimize.
[2023-03-21 18:50:11] [INFO ] Deduced a trap composed of 41 places in 262 ms of which 13 ms to minimize.
[2023-03-21 18:50:12] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 1 ms to minimize.
[2023-03-21 18:50:12] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 0 ms to minimize.
[2023-03-21 18:50:12] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2023-03-21 18:50:12] [INFO ] Deduced a trap composed of 37 places in 304 ms of which 1 ms to minimize.
[2023-03-21 18:50:13] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 1 ms to minimize.
[2023-03-21 18:50:13] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 1 ms to minimize.
[2023-03-21 18:50:13] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 2 ms to minimize.
[2023-03-21 18:50:14] [INFO ] Deduced a trap composed of 32 places in 335 ms of which 0 ms to minimize.
[2023-03-21 18:50:14] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 1 ms to minimize.
[2023-03-21 18:50:14] [INFO ] Deduced a trap composed of 41 places in 227 ms of which 1 ms to minimize.
[2023-03-21 18:50:15] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 7 ms to minimize.
[2023-03-21 18:50:15] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 1 ms to minimize.
[2023-03-21 18:50:15] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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 18:50:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 18:50:15] [INFO ] After 25198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 74 ms.
Support contains 4 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 1571/1571 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1601 transition count 1420
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1450 transition count 1420
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 302 place count 1450 transition count 1269
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 604 place count 1299 transition count 1269
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 611 place count 1292 transition count 1262
Iterating global reduction 2 with 7 rules applied. Total rules applied 618 place count 1292 transition count 1262
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 618 place count 1292 transition count 1257
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 628 place count 1287 transition count 1257
Performed 531 Post agglomeration using F-continuation condition.Transition count delta: 531
Deduced a syphon composed of 531 places in 2 ms
Reduce places removed 531 places and 0 transitions.
Iterating global reduction 2 with 1062 rules applied. Total rules applied 1690 place count 756 transition count 726
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 206 times.
Drop transitions removed 206 transitions
Iterating global reduction 2 with 206 rules applied. Total rules applied 1896 place count 756 transition count 726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1897 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1898 place count 754 transition count 725
Applied a total of 1898 rules in 524 ms. Remains 754 /1601 variables (removed 847) and now considering 725/1571 (removed 846) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 754/1601 places, 725/1571 transitions.
Finished random walk after 526 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=75 )
Computed a total of 367 stabilizing places and 367 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||(p2 U p3)))))'
Support contains 5 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 1571/1571 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1593 transition count 1563
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1593 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1592 transition count 1562
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1592 transition count 1562
Applied a total of 18 rules in 173 ms. Remains 1592 /1601 variables (removed 9) and now considering 1562/1571 (removed 9) transitions.
// Phase 1: matrix 1562 rows 1592 cols
[2023-03-21 18:50:16] [INFO ] Computed 271 place invariants in 8 ms
[2023-03-21 18:50:17] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-21 18:50:17] [INFO ] Invariant cache hit.
[2023-03-21 18:50:19] [INFO ] Implicit Places using invariants and state equation in 2154 ms returned []
Implicit Place search using SMT with State Equation took 2818 ms to find 0 implicit places.
[2023-03-21 18:50:19] [INFO ] Invariant cache hit.
[2023-03-21 18:50:21] [INFO ] Dead Transitions using invariants and state equation in 1265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1592/1601 places, 1562/1571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4256 ms. Remains : 1592/1601 places, 1562/1571 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p0)), true, (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p3), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p3) (NOT p2))), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (EQ s930 0) (EQ s1307 1)), p1:(EQ s196 0), p3:(OR (EQ s590 0) (EQ s1311 1)), p2:(EQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8723 steps with 2 reset in 104 ms.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-00 finished in 4845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)||p0))&&(F(p3)||p2))))'
Support contains 7 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 1571/1571 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1595 transition count 1565
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1595 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1594 transition count 1564
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1594 transition count 1564
Applied a total of 14 rules in 210 ms. Remains 1594 /1601 variables (removed 7) and now considering 1564/1571 (removed 7) transitions.
// Phase 1: matrix 1564 rows 1594 cols
[2023-03-21 18:50:21] [INFO ] Computed 271 place invariants in 7 ms
[2023-03-21 18:50:22] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-21 18:50:22] [INFO ] Invariant cache hit.
[2023-03-21 18:50:23] [INFO ] Implicit Places using invariants and state equation in 1772 ms returned []
Implicit Place search using SMT with State Equation took 2262 ms to find 0 implicit places.
[2023-03-21 18:50:24] [INFO ] Invariant cache hit.
[2023-03-21 18:50:24] [INFO ] Dead Transitions using invariants and state equation in 872 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1594/1601 places, 1564/1571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3347 ms. Remains : 1594/1601 places, 1564/1571 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p3), true, (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s90 0) (EQ s686 1)), p3:(EQ s691 0), p0:(OR (EQ s1282 0) (EQ s1187 1)), p1:(OR (EQ s1353 0) (EQ s1013 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 739 ms.
Product exploration explored 100000 steps with 33333 reset in 708 ms.
Computed a total of 361 stabilizing places and 361 stable transitions
Computed a total of 361 stabilizing places and 361 stable transitions
Knowledge obtained : [(AND p2 p3 p0 p1), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-030B-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-04 finished in 5282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((F(p1)&&p0))&&G(p2))))'
Support contains 6 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 1571/1571 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1594 transition count 1564
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1594 transition count 1564
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1593 transition count 1563
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1593 transition count 1563
Applied a total of 16 rules in 172 ms. Remains 1593 /1601 variables (removed 8) and now considering 1563/1571 (removed 8) transitions.
// Phase 1: matrix 1563 rows 1593 cols
[2023-03-21 18:50:26] [INFO ] Computed 271 place invariants in 5 ms
[2023-03-21 18:50:27] [INFO ] Implicit Places using invariants in 504 ms returned []
[2023-03-21 18:50:27] [INFO ] Invariant cache hit.
[2023-03-21 18:50:29] [INFO ] Implicit Places using invariants and state equation in 1944 ms returned []
Implicit Place search using SMT with State Equation took 2464 ms to find 0 implicit places.
[2023-03-21 18:50:29] [INFO ] Invariant cache hit.
[2023-03-21 18:50:30] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1593/1601 places, 1563/1571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3478 ms. Remains : 1593/1601 places, 1563/1571 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1 p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(NOT p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(OR (EQ s255 0) (EQ s787 1)), p1:(OR (EQ s469 0) (EQ s958 1)), p0:(AND (EQ s1533 0) (EQ s785 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32435 steps with 8 reset in 231 ms.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-09 finished in 3906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1601/1601 places, 1571/1571 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 1600 transition count 1422
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 1 with 148 rules applied. Total rules applied 296 place count 1452 transition count 1422
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 296 place count 1452 transition count 1271
Deduced a syphon composed of 151 places in 2 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 598 place count 1301 transition count 1271
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 605 place count 1294 transition count 1264
Iterating global reduction 2 with 7 rules applied. Total rules applied 612 place count 1294 transition count 1264
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 612 place count 1294 transition count 1260
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 620 place count 1290 transition count 1260
Performed 533 Post agglomeration using F-continuation condition.Transition count delta: 533
Deduced a syphon composed of 533 places in 1 ms
Reduce places removed 533 places and 0 transitions.
Iterating global reduction 2 with 1066 rules applied. Total rules applied 1686 place count 757 transition count 727
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1688 place count 755 transition count 725
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1689 place count 754 transition count 725
Applied a total of 1689 rules in 238 ms. Remains 754 /1601 variables (removed 847) and now considering 725/1571 (removed 846) transitions.
// Phase 1: matrix 725 rows 754 cols
[2023-03-21 18:50:30] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:50:31] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-21 18:50:31] [INFO ] Invariant cache hit.
[2023-03-21 18:50:32] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1221 ms to find 0 implicit places.
[2023-03-21 18:50:32] [INFO ] Redundant transitions in 257 ms returned [724]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 724 rows 754 cols
[2023-03-21 18:50:32] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:50:32] [INFO ] Dead Transitions using invariants and state equation in 345 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 754/1601 places, 724/1571 transitions.
Applied a total of 0 rules in 25 ms. Remains 754 /754 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2106 ms. Remains : 754/1601 places, 724/1571 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s739 0) (NEQ s619 1)), p1:(NEQ s203 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 51756 steps with 151 reset in 324 ms.
FORMULA ShieldIIPs-PT-030B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-13 finished in 2622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 1601 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1601/1601 places, 1571/1571 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 151 place count 1600 transition count 1419
Reduce places removed 151 places and 0 transitions.
Iterating post reduction 1 with 151 rules applied. Total rules applied 302 place count 1449 transition count 1419
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 302 place count 1449 transition count 1270
Deduced a syphon composed of 149 places in 2 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 298 rules applied. Total rules applied 600 place count 1300 transition count 1270
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 607 place count 1293 transition count 1263
Iterating global reduction 2 with 7 rules applied. Total rules applied 614 place count 1293 transition count 1263
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 614 place count 1293 transition count 1258
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 624 place count 1288 transition count 1258
Performed 532 Post agglomeration using F-continuation condition.Transition count delta: 532
Deduced a syphon composed of 532 places in 1 ms
Reduce places removed 532 places and 0 transitions.
Iterating global reduction 2 with 1064 rules applied. Total rules applied 1688 place count 756 transition count 726
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1690 place count 754 transition count 724
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1691 place count 753 transition count 724
Applied a total of 1691 rules in 239 ms. Remains 753 /1601 variables (removed 848) and now considering 724/1571 (removed 847) transitions.
// Phase 1: matrix 724 rows 753 cols
[2023-03-21 18:50:33] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:50:33] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-21 18:50:33] [INFO ] Invariant cache hit.
[2023-03-21 18:50:34] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1328 ms to find 0 implicit places.
[2023-03-21 18:50:35] [INFO ] Redundant transitions in 477 ms returned [723]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 723 rows 753 cols
[2023-03-21 18:50:35] [INFO ] Computed 270 place invariants in 2 ms
[2023-03-21 18:50:35] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/1601 places, 723/1571 transitions.
Applied a total of 0 rules in 17 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2443 ms. Remains : 753/1601 places, 723/1571 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s103 0) (EQ s243 1)), p1:(OR (EQ s744 0) (EQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 9148 reset in 612 ms.
Product exploration explored 100000 steps with 9291 reset in 657 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 307 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 356 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 38 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-21 18:50:38] [INFO ] Invariant cache hit.
[2023-03-21 18:50:38] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-21 18:50:38] [INFO ] Invariant cache hit.
[2023-03-21 18:50:39] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1408 ms to find 0 implicit places.
[2023-03-21 18:50:39] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-21 18:50:39] [INFO ] Invariant cache hit.
[2023-03-21 18:50:40] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1890 ms. Remains : 753/753 places, 723/723 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 247 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 375 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 9206 reset in 519 ms.
Product exploration explored 100000 steps with 9241 reset in 635 ms.
Support contains 4 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 723/723 transitions.
Applied a total of 0 rules in 16 ms. Remains 753 /753 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-21 18:50:42] [INFO ] Invariant cache hit.
[2023-03-21 18:50:43] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-21 18:50:43] [INFO ] Invariant cache hit.
[2023-03-21 18:50:43] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 1149 ms to find 0 implicit places.
[2023-03-21 18:50:44] [INFO ] Redundant transitions in 99 ms returned []
[2023-03-21 18:50:44] [INFO ] Invariant cache hit.
[2023-03-21 18:50:44] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1645 ms. Remains : 753/753 places, 723/723 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-14 finished in 11243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(p1)) U (p2&&G(F(p1))))))'
Support contains 6 out of 1601 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1601/1601 places, 1571/1571 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1596 transition count 1566
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1596 transition count 1566
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1595 transition count 1565
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1595 transition count 1565
Applied a total of 12 rules in 194 ms. Remains 1595 /1601 variables (removed 6) and now considering 1565/1571 (removed 6) transitions.
// Phase 1: matrix 1565 rows 1595 cols
[2023-03-21 18:50:44] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-21 18:50:45] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-21 18:50:45] [INFO ] Invariant cache hit.
[2023-03-21 18:50:47] [INFO ] Implicit Places using invariants and state equation in 2123 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2023-03-21 18:50:47] [INFO ] Invariant cache hit.
[2023-03-21 18:50:48] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1595/1601 places, 1565/1571 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3796 ms. Remains : 1595/1601 places, 1565/1571 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s1233 0) (EQ s73 1)), p0:(OR (EQ s483 0) (EQ s389 1)), p1:(OR (EQ s1176 0) (EQ s1292 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 27 reset in 624 ms.
Product exploration explored 100000 steps with 28 reset in 736 ms.
Computed a total of 361 stabilizing places and 361 stable transitions
Computed a total of 361 stabilizing places and 361 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 577 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69579 steps, run visited all 1 properties in 715 ms. (steps per millisecond=97 )
Probabilistic random walk after 69579 steps, saw 65485 distinct states, run finished after 716 ms. (steps per millisecond=97 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) p0)))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 12 factoid took 565 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 1595 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1595/1595 places, 1565/1565 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 1594 transition count 1414
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 1444 transition count 1414
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 150 Pre rules applied. Total rules applied 300 place count 1444 transition count 1264
Deduced a syphon composed of 150 places in 2 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 300 rules applied. Total rules applied 600 place count 1294 transition count 1264
Performed 535 Post agglomeration using F-continuation condition.Transition count delta: 535
Deduced a syphon composed of 535 places in 1 ms
Reduce places removed 535 places and 0 transitions.
Iterating global reduction 2 with 1070 rules applied. Total rules applied 1670 place count 759 transition count 729
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1672 place count 757 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1673 place count 756 transition count 727
Applied a total of 1673 rules in 195 ms. Remains 756 /1595 variables (removed 839) and now considering 727/1565 (removed 838) transitions.
// Phase 1: matrix 727 rows 756 cols
[2023-03-21 18:50:52] [INFO ] Computed 270 place invariants in 1 ms
[2023-03-21 18:50:52] [INFO ] Implicit Places using invariants in 455 ms returned []
[2023-03-21 18:50:52] [INFO ] Invariant cache hit.
[2023-03-21 18:50:53] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2023-03-21 18:50:54] [INFO ] Redundant transitions in 755 ms returned [726]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 726 rows 756 cols
[2023-03-21 18:50:54] [INFO ] Computed 270 place invariants in 15 ms
[2023-03-21 18:50:55] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 756/1595 places, 726/1565 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3085 ms. Remains : 756/1595 places, 726/1565 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Finished random walk after 512 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=128 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 76 reset in 667 ms.
Product exploration explored 100000 steps with 76 reset in 768 ms.
Support contains 2 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 726/726 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 753 transition count 723
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 752 transition count 722
Applied a total of 5 rules in 47 ms. Remains 752 /756 variables (removed 4) and now considering 722/726 (removed 4) transitions.
// Phase 1: matrix 722 rows 752 cols
[2023-03-21 18:50:57] [INFO ] Computed 270 place invariants in 3 ms
[2023-03-21 18:50:57] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-21 18:50:57] [INFO ] Invariant cache hit.
[2023-03-21 18:50:58] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1466 ms to find 0 implicit places.
[2023-03-21 18:50:59] [INFO ] Redundant transitions in 124 ms returned []
[2023-03-21 18:50:59] [INFO ] Invariant cache hit.
[2023-03-21 18:50:59] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/756 places, 722/726 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2054 ms. Remains : 752/756 places, 722/726 transitions.
Treatment of property ShieldIIPs-PT-030B-LTLCardinality-15 finished in 14922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(p1)) U (p2&&G(F(p1))))))'
[2023-03-21 18:50:59] [INFO ] Flatten gal took : 115 ms
[2023-03-21 18:50:59] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 18:50:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1601 places, 1571 transitions and 4942 arcs took 17 ms.
Total runtime 75798 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1305/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1305/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-030B-LTLCardinality-14
Could not compute solution for formula : ShieldIIPs-PT-030B-LTLCardinality-15

BK_STOP 1679424661654

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-030B-LTLCardinality-14
ltl formula formula --ltl=/tmp/1305/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1601 places, 1571 transitions and 4942 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.090 user 0.100 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1305/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1305/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1305/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1305/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-030B-LTLCardinality-15
ltl formula formula --ltl=/tmp/1305/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1601 places, 1571 transitions and 4942 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1305/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.380 real 0.150 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1305/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1305/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1305/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-030B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldIIPs-PT-030B, examination is LTLCardinality"
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-167903716600123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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