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.r394-oct2-167903717500110.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 marciexred
Input is ShieldIIPs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717500110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 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 332K 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-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679490367119

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:06:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 13:06:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:06:10] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-22 13:06:10] [INFO ] Transformed 1203 places.
[2023-03-22 13:06:10] [INFO ] Transformed 1183 transitions.
[2023-03-22 13:06:10] [INFO ] Found NUPN structural information;
[2023-03-22 13:06:10] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 15) seen :11
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2023-03-22 13:06:10] [INFO ] Computed 181 place invariants in 17 ms
[2023-03-22 13:06:11] [INFO ] After 762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 13:06:12] [INFO ] [Nat]Absence check using 181 positive place invariants in 85 ms returned sat
[2023-03-22 13:06:13] [INFO ] After 1185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 13:06:14] [INFO ] Deduced a trap composed of 30 places in 1006 ms of which 21 ms to minimize.
[2023-03-22 13:06:15] [INFO ] Deduced a trap composed of 22 places in 454 ms of which 1 ms to minimize.
[2023-03-22 13:06:15] [INFO ] Deduced a trap composed of 22 places in 630 ms of which 2 ms to minimize.
[2023-03-22 13:06:16] [INFO ] Deduced a trap composed of 26 places in 618 ms of which 13 ms to minimize.
[2023-03-22 13:06:17] [INFO ] Deduced a trap composed of 38 places in 698 ms of which 1 ms to minimize.
[2023-03-22 13:06:17] [INFO ] Deduced a trap composed of 35 places in 470 ms of which 1 ms to minimize.
[2023-03-22 13:06:18] [INFO ] Deduced a trap composed of 25 places in 418 ms of which 6 ms to minimize.
[2023-03-22 13:06:18] [INFO ] Deduced a trap composed of 37 places in 417 ms of which 1 ms to minimize.
[2023-03-22 13:06:19] [INFO ] Deduced a trap composed of 32 places in 405 ms of which 0 ms to minimize.
[2023-03-22 13:06:19] [INFO ] Deduced a trap composed of 19 places in 344 ms of which 1 ms to minimize.
[2023-03-22 13:06:20] [INFO ] Deduced a trap composed of 31 places in 538 ms of which 1 ms to minimize.
[2023-03-22 13:06:20] [INFO ] Deduced a trap composed of 20 places in 478 ms of which 1 ms to minimize.
[2023-03-22 13:06:21] [INFO ] Deduced a trap composed of 42 places in 436 ms of which 1 ms to minimize.
[2023-03-22 13:06:21] [INFO ] Deduced a trap composed of 23 places in 586 ms of which 2 ms to minimize.
[2023-03-22 13:06:22] [INFO ] Deduced a trap composed of 29 places in 464 ms of which 2 ms to minimize.
[2023-03-22 13:06:22] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2023-03-22 13:06:23] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 1 ms to minimize.
[2023-03-22 13:06:23] [INFO ] Deduced a trap composed of 30 places in 325 ms of which 1 ms to minimize.
[2023-03-22 13:06:24] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 1 ms to minimize.
[2023-03-22 13:06:24] [INFO ] Deduced a trap composed of 10 places in 421 ms of which 1 ms to minimize.
[2023-03-22 13:06:24] [INFO ] Deduced a trap composed of 17 places in 271 ms of which 0 ms to minimize.
[2023-03-22 13:06:25] [INFO ] Deduced a trap composed of 14 places in 436 ms of which 1 ms to minimize.
[2023-03-22 13:06:25] [INFO ] Deduced a trap composed of 29 places in 319 ms of which 1 ms to minimize.
[2023-03-22 13:06:26] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 1 ms to minimize.
[2023-03-22 13:06:26] [INFO ] Deduced a trap composed of 21 places in 352 ms of which 0 ms to minimize.
[2023-03-22 13:06:27] [INFO ] Deduced a trap composed of 15 places in 292 ms of which 0 ms to minimize.
[2023-03-22 13:06:27] [INFO ] Deduced a trap composed of 28 places in 318 ms of which 1 ms to minimize.
[2023-03-22 13:06:28] [INFO ] Deduced a trap composed of 25 places in 499 ms of which 1 ms to minimize.
[2023-03-22 13:06:28] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 1 ms to minimize.
[2023-03-22 13:06:28] [INFO ] Deduced a trap composed of 19 places in 323 ms of which 1 ms to minimize.
[2023-03-22 13:06:29] [INFO ] Deduced a trap composed of 22 places in 421 ms of which 4 ms to minimize.
[2023-03-22 13:06:29] [INFO ] Deduced a trap composed of 19 places in 268 ms of which 1 ms to minimize.
[2023-03-22 13:06:30] [INFO ] Deduced a trap composed of 26 places in 462 ms of which 1 ms to minimize.
[2023-03-22 13:06:30] [INFO ] Deduced a trap composed of 24 places in 486 ms of which 0 ms to minimize.
[2023-03-22 13:06:31] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 3 ms to minimize.
[2023-03-22 13:06:31] [INFO ] Deduced a trap composed of 24 places in 351 ms of which 2 ms to minimize.
[2023-03-22 13:06:32] [INFO ] Deduced a trap composed of 28 places in 465 ms of which 0 ms to minimize.
[2023-03-22 13:06:32] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 1 ms to minimize.
[2023-03-22 13:06:32] [INFO ] Deduced a trap composed of 33 places in 314 ms of which 0 ms to minimize.
[2023-03-22 13:06:33] [INFO ] Deduced a trap composed of 32 places in 476 ms of which 13 ms to minimize.
[2023-03-22 13:06:33] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 1 ms to minimize.
[2023-03-22 13:06:33] [INFO ] Deduced a trap composed of 26 places in 283 ms of which 0 ms to minimize.
[2023-03-22 13:06:34] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 23 ms to minimize.
[2023-03-22 13:06:34] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 0 ms to minimize.
[2023-03-22 13:06:35] [INFO ] Deduced a trap composed of 32 places in 328 ms of which 1 ms to minimize.
[2023-03-22 13:06:35] [INFO ] Deduced a trap composed of 31 places in 250 ms of which 0 ms to minimize.
[2023-03-22 13:06:35] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 1 ms to minimize.
[2023-03-22 13:06:36] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 1 ms to minimize.
[2023-03-22 13:06:36] [INFO ] Deduced a trap composed of 36 places in 347 ms of which 1 ms to minimize.
[2023-03-22 13:06:36] [INFO ] Deduced a trap composed of 31 places in 226 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-22 13:06:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 13:06:36] [INFO ] After 25102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 127 ms.
Support contains 23 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 1203 transition count 1087
Reduce places removed 96 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 98 rules applied. Total rules applied 194 place count 1107 transition count 1085
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 196 place count 1105 transition count 1085
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 196 place count 1105 transition count 984
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 398 place count 1004 transition count 984
Discarding 132 places :
Symmetric choice reduction at 3 with 132 rule applications. Total rules 530 place count 872 transition count 852
Iterating global reduction 3 with 132 rules applied. Total rules applied 662 place count 872 transition count 852
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 662 place count 872 transition count 800
Deduced a syphon composed of 52 places in 3 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 766 place count 820 transition count 800
Performed 292 Post agglomeration using F-continuation condition.Transition count delta: 292
Deduced a syphon composed of 292 places in 2 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1350 place count 528 transition count 508
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 3 with 137 rules applied. Total rules applied 1487 place count 528 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1488 place count 527 transition count 507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1489 place count 526 transition count 507
Applied a total of 1489 rules in 313 ms. Remains 526 /1203 variables (removed 677) and now considering 507/1183 (removed 676) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 526/1203 places, 507/1183 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 4) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 507 rows 526 cols
[2023-03-22 13:06:37] [INFO ] Computed 180 place invariants in 26 ms
[2023-03-22 13:06:37] [INFO ] [Real]Absence check using 178 positive place invariants in 29 ms returned sat
[2023-03-22 13:06:37] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-22 13:06:37] [INFO ] After 222ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 13:06:37] [INFO ] [Nat]Absence check using 178 positive place invariants in 38 ms returned sat
[2023-03-22 13:06:37] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 18 ms returned sat
[2023-03-22 13:06:38] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 13:06:38] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 20 ms to minimize.
[2023-03-22 13:06:39] [INFO ] Deduced a trap composed of 3 places in 371 ms of which 0 ms to minimize.
[2023-03-22 13:06:39] [INFO ] Deduced a trap composed of 8 places in 578 ms of which 1 ms to minimize.
[2023-03-22 13:06:39] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2023-03-22 13:06:40] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2023-03-22 13:06:40] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 7 ms to minimize.
[2023-03-22 13:06:40] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-22 13:06:40] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 17 ms to minimize.
[2023-03-22 13:06:41] [INFO ] Deduced a trap composed of 7 places in 225 ms of which 1 ms to minimize.
[2023-03-22 13:06:41] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-22 13:06:41] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-22 13:06:41] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 0 ms to minimize.
[2023-03-22 13:06:42] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-22 13:06:42] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 26 ms to minimize.
[2023-03-22 13:06:42] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2023-03-22 13:06:42] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-22 13:06:43] [INFO ] Deduced a trap composed of 7 places in 209 ms of which 1 ms to minimize.
[2023-03-22 13:06:43] [INFO ] Deduced a trap composed of 10 places in 365 ms of which 1 ms to minimize.
[2023-03-22 13:06:43] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 0 ms to minimize.
[2023-03-22 13:06:44] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 1 ms to minimize.
[2023-03-22 13:06:44] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5691 ms
[2023-03-22 13:06:44] [INFO ] Deduced a trap composed of 7 places in 343 ms of which 1 ms to minimize.
[2023-03-22 13:06:44] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2023-03-22 13:06:44] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:06:44] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2023-03-22 13:06:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 783 ms
[2023-03-22 13:06:45] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-22 13:06:45] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-03-22 13:06:45] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 0 ms to minimize.
[2023-03-22 13:06:45] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2023-03-22 13:06:45] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 0 ms to minimize.
[2023-03-22 13:06:45] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:06:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 719 ms
[2023-03-22 13:06:45] [INFO ] After 7719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-22 13:06:45] [INFO ] After 8153ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 42 ms.
Support contains 19 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 507/507 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 0 with 1 rules applied. Total rules applied 1 place count 526 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 525 transition count 506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 525 transition count 505
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 524 transition count 505
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 12 place count 520 transition count 501
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 519 transition count 500
Applied a total of 13 rules in 73 ms. Remains 519 /526 variables (removed 7) and now considering 500/507 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 519/526 places, 500/507 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 187310 steps, run timeout after 3008 ms. (steps per millisecond=62 ) properties seen :{2=1}
Probabilistic random walk after 187310 steps, saw 149011 distinct states, run finished after 3010 ms. (steps per millisecond=62 ) properties seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 500 rows 519 cols
[2023-03-22 13:06:49] [INFO ] Computed 180 place invariants in 10 ms
[2023-03-22 13:06:49] [INFO ] [Real]Absence check using 178 positive place invariants in 71 ms returned sat
[2023-03-22 13:06:49] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-22 13:06:49] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 13:06:49] [INFO ] [Nat]Absence check using 178 positive place invariants in 24 ms returned sat
[2023-03-22 13:06:49] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 13:06:49] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 13:06:50] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2023-03-22 13:06:50] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2023-03-22 13:06:50] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2023-03-22 13:06:50] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2023-03-22 13:06:50] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-22 13:06:50] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-22 13:06:51] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 0 ms to minimize.
[2023-03-22 13:06:51] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-22 13:06:51] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 0 ms to minimize.
[2023-03-22 13:06:51] [INFO ] Deduced a trap composed of 23 places in 224 ms of which 1 ms to minimize.
[2023-03-22 13:06:51] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2023-03-22 13:06:52] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-03-22 13:06:52] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 0 ms to minimize.
[2023-03-22 13:06:52] [INFO ] Deduced a trap composed of 15 places in 145 ms of which 0 ms to minimize.
[2023-03-22 13:06:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2486 ms
[2023-03-22 13:06:52] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
[2023-03-22 13:06:52] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2023-03-22 13:06:53] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:06:53] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 0 ms to minimize.
[2023-03-22 13:06:53] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2023-03-22 13:06:53] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2023-03-22 13:06:53] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-22 13:06:53] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2023-03-22 13:06:53] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2023-03-22 13:06:54] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 1 ms to minimize.
[2023-03-22 13:06:54] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:06:54] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-22 13:06:54] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 0 ms to minimize.
[2023-03-22 13:06:54] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2023-03-22 13:06:54] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 13:06:55] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2023-03-22 13:06:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2574 ms
[2023-03-22 13:06:55] [INFO ] After 5411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 96 ms.
[2023-03-22 13:06:55] [INFO ] After 5648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 37 ms.
Support contains 15 out of 519 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 519/519 places, 500/500 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 0 with 1 rules applied. Total rules applied 1 place count 519 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 518 transition count 499
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 515 transition count 496
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 515 transition count 496
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 514 transition count 495
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 514 transition count 495
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 513 transition count 494
Applied a total of 12 rules in 127 ms. Remains 513 /519 variables (removed 6) and now considering 494/500 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 513/519 places, 494/500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) 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 2) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 513 cols
[2023-03-22 13:06:55] [INFO ] Computed 180 place invariants in 5 ms
[2023-03-22 13:06:55] [INFO ] [Real]Absence check using 178 positive place invariants in 91 ms returned sat
[2023-03-22 13:06:55] [INFO ] [Real]Absence check using 178 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-22 13:06:56] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:06:56] [INFO ] [Nat]Absence check using 178 positive place invariants in 33 ms returned sat
[2023-03-22 13:06:56] [INFO ] [Nat]Absence check using 178 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-22 13:06:56] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:06:56] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2023-03-22 13:06:56] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2023-03-22 13:06:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1182 ms
[2023-03-22 13:06:57] [INFO ] After 1441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-22 13:06:57] [INFO ] After 1625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 494/494 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 513 transition count 492
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 511 transition count 492
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 18 place count 504 transition count 485
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 504 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 21 place count 502 transition count 483
Applied a total of 21 rules in 77 ms. Remains 502 /513 variables (removed 11) and now considering 483/494 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 502/513 places, 483/494 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 384730 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 384730 steps, saw 152620 distinct states, run finished after 3002 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 483 rows 502 cols
[2023-03-22 13:07:01] [INFO ] Computed 180 place invariants in 15 ms
[2023-03-22 13:07:01] [INFO ] [Real]Absence check using 179 positive place invariants in 59 ms returned sat
[2023-03-22 13:07:01] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:07:01] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:07:01] [INFO ] [Nat]Absence check using 179 positive place invariants in 30 ms returned sat
[2023-03-22 13:07:01] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 19 ms returned sat
[2023-03-22 13:07:02] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:07:02] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 22 ms to minimize.
[2023-03-22 13:07:02] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2023-03-22 13:07:02] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2023-03-22 13:07:02] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-22 13:07:02] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2023-03-22 13:07:03] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2023-03-22 13:07:03] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2023-03-22 13:07:03] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2023-03-22 13:07:03] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2023-03-22 13:07:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1490 ms
[2023-03-22 13:07:03] [INFO ] After 1785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-22 13:07:03] [INFO ] After 2044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 16 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 502/502 places, 483/483 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 14 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2023-03-22 13:07:03] [INFO ] Invariant cache hit.
[2023-03-22 13:07:04] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-22 13:07:04] [INFO ] Invariant cache hit.
[2023-03-22 13:07:05] [INFO ] Implicit Places using invariants and state equation in 1045 ms returned []
Implicit Place search using SMT with State Equation took 1825 ms to find 0 implicit places.
[2023-03-22 13:07:05] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-22 13:07:05] [INFO ] Invariant cache hit.
[2023-03-22 13:07:06] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2490 ms. Remains : 502/502 places, 483/483 transitions.
Applied a total of 0 rules in 10 ms. Remains 502 /502 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 13:07:06] [INFO ] Invariant cache hit.
[2023-03-22 13:07:06] [INFO ] [Real]Absence check using 179 positive place invariants in 22 ms returned sat
[2023-03-22 13:07:06] [INFO ] [Real]Absence check using 179 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-22 13:07:06] [INFO ] After 368ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 13:07:06] [INFO ] [Nat]Absence check using 179 positive place invariants in 37 ms returned sat
[2023-03-22 13:07:06] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-22 13:07:06] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 9 places in 312 ms of which 0 ms to minimize.
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 0 ms to minimize.
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 0 ms to minimize.
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-22 13:07:07] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2023-03-22 13:07:08] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2023-03-22 13:07:08] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-22 13:07:08] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-03-22 13:07:08] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 0 ms to minimize.
[2023-03-22 13:07:08] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-03-22 13:07:08] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:07:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1954 ms
[2023-03-22 13:07:08] [INFO ] After 2161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-22 13:07:08] [INFO ] After 2388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 13:07:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 41 ms.
[2023-03-22 13:07:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 502 places, 483 transitions and 2299 arcs took 20 ms.
[2023-03-22 13:07:09] [INFO ] Flatten gal took : 136 ms
Total runtime 59518 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldIIPs_PT_020B
(NrP: 502 NrTr: 483 NrArc: 2299)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.020sec

net check time: 0m 0.000sec

init dd package: 0m 2.994sec


before gc: list nodes free: 1129132

after gc: idd nodes used:133076, unused:63866924; list nodes free:286697122

before gc: list nodes free: 1921365

after gc: idd nodes used:161962, unused:63838038; list nodes free:288659178

before gc: list nodes free: 1476608

after gc: idd nodes used:164150, unused:63835850; list nodes free:288649723

before gc: list nodes free: 1635372

after gc: idd nodes used:166456, unused:63833544; list nodes free:288638646

before gc: list nodes free: 374817

after gc: idd nodes used:210026, unused:63789974; list nodes free:288436328

before gc: list nodes free: 303494

after gc: idd nodes used:206226, unused:63793774; list nodes free:288454556

before gc: list nodes free: 230995

after gc: idd nodes used:238615, unused:63761385; list nodes free:288305043

before gc: list nodes free: 935479

after gc: idd nodes used:273775, unused:63726225; list nodes free:294425350

before gc: list nodes free: 1525115

after gc: idd nodes used:323118, unused:63676882; list nodes free:294196986

before gc: list nodes free: 2019675

after gc: idd nodes used:323041, unused:63676959; list nodes free:294198110

before gc: list nodes free: 491910

after gc: idd nodes used:321414, unused:63678586; list nodes free:294207587
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6094968 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098264 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.002sec

39810 54139 65635 79540 90992 100259 96302 102967 114866 121154 129097 130712 130174 128595 130775 135178 133483 133161 130787 136707 144436 152788 160502 159978 158449 163327 172465 171474 169617 168755 165494 163316 164582 183104 167036 168374 163591 161974 166070 171221 169221 168334 163477 164394 190801 165127 179430 170449 164237 163680 170043 168649 165596 169346 170901 166261 169422 184387 189029 210854 211706 206946 204552 204903 211432 228835 217626 215769 204454 204053 205944 206980 210463 207081 241124 258869 252846 252388 247877 235907 247608 233509 257464 261260 252318 280172 285495 268175 281038 319201 290249 313823 306015 296413 296388 324308 320654 322441 300970 309188 315397 319540

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-020B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldIIPs-PT-020B, 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 r394-oct2-167903717500110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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