Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903717100478.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPs-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 528K 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 ShieldPPPs-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679452633427

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:37:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:37:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:37:16] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2023-03-22 02:37:16] [INFO ] Transformed 2043 places.
[2023-03-22 02:37:17] [INFO ] Transformed 1893 transitions.
[2023-03-22 02:37:17] [INFO ] Found NUPN structural information;
[2023-03-22 02:37:17] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 462 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 12) seen :9
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-22 02:37:17] [INFO ] Computed 331 place invariants in 57 ms
[2023-03-22 02:37:19] [INFO ] After 1255ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 02:37:20] [INFO ] [Nat]Absence check using 331 positive place invariants in 181 ms returned sat
[2023-03-22 02:37:22] [INFO ] After 2361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 02:37:24] [INFO ] Deduced a trap composed of 23 places in 1364 ms of which 23 ms to minimize.
[2023-03-22 02:37:24] [INFO ] Deduced a trap composed of 19 places in 756 ms of which 2 ms to minimize.
[2023-03-22 02:37:25] [INFO ] Deduced a trap composed of 20 places in 612 ms of which 1 ms to minimize.
[2023-03-22 02:37:26] [INFO ] Deduced a trap composed of 22 places in 549 ms of which 2 ms to minimize.
[2023-03-22 02:37:27] [INFO ] Deduced a trap composed of 20 places in 628 ms of which 2 ms to minimize.
[2023-03-22 02:37:27] [INFO ] Deduced a trap composed of 30 places in 536 ms of which 1 ms to minimize.
[2023-03-22 02:37:28] [INFO ] Deduced a trap composed of 16 places in 406 ms of which 1 ms to minimize.
[2023-03-22 02:37:28] [INFO ] Deduced a trap composed of 18 places in 476 ms of which 2 ms to minimize.
[2023-03-22 02:37:29] [INFO ] Deduced a trap composed of 15 places in 483 ms of which 4 ms to minimize.
[2023-03-22 02:37:30] [INFO ] Deduced a trap composed of 24 places in 689 ms of which 1 ms to minimize.
[2023-03-22 02:37:30] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 1 ms to minimize.
[2023-03-22 02:37:31] [INFO ] Deduced a trap composed of 28 places in 461 ms of which 1 ms to minimize.
[2023-03-22 02:37:32] [INFO ] Deduced a trap composed of 43 places in 568 ms of which 2 ms to minimize.
[2023-03-22 02:37:32] [INFO ] Deduced a trap composed of 31 places in 567 ms of which 1 ms to minimize.
[2023-03-22 02:37:33] [INFO ] Deduced a trap composed of 46 places in 678 ms of which 2 ms to minimize.
[2023-03-22 02:37:34] [INFO ] Deduced a trap composed of 27 places in 702 ms of which 1 ms to minimize.
[2023-03-22 02:37:34] [INFO ] Deduced a trap composed of 28 places in 437 ms of which 1 ms to minimize.
[2023-03-22 02:37:35] [INFO ] Deduced a trap composed of 42 places in 423 ms of which 1 ms to minimize.
[2023-03-22 02:37:36] [INFO ] Deduced a trap composed of 39 places in 523 ms of which 1 ms to minimize.
[2023-03-22 02:37:36] [INFO ] Deduced a trap composed of 36 places in 531 ms of which 1 ms to minimize.
[2023-03-22 02:37:37] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 1 ms to minimize.
[2023-03-22 02:37:37] [INFO ] Deduced a trap composed of 36 places in 463 ms of which 14 ms to minimize.
[2023-03-22 02:37:38] [INFO ] Deduced a trap composed of 24 places in 396 ms of which 1 ms to minimize.
[2023-03-22 02:37:38] [INFO ] Deduced a trap composed of 29 places in 378 ms of which 1 ms to minimize.
[2023-03-22 02:37:39] [INFO ] Deduced a trap composed of 22 places in 515 ms of which 2 ms to minimize.
[2023-03-22 02:37:39] [INFO ] Deduced a trap composed of 27 places in 367 ms of which 1 ms to minimize.
[2023-03-22 02:37:40] [INFO ] Deduced a trap composed of 42 places in 456 ms of which 1 ms to minimize.
[2023-03-22 02:37:40] [INFO ] Deduced a trap composed of 46 places in 445 ms of which 1 ms to minimize.
[2023-03-22 02:37:41] [INFO ] Deduced a trap composed of 28 places in 438 ms of which 1 ms to minimize.
[2023-03-22 02:37:41] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 1 ms to minimize.
[2023-03-22 02:37:42] [INFO ] Deduced a trap composed of 37 places in 480 ms of which 1 ms to minimize.
[2023-03-22 02:37:42] [INFO ] Deduced a trap composed of 39 places in 432 ms of which 1 ms to minimize.
[2023-03-22 02:37:43] [INFO ] Deduced a trap composed of 29 places in 387 ms of which 1 ms to minimize.
[2023-03-22 02:37:43] [INFO ] Deduced a trap composed of 32 places in 340 ms of which 2 ms to minimize.
[2023-03-22 02:37:44] [INFO ] Deduced a trap composed of 32 places in 581 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 02:37:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 02:37:44] [INFO ] After 25217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 192 ms.
Support contains 71 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 2043 transition count 1706
Reduce places removed 187 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 195 rules applied. Total rules applied 382 place count 1856 transition count 1698
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 390 place count 1848 transition count 1698
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 390 place count 1848 transition count 1549
Deduced a syphon composed of 149 places in 3 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 688 place count 1699 transition count 1549
Discarding 193 places :
Symmetric choice reduction at 3 with 193 rule applications. Total rules 881 place count 1506 transition count 1356
Iterating global reduction 3 with 193 rules applied. Total rules applied 1074 place count 1506 transition count 1356
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 1074 place count 1506 transition count 1282
Deduced a syphon composed of 74 places in 3 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 1222 place count 1432 transition count 1282
Performed 422 Post agglomeration using F-continuation condition.Transition count delta: 422
Deduced a syphon composed of 422 places in 3 ms
Reduce places removed 422 places and 0 transitions.
Iterating global reduction 3 with 844 rules applied. Total rules applied 2066 place count 1010 transition count 860
Partial Free-agglomeration rule applied 245 times.
Drop transitions removed 245 transitions
Iterating global reduction 3 with 245 rules applied. Total rules applied 2311 place count 1010 transition count 860
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2312 place count 1009 transition count 859
Applied a total of 2312 rules in 641 ms. Remains 1009 /2043 variables (removed 1034) and now considering 859/1893 (removed 1034) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 1009/2043 places, 859/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-030B-ReachabilityCardinality-12 TRUE 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 859 rows 1009 cols
[2023-03-22 02:37:45] [INFO ] Computed 331 place invariants in 58 ms
[2023-03-22 02:37:45] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:37:46] [INFO ] [Nat]Absence check using 309 positive place invariants in 83 ms returned sat
[2023-03-22 02:37:46] [INFO ] [Nat]Absence check using 309 positive and 22 generalized place invariants in 10 ms returned sat
[2023-03-22 02:37:47] [INFO ] After 808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:37:47] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-22 02:37:47] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-22 02:37:47] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 1 ms to minimize.
[2023-03-22 02:37:48] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 0 ms to minimize.
[2023-03-22 02:37:48] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-22 02:37:48] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2023-03-22 02:37:48] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2023-03-22 02:37:49] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2023-03-22 02:37:49] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2023-03-22 02:37:49] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-03-22 02:37:49] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 6 places in 309 ms of which 1 ms to minimize.
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 1 ms to minimize.
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 38 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 0 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 0 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-22 02:37:54] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 1 ms to minimize.
[2023-03-22 02:37:54] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-22 02:37:54] [INFO ] Deduced a trap composed of 8 places in 562 ms of which 1 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 1 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 0 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 8502 ms
[2023-03-22 02:37:56] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-22 02:37:56] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2023-03-22 02:37:56] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-22 02:37:57] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-22 02:37:57] [INFO ] Deduced a trap composed of 5 places in 231 ms of which 0 ms to minimize.
[2023-03-22 02:37:57] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 0 ms to minimize.
[2023-03-22 02:37:58] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-22 02:37:58] [INFO ] Deduced a trap composed of 8 places in 298 ms of which 1 ms to minimize.
[2023-03-22 02:37:58] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 0 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 0 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-22 02:38:00] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2023-03-22 02:38:00] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2023-03-22 02:38:00] [INFO ] Deduced a trap composed of 11 places in 223 ms of which 0 ms to minimize.
[2023-03-22 02:38:00] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 1 ms to minimize.
[2023-03-22 02:38:01] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 4 ms to minimize.
[2023-03-22 02:38:01] [INFO ] Deduced a trap composed of 30 places in 295 ms of which 1 ms to minimize.
[2023-03-22 02:38:01] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5442 ms
[2023-03-22 02:38:01] [INFO ] After 15298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 425 ms.
[2023-03-22 02:38:01] [INFO ] After 16088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 57 ms.
Support contains 54 out of 1009 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1009/1009 places, 859/859 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1009 transition count 856
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1006 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 1006 transition count 854
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 1004 transition count 854
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 993 transition count 843
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 990 transition count 840
Applied a total of 35 rules in 399 ms. Remains 990 /1009 variables (removed 19) and now considering 840/859 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 990/1009 places, 840/859 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 121954 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121954 steps, saw 89029 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 840 rows 990 cols
[2023-03-22 02:38:05] [INFO ] Computed 331 place invariants in 13 ms
[2023-03-22 02:38:05] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:38:06] [INFO ] [Nat]Absence check using 312 positive place invariants in 67 ms returned sat
[2023-03-22 02:38:06] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-22 02:38:06] [INFO ] After 840ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:38:07] [INFO ] Deduced a trap composed of 6 places in 196 ms of which 1 ms to minimize.
[2023-03-22 02:38:07] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-22 02:38:07] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 1 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 1 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 8 places in 310 ms of which 0 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 26 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 0 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 13 places in 178 ms of which 1 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5280 ms
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 0 ms to minimize.
[2023-03-22 02:38:13] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 0 ms to minimize.
[2023-03-22 02:38:13] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2023-03-22 02:38:13] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-22 02:38:14] [INFO ] Deduced a trap composed of 6 places in 235 ms of which 0 ms to minimize.
[2023-03-22 02:38:14] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2023-03-22 02:38:14] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 1 ms to minimize.
[2023-03-22 02:38:15] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-22 02:38:15] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 7 ms to minimize.
[2023-03-22 02:38:15] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2023-03-22 02:38:15] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 0 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 1 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 10 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 7 places in 125 ms of which 0 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 1 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2023-03-22 02:38:21] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 0 ms to minimize.
[2023-03-22 02:38:21] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 1 ms to minimize.
[2023-03-22 02:38:21] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2023-03-22 02:38:21] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 0 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 9673 ms
[2023-03-22 02:38:22] [INFO ] After 16223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 878 ms.
[2023-03-22 02:38:23] [INFO ] After 17393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 54 out of 990 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 840/840 transitions.
Applied a total of 0 rules in 28 ms. Remains 990 /990 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 990/990 places, 840/840 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 990/990 places, 840/840 transitions.
Applied a total of 0 rules in 123 ms. Remains 990 /990 variables (removed 0) and now considering 840/840 (removed 0) transitions.
[2023-03-22 02:38:23] [INFO ] Invariant cache hit.
[2023-03-22 02:38:24] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-22 02:38:24] [INFO ] Invariant cache hit.
[2023-03-22 02:38:25] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2297 ms to find 0 implicit places.
[2023-03-22 02:38:25] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-22 02:38:25] [INFO ] Invariant cache hit.
[2023-03-22 02:38:26] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3082 ms. Remains : 990/990 places, 840/840 transitions.
Applied a total of 0 rules in 25 ms. Remains 990 /990 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-22 02:38:26] [INFO ] Invariant cache hit.
[2023-03-22 02:38:26] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:38:26] [INFO ] [Nat]Absence check using 312 positive place invariants in 68 ms returned sat
[2023-03-22 02:38:26] [INFO ] [Nat]Absence check using 312 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-22 02:38:28] [INFO ] After 994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:38:28] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2023-03-22 02:38:28] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 0 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2023-03-22 02:38:30] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 0 ms to minimize.
[2023-03-22 02:38:30] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-22 02:38:30] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 5 places in 438 ms of which 1 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 0 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2023-03-22 02:38:32] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-22 02:38:32] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 0 ms to minimize.
[2023-03-22 02:38:32] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-22 02:38:32] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 0 ms to minimize.
[2023-03-22 02:38:33] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 1 ms to minimize.
[2023-03-22 02:38:33] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 1 ms to minimize.
[2023-03-22 02:38:33] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-22 02:38:33] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2023-03-22 02:38:34] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-22 02:38:34] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 1 ms to minimize.
[2023-03-22 02:38:34] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 6242 ms
[2023-03-22 02:38:35] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2023-03-22 02:38:35] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 0 ms to minimize.
[2023-03-22 02:38:35] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 0 ms to minimize.
[2023-03-22 02:38:35] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-22 02:38:36] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 0 ms to minimize.
[2023-03-22 02:38:36] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 0 ms to minimize.
[2023-03-22 02:38:37] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2023-03-22 02:38:37] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 0 ms to minimize.
[2023-03-22 02:38:37] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2023-03-22 02:38:37] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 0 ms to minimize.
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 8 places in 340 ms of which 1 ms to minimize.
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 0 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 2 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 9 places in 382 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 7 places in 263 ms of which 0 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8000 ms
[2023-03-22 02:38:42] [INFO ] After 15881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-22 02:38:43] [INFO ] After 16834ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-22 02:38:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 15 ms.
[2023-03-22 02:38:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 990 places, 840 transitions and 3638 arcs took 7 ms.
[2023-03-22 02:38:43] [INFO ] Flatten gal took : 114 ms
Total runtime 87461 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/1132/inv_0_ --invariant=/tmp/1132/inv_1_ --inv-par
Could not compute solution for formula : ShieldPPPs-PT-030B-ReachabilityCardinality-03
Could not compute solution for formula : ShieldPPPs-PT-030B-ReachabilityCardinality-05

BK_STOP 1679455966958

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023
rfs formula name ShieldPPPs-PT-030B-ReachabilityCardinality-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1132/inv_0_
rfs formula name ShieldPPPs-PT-030B-ReachabilityCardinality-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1132/inv_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 990 places, 840 transitions and 3638 arcs
pnml2lts-sym: Petri net ShieldPPPs_PT_030B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 840->834 groups
pnml2lts-sym: Regrouping took 0.290 real 0.280 user 0.000 sys
pnml2lts-sym: state vector length is 990; there are 834 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done

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="ShieldPPPs-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPs-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 r393-oct2-167903717100478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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