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.r395-oct2-167903719000654.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 smartxred
Input is ShieldPPPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719000654
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 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.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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 ShieldPPPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679576645813

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:04:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 13:04:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:04:08] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2023-03-23 13:04:08] [INFO ] Transformed 2343 places.
[2023-03-23 13:04:08] [INFO ] Transformed 2133 transitions.
[2023-03-23 13:04:08] [INFO ] Found NUPN structural information;
[2023-03-23 13:04:08] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 458 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 14) seen :6
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-23 13:04:09] [INFO ] Computed 331 place invariants in 24 ms
[2023-03-23 13:04:10] [INFO ] After 912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 13:04:11] [INFO ] [Nat]Absence check using 331 positive place invariants in 135 ms returned sat
[2023-03-23 13:04:14] [INFO ] After 2393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 13:04:15] [INFO ] Deduced a trap composed of 36 places in 1004 ms of which 35 ms to minimize.
[2023-03-23 13:04:16] [INFO ] Deduced a trap composed of 17 places in 786 ms of which 1 ms to minimize.
[2023-03-23 13:04:17] [INFO ] Deduced a trap composed of 21 places in 657 ms of which 1 ms to minimize.
[2023-03-23 13:04:18] [INFO ] Deduced a trap composed of 22 places in 761 ms of which 4 ms to minimize.
[2023-03-23 13:04:18] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 2 ms to minimize.
[2023-03-23 13:04:19] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 1 ms to minimize.
[2023-03-23 13:04:19] [INFO ] Deduced a trap composed of 28 places in 506 ms of which 14 ms to minimize.
[2023-03-23 13:04:20] [INFO ] Deduced a trap composed of 21 places in 412 ms of which 1 ms to minimize.
[2023-03-23 13:04:20] [INFO ] Deduced a trap composed of 22 places in 453 ms of which 2 ms to minimize.
[2023-03-23 13:04:21] [INFO ] Deduced a trap composed of 23 places in 466 ms of which 2 ms to minimize.
[2023-03-23 13:04:21] [INFO ] Deduced a trap composed of 26 places in 457 ms of which 1 ms to minimize.
[2023-03-23 13:04:22] [INFO ] Deduced a trap composed of 19 places in 407 ms of which 1 ms to minimize.
[2023-03-23 13:04:22] [INFO ] Deduced a trap composed of 25 places in 459 ms of which 1 ms to minimize.
[2023-03-23 13:04:23] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 1 ms to minimize.
[2023-03-23 13:04:23] [INFO ] Deduced a trap composed of 20 places in 441 ms of which 2 ms to minimize.
[2023-03-23 13:04:24] [INFO ] Deduced a trap composed of 23 places in 473 ms of which 1 ms to minimize.
[2023-03-23 13:04:24] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 1 ms to minimize.
[2023-03-23 13:04:25] [INFO ] Deduced a trap composed of 17 places in 507 ms of which 1 ms to minimize.
[2023-03-23 13:04:26] [INFO ] Deduced a trap composed of 21 places in 432 ms of which 2 ms to minimize.
[2023-03-23 13:04:26] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 1 ms to minimize.
[2023-03-23 13:04:27] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 1 ms to minimize.
[2023-03-23 13:04:27] [INFO ] Deduced a trap composed of 32 places in 403 ms of which 1 ms to minimize.
[2023-03-23 13:04:27] [INFO ] Deduced a trap composed of 24 places in 349 ms of which 1 ms to minimize.
[2023-03-23 13:04:28] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 1 ms to minimize.
[2023-03-23 13:04:28] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 0 ms to minimize.
[2023-03-23 13:04:29] [INFO ] Deduced a trap composed of 29 places in 338 ms of which 1 ms to minimize.
[2023-03-23 13:04:29] [INFO ] Deduced a trap composed of 26 places in 422 ms of which 1 ms to minimize.
[2023-03-23 13:04:30] [INFO ] Deduced a trap composed of 27 places in 323 ms of which 0 ms to minimize.
[2023-03-23 13:04:30] [INFO ] Deduced a trap composed of 38 places in 334 ms of which 13 ms to minimize.
[2023-03-23 13:04:31] [INFO ] Deduced a trap composed of 36 places in 478 ms of which 1 ms to minimize.
[2023-03-23 13:04:31] [INFO ] Deduced a trap composed of 31 places in 503 ms of which 1 ms to minimize.
[2023-03-23 13:04:32] [INFO ] Deduced a trap composed of 46 places in 417 ms of which 1 ms to minimize.
[2023-03-23 13:04:32] [INFO ] Deduced a trap composed of 52 places in 426 ms of which 1 ms to minimize.
[2023-03-23 13:04:33] [INFO ] Deduced a trap composed of 40 places in 325 ms of which 16 ms to minimize.
[2023-03-23 13:04:33] [INFO ] Deduced a trap composed of 34 places in 336 ms of which 1 ms to minimize.
[2023-03-23 13:04:33] [INFO ] Deduced a trap composed of 35 places in 351 ms of which 1 ms to minimize.
[2023-03-23 13:04:34] [INFO ] Deduced a trap composed of 47 places in 323 ms of which 1 ms to minimize.
[2023-03-23 13:04:34] [INFO ] Deduced a trap composed of 46 places in 351 ms of which 1 ms to minimize.
[2023-03-23 13:04:35] [INFO ] Deduced a trap composed of 40 places in 390 ms of which 1 ms to minimize.
[2023-03-23 13:04:35] [INFO ] Deduced a trap composed of 38 places in 331 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.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-23 13:04:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:04:35] [INFO ] After 25253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 395 ms.
Support contains 34 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 2343 transition count 1581
Reduce places removed 552 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 554 rules applied. Total rules applied 1106 place count 1791 transition count 1579
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 1114 place count 1790 transition count 1572
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1121 place count 1783 transition count 1572
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 119 Pre rules applied. Total rules applied 1121 place count 1783 transition count 1453
Deduced a syphon composed of 119 places in 2 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1359 place count 1664 transition count 1453
Discarding 203 places :
Symmetric choice reduction at 4 with 203 rule applications. Total rules 1562 place count 1461 transition count 1250
Iterating global reduction 4 with 203 rules applied. Total rules applied 1765 place count 1461 transition count 1250
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 84 Pre rules applied. Total rules applied 1765 place count 1461 transition count 1166
Deduced a syphon composed of 84 places in 13 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 1933 place count 1377 transition count 1166
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 1 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 4 with 994 rules applied. Total rules applied 2927 place count 880 transition count 669
Renaming transitions due to excessive name length > 1024 char.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 3095 place count 796 transition count 669
Partial Free-agglomeration rule applied 85 times.
Drop transitions removed 85 transitions
Iterating global reduction 4 with 85 rules applied. Total rules applied 3180 place count 796 transition count 669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3181 place count 795 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3182 place count 794 transition count 668
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3182 place count 794 transition count 666
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3186 place count 792 transition count 666
Applied a total of 3186 rules in 708 ms. Remains 792 /2343 variables (removed 1551) and now considering 666/2133 (removed 1467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 708 ms. Remains : 792/2343 places, 666/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=37 ) properties (out of 8) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 666 rows 792 cols
[2023-03-23 13:04:37] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-23 13:04:37] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 13:04:37] [INFO ] [Nat]Absence check using 330 positive place invariants in 136 ms returned sat
[2023-03-23 13:04:38] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 13:04:38] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-23 13:04:39] [INFO ] After 621ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 13:04:39] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-23 13:04:39] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2023-03-23 13:04:39] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 13 ms to minimize.
[2023-03-23 13:04:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 420 ms
[2023-03-23 13:04:40] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2023-03-23 13:04:40] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2023-03-23 13:04:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 522 ms
[2023-03-23 13:04:40] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2023-03-23 13:04:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-23 13:04:41] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-23 13:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2023-03-23 13:04:41] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-23 13:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-03-23 13:04:41] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-23 13:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-03-23 13:04:41] [INFO ] After 2865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 420 ms.
[2023-03-23 13:04:42] [INFO ] After 4479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 99 ms.
Support contains 32 out of 792 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 792/792 places, 666/666 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 792 transition count 665
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 791 transition count 665
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 790 transition count 664
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 789 transition count 664
Applied a total of 6 rules in 104 ms. Remains 789 /792 variables (removed 3) and now considering 664/666 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 789/792 places, 664/666 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 140269 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140269 steps, saw 90772 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 664 rows 789 cols
[2023-03-23 13:04:45] [INFO ] Computed 330 place invariants in 2 ms
[2023-03-23 13:04:46] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 13:04:46] [INFO ] [Nat]Absence check using 330 positive place invariants in 61 ms returned sat
[2023-03-23 13:04:47] [INFO ] After 586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 13:04:47] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-23 13:04:47] [INFO ] After 625ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 13:04:48] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 13 ms to minimize.
[2023-03-23 13:04:48] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-23 13:04:48] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-23 13:04:48] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 0 ms to minimize.
[2023-03-23 13:04:48] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2023-03-23 13:04:48] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2023-03-23 13:04:48] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-23 13:04:48] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 876 ms
[2023-03-23 13:04:49] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2023-03-23 13:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-03-23 13:04:49] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-23 13:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-03-23 13:04:49] [INFO ] After 2524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 620 ms.
[2023-03-23 13:04:50] [INFO ] After 4181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 207 ms.
Support contains 32 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 664/664 transitions.
Applied a total of 0 rules in 22 ms. Remains 789 /789 variables (removed 0) and now considering 664/664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 789/789 places, 664/664 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 664/664 transitions.
Applied a total of 0 rules in 21 ms. Remains 789 /789 variables (removed 0) and now considering 664/664 (removed 0) transitions.
[2023-03-23 13:04:50] [INFO ] Invariant cache hit.
[2023-03-23 13:04:51] [INFO ] Implicit Places using invariants in 468 ms returned [771, 775]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 471 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 787/789 places, 664/664 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 785 transition count 662
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 785 transition count 662
Applied a total of 4 rules in 63 ms. Remains 785 /787 variables (removed 2) and now considering 662/664 (removed 2) transitions.
// Phase 1: matrix 662 rows 785 cols
[2023-03-23 13:04:51] [INFO ] Computed 328 place invariants in 3 ms
[2023-03-23 13:04:51] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-23 13:04:51] [INFO ] Invariant cache hit.
[2023-03-23 13:04:51] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-23 13:04:53] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2465 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 785/789 places, 662/664 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3020 ms. Remains : 785/789 places, 662/664 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 152850 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152850 steps, saw 95465 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-23 13:04:57] [INFO ] Invariant cache hit.
[2023-03-23 13:04:57] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 13:04:57] [INFO ] [Nat]Absence check using 328 positive place invariants in 110 ms returned sat
[2023-03-23 13:04:58] [INFO ] After 672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 13:04:58] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-23 13:04:59] [INFO ] After 664ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 13:04:59] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2023-03-23 13:04:59] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2023-03-23 13:04:59] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-23 13:04:59] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 13 ms to minimize.
[2023-03-23 13:05:00] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-23 13:05:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 867 ms
[2023-03-23 13:05:00] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 13 ms to minimize.
[2023-03-23 13:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-23 13:05:00] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2023-03-23 13:05:01] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-03-23 13:05:01] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 13 ms to minimize.
[2023-03-23 13:05:01] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2023-03-23 13:05:01] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-23 13:05:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 757 ms
[2023-03-23 13:05:01] [INFO ] After 3070ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 625 ms.
[2023-03-23 13:05:02] [INFO ] After 4853ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 209 ms.
Support contains 32 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 662/662 transitions.
Applied a total of 0 rules in 27 ms. Remains 785 /785 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 785/785 places, 662/662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 662/662 transitions.
Applied a total of 0 rules in 15 ms. Remains 785 /785 variables (removed 0) and now considering 662/662 (removed 0) transitions.
[2023-03-23 13:05:02] [INFO ] Invariant cache hit.
[2023-03-23 13:05:03] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-23 13:05:03] [INFO ] Invariant cache hit.
[2023-03-23 13:05:03] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-23 13:05:05] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
[2023-03-23 13:05:05] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-23 13:05:05] [INFO ] Invariant cache hit.
[2023-03-23 13:05:05] [INFO ] Dead Transitions using invariants and state equation in 363 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3080 ms. Remains : 785/785 places, 662/662 transitions.
Partial Free-agglomeration rule applied 178 times.
Drop transitions removed 178 transitions
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 785 transition count 662
Applied a total of 178 rules in 40 ms. Remains 785 /785 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 662 rows 785 cols
[2023-03-23 13:05:05] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-23 13:05:05] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 13:05:06] [INFO ] [Nat]Absence check using 328 positive place invariants in 104 ms returned sat
[2023-03-23 13:05:07] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 13:05:07] [INFO ] State equation strengthened by 162 read => feed constraints.
[2023-03-23 13:05:08] [INFO ] After 1409ms SMT Verify possible using 162 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 13:05:08] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
[2023-03-23 13:05:09] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2023-03-23 13:05:09] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-23 13:05:09] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 0 ms to minimize.
[2023-03-23 13:05:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 971 ms
[2023-03-23 13:05:10] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 1 ms to minimize.
[2023-03-23 13:05:10] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-23 13:05:10] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2023-03-23 13:05:11] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-23 13:05:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 860 ms
[2023-03-23 13:05:11] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-23 13:05:11] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-23 13:05:11] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2023-03-23 13:05:12] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-23 13:05:12] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 0 ms to minimize.
[2023-03-23 13:05:12] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2023-03-23 13:05:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1191 ms
[2023-03-23 13:05:12] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2023-03-23 13:05:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-23 13:05:12] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2023-03-23 13:05:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-23 13:05:13] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-23 13:05:13] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-23 13:05:13] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-23 13:05:13] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-23 13:05:13] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 793 ms
[2023-03-23 13:05:13] [INFO ] After 6843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1850 ms.
[2023-03-23 13:05:15] [INFO ] After 9909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-23 13:05:15] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-23 13:05:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 785 places, 662 transitions and 2984 arcs took 3 ms.
[2023-03-23 13:05:16] [INFO ] Flatten gal took : 146 ms
Total runtime 68080 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 030B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 785 places, 662 transitions, 2984 arcs.
Final Score: 47164.006
Took : 27 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-030B-ReachabilityCardinality-02 (reachable &!potential( ( ( ( (tk(P473)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P473)) ) ) | ( ( (tk(P618)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P618)) ) ) )))
PROPERTY: ShieldPPPt-PT-030B-ReachabilityCardinality-03 (reachable &!potential( ( ( (tk(P134)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P134)) ) )))
PROPERTY: ShieldPPPt-PT-030B-ReachabilityCardinality-04 (reachable & potential(( ( ( (tk(P171)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P171)) ) ) & ( ( ( (tk(P315)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P315)) ) ) & ( ( ( (tk(P257)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P257)) ) ) | ( ( ( ( (tk(P126)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P126)) ) ) & ( ( (tk(P781)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P781)) ) ) ) | ( ( ( (tk(P231)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P231)) ) ) & ( ( ( (tk(P614)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P614)) ) ) | ( ( (tk(P158)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P158)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-030B-ReachabilityCardinality-06 (reachable & potential(( ( ( ( (tk(P287)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P287)) ) ) & ( ( (tk(P429)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P429)) ) ) ) & ( ( ( ( (tk(P530)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P530)) ) ) | ( ( ( (tk(P329)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P329)) ) ) & ( ( (tk(P159)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P159)) ) ) ) ) & ( ( ( ( (tk(P596)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P596)) ) ) | ( ( (tk(P292)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P292)) ) ) ) & ( ( ( ( (tk(P765)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P765)) ) ) | ( ( (tk(P318)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P318)) ) ) ) | ( ( ( ( (tk(P544)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P544)) ) ) & ( ( ( (tk(P554)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P554)) ) ) & ( ( ( (tk(P283)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P283)) ) ) | ( ( (tk(P514)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P514)) ) ) ) ) ) | ( ( ( ( (tk(P534)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P534)) ) ) & ( ( (tk(P209)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P209)) ) ) ) & ( ( ( (tk(P343)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P343)) ) ) & ( ( (tk(P79)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P79)) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-030B-ReachabilityCardinality-08 (reachable & potential(( ( (tk(P337)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P337)) ) )))
PROPERTY: ShieldPPPt-PT-030B-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P118)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P118)) ) ) | ( ( (tk(P679)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P679)) ) ) )))
PROPERTY: ShieldPPPt-PT-030B-ReachabilityCardinality-12 (reachable & potential(( ( (tk(P350)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P350)) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3879600 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16101028 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="ShieldPPPt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldPPPt-PT-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-oct2-167903719000654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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