Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789300429.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789300429
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 11 14:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Apr 11 14:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 14:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 955K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716991089418

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 13:58:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 13:58:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:58:11] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-29 13:58:11] [INFO ] Transformed 3903 places.
[2024-05-29 13:58:11] [INFO ] Transformed 3553 transitions.
[2024-05-29 13:58:11] [INFO ] Found NUPN structural information;
[2024-05-29 13:58:11] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-15 FALSE 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 11) seen :3
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2024-05-29 13:58:12] [INFO ] Computed 551 invariants in 48 ms
[2024-05-29 13:58:14] [INFO ] After 1202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-29 13:58:15] [INFO ] [Nat]Absence check using 551 positive place invariants in 243 ms returned sat
[2024-05-29 13:58:22] [INFO ] After 6618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-29 13:58:24] [INFO ] Deduced a trap composed of 16 places in 1245 ms of which 12 ms to minimize.
[2024-05-29 13:58:26] [INFO ] Deduced a trap composed of 27 places in 1613 ms of which 3 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 29 places in 1636 ms of which 4 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 26 places in 1666 ms of which 4 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 36 places in 1644 ms of which 3 ms to minimize.
[2024-05-29 13:58:33] [INFO ] Deduced a trap composed of 23 places in 1615 ms of which 3 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 23 places in 1615 ms of which 3 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 20 places in 1659 ms of which 3 ms to minimize.
[2024-05-29 13:58:39] [INFO ] Deduced a trap composed of 28 places in 1622 ms of which 3 ms to minimize.
[2024-05-29 13:58:40] [INFO ] Deduced a trap composed of 24 places in 1586 ms of which 3 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 13:58:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 13:58:40] [INFO ] After 26645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 976 ms.
Support contains 158 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 845 transitions
Trivial Post-agglo rules discarded 845 transitions
Performed 845 trivial Post agglomeration. Transition count delta: 845
Iterating post reduction 0 with 845 rules applied. Total rules applied 845 place count 3903 transition count 2708
Reduce places removed 845 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 847 rules applied. Total rules applied 1692 place count 3058 transition count 2706
Reduce places removed 1 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 40 rules applied. Total rules applied 1732 place count 3057 transition count 2667
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 3 with 39 rules applied. Total rules applied 1771 place count 3018 transition count 2667
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 198 Pre rules applied. Total rules applied 1771 place count 3018 transition count 2469
Deduced a syphon composed of 198 places in 7 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 4 with 396 rules applied. Total rules applied 2167 place count 2820 transition count 2469
Discarding 319 places :
Symmetric choice reduction at 4 with 319 rule applications. Total rules 2486 place count 2501 transition count 2150
Iterating global reduction 4 with 319 rules applied. Total rules applied 2805 place count 2501 transition count 2150
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 128 Pre rules applied. Total rules applied 2805 place count 2501 transition count 2022
Deduced a syphon composed of 128 places in 15 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 3061 place count 2373 transition count 2022
Performed 788 Post agglomeration using F-continuation condition.Transition count delta: 788
Deduced a syphon composed of 788 places in 10 ms
Reduce places removed 788 places and 0 transitions.
Iterating global reduction 4 with 1576 rules applied. Total rules applied 4637 place count 1585 transition count 1234
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 5 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4839 place count 1484 transition count 1234
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 4877 place count 1465 transition count 1234
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 4885 place count 1465 transition count 1226
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 4893 place count 1457 transition count 1226
Partial Free-agglomeration rule applied 128 times.
Drop transitions removed 128 transitions
Iterating global reduction 5 with 128 rules applied. Total rules applied 5021 place count 1457 transition count 1226
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 5022 place count 1457 transition count 1226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5023 place count 1456 transition count 1225
Applied a total of 5023 rules in 1695 ms. Remains 1456 /3903 variables (removed 2447) and now considering 1225/3553 (removed 2328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1696 ms. Remains : 1456/3903 places, 1225/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 7) seen :1
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1225 rows 1456 cols
[2024-05-29 13:58:44] [INFO ] Computed 551 invariants in 8 ms
[2024-05-29 13:58:44] [INFO ] After 312ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:58:44] [INFO ] [Nat]Absence check using 551 positive place invariants in 105 ms returned sat
[2024-05-29 13:58:46] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:58:46] [INFO ] State equation strengthened by 214 read => feed constraints.
[2024-05-29 13:58:47] [INFO ] After 891ms SMT Verify possible using 214 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:58:47] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2024-05-29 13:58:47] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 2 ms to minimize.
[2024-05-29 13:58:47] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 0 ms to minimize.
[2024-05-29 13:58:48] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 13:58:48] [INFO ] Deduced a trap composed of 8 places in 202 ms of which 1 ms to minimize.
[2024-05-29 13:58:48] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2024-05-29 13:58:48] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2024-05-29 13:58:49] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2024-05-29 13:58:49] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2024-05-29 13:58:49] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 1 ms to minimize.
[2024-05-29 13:58:49] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 6 places in 175 ms of which 1 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2024-05-29 13:58:51] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:58:51] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2024-05-29 13:58:51] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
[2024-05-29 13:58:51] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 13:58:51] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:58:52] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:58:52] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:58:52] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5141 ms
[2024-05-29 13:58:52] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2024-05-29 13:58:52] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2024-05-29 13:58:53] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2024-05-29 13:58:53] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-29 13:58:53] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2024-05-29 13:58:53] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2024-05-29 13:58:53] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2024-05-29 13:58:54] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:58:54] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:58:54] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:58:54] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:58:54] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:58:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2534 ms
[2024-05-29 13:58:55] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:58:55] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2024-05-29 13:58:56] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2024-05-29 13:58:56] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:58:56] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2024-05-29 13:58:56] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:58:56] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:58:57] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:58:57] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:58:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1832 ms
[2024-05-29 13:58:57] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 13:58:57] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:58:58] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 4 ms to minimize.
[2024-05-29 13:58:58] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:58:58] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 0 ms to minimize.
[2024-05-29 13:58:58] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2024-05-29 13:58:58] [INFO ] Deduced a trap composed of 7 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:58:58] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2024-05-29 13:58:59] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:58:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1767 ms
[2024-05-29 13:58:59] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:58:59] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:58:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2024-05-29 13:59:00] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 2 ms to minimize.
[2024-05-29 13:59:00] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 13:59:00] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:59:00] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2024-05-29 13:59:00] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-29 13:59:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1028 ms
[2024-05-29 13:59:00] [INFO ] After 14717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1731 ms.
[2024-05-29 13:59:02] [INFO ] After 18028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 134 ms.
Support contains 126 out of 1456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 1225/1225 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1456 transition count 1216
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 1447 transition count 1215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1446 transition count 1215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 1446 transition count 1213
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 1444 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 1443 transition count 1212
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 1443 transition count 1212
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 1443 transition count 1211
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 1442 transition count 1211
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 76 place count 1418 transition count 1187
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 1414 transition count 1187
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 1414 transition count 1187
Applied a total of 87 rules in 233 ms. Remains 1414 /1456 variables (removed 42) and now considering 1187/1225 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 1414/1456 places, 1187/1225 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 92468 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 92468 steps, saw 59448 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1187 rows 1414 cols
[2024-05-29 13:59:06] [INFO ] Computed 551 invariants in 5 ms
[2024-05-29 13:59:07] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:59:07] [INFO ] [Nat]Absence check using 551 positive place invariants in 95 ms returned sat
[2024-05-29 13:59:08] [INFO ] After 1014ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:59:08] [INFO ] State equation strengthened by 221 read => feed constraints.
[2024-05-29 13:59:09] [INFO ] After 1358ms SMT Verify possible using 221 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:59:10] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:59:10] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2024-05-29 13:59:10] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:59:10] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 0 ms to minimize.
[2024-05-29 13:59:11] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:59:11] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 13:59:11] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2024-05-29 13:59:11] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:59:12] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:59:12] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 0 ms to minimize.
[2024-05-29 13:59:12] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:59:12] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:59:12] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 13:59:12] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:59:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2865 ms
[2024-05-29 13:59:13] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2024-05-29 13:59:13] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2024-05-29 13:59:13] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 1 ms to minimize.
[2024-05-29 13:59:14] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 0 ms to minimize.
[2024-05-29 13:59:14] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-29 13:59:14] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2024-05-29 13:59:14] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2024-05-29 13:59:14] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 0 ms to minimize.
[2024-05-29 13:59:15] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 1 ms to minimize.
[2024-05-29 13:59:15] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2024-05-29 13:59:15] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:59:15] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 0 ms to minimize.
[2024-05-29 13:59:16] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:59:16] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:59:16] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:59:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3315 ms
[2024-05-29 13:59:17] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2024-05-29 13:59:17] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 0 ms to minimize.
[2024-05-29 13:59:17] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 13:59:17] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 13:59:17] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2024-05-29 13:59:17] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 13:59:18] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 13:59:18] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 0 ms to minimize.
[2024-05-29 13:59:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1430 ms
[2024-05-29 13:59:18] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2024-05-29 13:59:18] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:59:19] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:59:19] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:59:19] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 1 ms to minimize.
[2024-05-29 13:59:19] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:59:19] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
[2024-05-29 13:59:19] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2024-05-29 13:59:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1557 ms
[2024-05-29 13:59:20] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 0 ms to minimize.
[2024-05-29 13:59:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-29 13:59:20] [INFO ] After 11960ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1405 ms.
[2024-05-29 13:59:22] [INFO ] After 14897ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 236 ms.
Support contains 126 out of 1414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1414/1414 places, 1187/1187 transitions.
Applied a total of 0 rules in 49 ms. Remains 1414 /1414 variables (removed 0) and now considering 1187/1187 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1414/1414 places, 1187/1187 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1414/1414 places, 1187/1187 transitions.
Applied a total of 0 rules in 39 ms. Remains 1414 /1414 variables (removed 0) and now considering 1187/1187 (removed 0) transitions.
[2024-05-29 13:59:22] [INFO ] Invariant cache hit.
[2024-05-29 13:59:23] [INFO ] Implicit Places using invariants in 756 ms returned [1403]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 760 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1413/1414 places, 1187/1187 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 1413 transition count 1185
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1411 transition count 1185
Applied a total of 4 rules in 41 ms. Remains 1411 /1413 variables (removed 2) and now considering 1185/1187 (removed 2) transitions.
// Phase 1: matrix 1185 rows 1411 cols
[2024-05-29 13:59:23] [INFO ] Computed 550 invariants in 4 ms
[2024-05-29 13:59:23] [INFO ] Implicit Places using invariants in 744 ms returned [1390, 1394]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 748 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1409/1414 places, 1185/1187 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1408 transition count 1184
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1408 transition count 1184
Applied a total of 2 rules in 66 ms. Remains 1408 /1409 variables (removed 1) and now considering 1184/1185 (removed 1) transitions.
// Phase 1: matrix 1184 rows 1408 cols
[2024-05-29 13:59:23] [INFO ] Computed 548 invariants in 9 ms
[2024-05-29 13:59:24] [INFO ] Implicit Places using invariants in 736 ms returned []
[2024-05-29 13:59:24] [INFO ] Invariant cache hit.
[2024-05-29 13:59:25] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-05-29 13:59:28] [INFO ] Implicit Places using invariants and state equation in 3908 ms returned []
Implicit Place search using SMT with State Equation took 4646 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1408/1414 places, 1184/1187 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6300 ms. Remains : 1408/1414 places, 1184/1187 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 90591 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90591 steps, saw 59132 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-29 13:59:32] [INFO ] Invariant cache hit.
[2024-05-29 13:59:32] [INFO ] After 283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:59:33] [INFO ] [Nat]Absence check using 548 positive place invariants in 91 ms returned sat
[2024-05-29 13:59:34] [INFO ] After 1143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:59:34] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-05-29 13:59:35] [INFO ] After 1188ms SMT Verify possible using 219 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:59:35] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2024-05-29 13:59:36] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 13:59:36] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2024-05-29 13:59:36] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 0 ms to minimize.
[2024-05-29 13:59:36] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 13:59:36] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 13:59:37] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2024-05-29 13:59:37] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2024-05-29 13:59:37] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 13:59:37] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:59:37] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 0 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4002 ms
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 1 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1848 ms
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 0 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2024-05-29 13:59:43] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:59:43] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:59:43] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2024-05-29 13:59:43] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2722 ms
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 344 ms
[2024-05-29 13:59:45] [INFO ] After 11105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1240 ms.
[2024-05-29 13:59:46] [INFO ] After 14016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 210 ms.
Support contains 126 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 1184/1184 transitions.
Applied a total of 0 rules in 43 ms. Remains 1408 /1408 variables (removed 0) and now considering 1184/1184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1408/1408 places, 1184/1184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 1184/1184 transitions.
Applied a total of 0 rules in 35 ms. Remains 1408 /1408 variables (removed 0) and now considering 1184/1184 (removed 0) transitions.
[2024-05-29 13:59:46] [INFO ] Invariant cache hit.
[2024-05-29 13:59:47] [INFO ] Implicit Places using invariants in 713 ms returned []
[2024-05-29 13:59:47] [INFO ] Invariant cache hit.
[2024-05-29 13:59:48] [INFO ] State equation strengthened by 219 read => feed constraints.
[2024-05-29 13:59:51] [INFO ] Implicit Places using invariants and state equation in 3726 ms returned []
Implicit Place search using SMT with State Equation took 4441 ms to find 0 implicit places.
[2024-05-29 13:59:51] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-29 13:59:51] [INFO ] Invariant cache hit.
[2024-05-29 13:59:52] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5244 ms. Remains : 1408/1408 places, 1184/1184 transitions.
Partial Free-agglomeration rule applied 257 times.
Drop transitions removed 257 transitions
Iterating global reduction 0 with 257 rules applied. Total rules applied 257 place count 1408 transition count 1184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 258 place count 1408 transition count 1183
Applied a total of 258 rules in 107 ms. Remains 1408 /1408 variables (removed 0) and now considering 1183/1184 (removed 1) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1183 rows 1408 cols
[2024-05-29 13:59:52] [INFO ] Computed 548 invariants in 6 ms
[2024-05-29 13:59:52] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 13:59:52] [INFO ] [Nat]Absence check using 548 positive place invariants in 96 ms returned sat
[2024-05-29 13:59:54] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-29 13:59:54] [INFO ] State equation strengthened by 216 read => feed constraints.
[2024-05-29 13:59:56] [INFO ] After 1856ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-29 13:59:56] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2024-05-29 13:59:56] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2024-05-29 13:59:56] [INFO ] Deduced a trap composed of 7 places in 173 ms of which 0 ms to minimize.
[2024-05-29 13:59:57] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2024-05-29 13:59:57] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-05-29 13:59:57] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2024-05-29 13:59:57] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:59:58] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2024-05-29 13:59:58] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2024-05-29 13:59:58] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 13:59:58] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 0 ms to minimize.
[2024-05-29 13:59:58] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2024-05-29 13:59:59] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 13:59:59] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2024-05-29 13:59:59] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:59:59] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:59:59] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:00:00] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2024-05-29 14:00:00] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2024-05-29 14:00:00] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2024-05-29 14:00:00] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 0 ms to minimize.
[2024-05-29 14:00:00] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2024-05-29 14:00:00] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4704 ms
[2024-05-29 14:00:01] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2024-05-29 14:00:02] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 1 ms to minimize.
[2024-05-29 14:00:02] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 1 ms to minimize.
[2024-05-29 14:00:02] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:00:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1471 ms
[2024-05-29 14:00:04] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 14:00:05] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:00:05] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-29 14:00:05] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2024-05-29 14:00:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1564 ms
[2024-05-29 14:00:06] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:00:06] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 0 ms to minimize.
[2024-05-29 14:00:07] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:00:07] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:00:07] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2024-05-29 14:00:08] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:00:08] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:00:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2046 ms
[2024-05-29 14:00:08] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1301 ms
[2024-05-29 14:00:10] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2024-05-29 14:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2024-05-29 14:00:10] [INFO ] After 15984ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2311 ms.
[2024-05-29 14:00:12] [INFO ] After 19946ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-29 14:00:12] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-29 14:00:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1408 places, 1184 transitions and 5011 arcs took 7 ms.
[2024-05-29 14:00:12] [INFO ] Flatten gal took : 149 ms
Total runtime 121543 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-050B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality

FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716991216941

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 22 (type EXCL) for 3 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 3 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 3 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 3 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 21 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
lola: result : true
lola: markings : 83
lola: fired transitions : 82
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 19 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 22 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 28 (type EXCL) for 6 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 24 (type FNDP) for 6 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type EQUN) for 6 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SRCH) for 6 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 27 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 122
lola: fired transitions : 121
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 24 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 25 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 28 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03 (obsolete)
lola: FINISHED task # 24 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03
lola: result : true
lola: fired transitions : 120
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 18 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01
lola: result : true
lola: fired transitions : 81
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 35 (type EXCL) for 15 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 31 (type FNDP) for 15 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 32 (type EQUN) for 15 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 15 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 31 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12
lola: result : true
lola: fired transitions : 83
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 32 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 34 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 35 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 41 (type EXCL) for 9 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 37 (type FNDP) for 9 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 38 (type EQUN) for 9 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type SRCH) for 9 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 37 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04
lola: result : true
lola: fired transitions : 60
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 38 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 40 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04 (obsolete)
lola: CANCELED task # 41 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 48 (type EXCL) for 0 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 44 (type FNDP) for 0 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type EQUN) for 0 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 47 (type SRCH) for 0 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 47 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00
lola: result : true
lola: markings : 128
lola: fired transitions : 127
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 44 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 45 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 48 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 54 (type EXCL) for 12 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
lola: time limit : 3597 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 50 (type FNDP) for 12 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type EQUN) for 12 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 53 (type SRCH) for 12 ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 53 (type SRCH) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10
lola: result : true
lola: markings : 135
lola: fired transitions : 134
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 50 (type FNDP) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 51 (type EQUN) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 54 (type EXCL) for ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-050B-ReachabilityCardinality-2024-00: AG false tandem / insertion
ShieldPPPt-PT-050B-ReachabilityCardinality-2024-01: EF true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityCardinality-2024-03: EF true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityCardinality-2024-04: EF true findpath
ShieldPPPt-PT-050B-ReachabilityCardinality-2024-10: EF true tandem / insertion
ShieldPPPt-PT-050B-ReachabilityCardinality-2024-12: AG false findpath


Time elapsed: 3 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-050B, 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 r373-tall-171683789300429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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