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-171683789200409.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-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789200409
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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 May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 11 14:41 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 569K 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-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716987446349

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-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 12:57:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 12:57:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:57:28] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-29 12:57:28] [INFO ] Transformed 2343 places.
[2024-05-29 12:57:28] [INFO ] Transformed 2133 transitions.
[2024-05-29 12:57:28] [INFO ] Found NUPN structural information;
[2024-05-29 12:57:28] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 13) seen :4
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2024-05-29 12:57:29] [INFO ] Computed 331 invariants in 34 ms
[2024-05-29 12:57:31] [INFO ] After 1244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 12:57:31] [INFO ] [Nat]Absence check using 331 positive place invariants in 127 ms returned sat
[2024-05-29 12:57:34] [INFO ] After 2205ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2024-05-29 12:57:35] [INFO ] Deduced a trap composed of 24 places in 589 ms of which 8 ms to minimize.
[2024-05-29 12:57:36] [INFO ] Deduced a trap composed of 27 places in 487 ms of which 2 ms to minimize.
[2024-05-29 12:57:36] [INFO ] Deduced a trap composed of 32 places in 499 ms of which 2 ms to minimize.
[2024-05-29 12:57:37] [INFO ] Deduced a trap composed of 18 places in 477 ms of which 2 ms to minimize.
[2024-05-29 12:57:37] [INFO ] Deduced a trap composed of 28 places in 513 ms of which 4 ms to minimize.
[2024-05-29 12:57:38] [INFO ] Deduced a trap composed of 38 places in 545 ms of which 1 ms to minimize.
[2024-05-29 12:57:39] [INFO ] Deduced a trap composed of 24 places in 501 ms of which 2 ms to minimize.
[2024-05-29 12:57:39] [INFO ] Deduced a trap composed of 30 places in 504 ms of which 2 ms to minimize.
[2024-05-29 12:57:40] [INFO ] Deduced a trap composed of 27 places in 467 ms of which 1 ms to minimize.
[2024-05-29 12:57:40] [INFO ] Deduced a trap composed of 31 places in 463 ms of which 1 ms to minimize.
[2024-05-29 12:57:41] [INFO ] Deduced a trap composed of 33 places in 464 ms of which 1 ms to minimize.
[2024-05-29 12:57:41] [INFO ] Deduced a trap composed of 32 places in 457 ms of which 1 ms to minimize.
[2024-05-29 12:57:42] [INFO ] Deduced a trap composed of 26 places in 440 ms of which 1 ms to minimize.
[2024-05-29 12:57:43] [INFO ] Deduced a trap composed of 33 places in 452 ms of which 1 ms to minimize.
[2024-05-29 12:57:43] [INFO ] Deduced a trap composed of 29 places in 438 ms of which 1 ms to minimize.
[2024-05-29 12:57:44] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 1 ms to minimize.
[2024-05-29 12:57:44] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 1 ms to minimize.
[2024-05-29 12:57:45] [INFO ] Deduced a trap composed of 35 places in 395 ms of which 1 ms to minimize.
[2024-05-29 12:57:45] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 2 ms to minimize.
[2024-05-29 12:57:46] [INFO ] Deduced a trap composed of 23 places in 613 ms of which 2 ms to minimize.
[2024-05-29 12:57:47] [INFO ] Deduced a trap composed of 25 places in 582 ms of which 2 ms to minimize.
[2024-05-29 12:57:48] [INFO ] Deduced a trap composed of 24 places in 567 ms of which 2 ms to minimize.
[2024-05-29 12:57:49] [INFO ] Deduced a trap composed of 36 places in 579 ms of which 2 ms to minimize.
[2024-05-29 12:57:49] [INFO ] Deduced a trap composed of 25 places in 599 ms of which 1 ms to minimize.
[2024-05-29 12:57:50] [INFO ] Deduced a trap composed of 27 places in 601 ms of which 1 ms to minimize.
[2024-05-29 12:57:51] [INFO ] Deduced a trap composed of 21 places in 573 ms of which 1 ms to minimize.
[2024-05-29 12:57:51] [INFO ] Deduced a trap composed of 33 places in 568 ms of which 2 ms to minimize.
[2024-05-29 12:57:52] [INFO ] Deduced a trap composed of 19 places in 564 ms of which 1 ms to minimize.
[2024-05-29 12:57:53] [INFO ] Deduced a trap composed of 23 places in 562 ms of which 1 ms to minimize.
[2024-05-29 12:57:53] [INFO ] Deduced a trap composed of 26 places in 496 ms of which 2 ms to minimize.
[2024-05-29 12:57:54] [INFO ] Deduced a trap composed of 24 places in 560 ms of which 1 ms to minimize.
[2024-05-29 12:57:54] [INFO ] Deduced a trap composed of 35 places in 528 ms of which 2 ms to minimize.
[2024-05-29 12:57:55] [INFO ] Deduced a trap composed of 20 places in 456 ms of which 2 ms to minimize.
[2024-05-29 12:57:56] [INFO ] Deduced a trap composed of 21 places in 464 ms of which 5 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 12:57:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 12:57:56] [INFO ] After 25313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 597 ms.
Support contains 96 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 504 transitions
Trivial Post-agglo rules discarded 504 transitions
Performed 504 trivial Post agglomeration. Transition count delta: 504
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 2343 transition count 1629
Reduce places removed 504 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 1 with 535 rules applied. Total rules applied 1039 place count 1839 transition count 1598
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1070 place count 1808 transition count 1598
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 122 Pre rules applied. Total rules applied 1070 place count 1808 transition count 1476
Deduced a syphon composed of 122 places in 5 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 244 rules applied. Total rules applied 1314 place count 1686 transition count 1476
Discarding 198 places :
Symmetric choice reduction at 3 with 198 rule applications. Total rules 1512 place count 1488 transition count 1278
Iterating global reduction 3 with 198 rules applied. Total rules applied 1710 place count 1488 transition count 1278
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 1710 place count 1488 transition count 1200
Deduced a syphon composed of 78 places in 6 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 1866 place count 1410 transition count 1200
Performed 462 Post agglomeration using F-continuation condition.Transition count delta: 462
Deduced a syphon composed of 462 places in 4 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 3 with 924 rules applied. Total rules applied 2790 place count 948 transition count 738
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 2936 place count 875 transition count 738
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 2941 place count 875 transition count 733
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2946 place count 870 transition count 733
Partial Free-agglomeration rule applied 70 times.
Drop transitions removed 70 transitions
Iterating global reduction 4 with 70 rules applied. Total rules applied 3016 place count 870 transition count 733
Applied a total of 3016 rules in 791 ms. Remains 870 /2343 variables (removed 1473) and now considering 733/2133 (removed 1400) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 791 ms. Remains : 870/2343 places, 733/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 8) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 733 rows 870 cols
[2024-05-29 12:57:58] [INFO ] Computed 331 invariants in 8 ms
[2024-05-29 12:57:58] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 12:57:58] [INFO ] [Nat]Absence check using 331 positive place invariants in 62 ms returned sat
[2024-05-29 12:57:59] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 12:57:59] [INFO ] State equation strengthened by 165 read => feed constraints.
[2024-05-29 12:58:00] [INFO ] After 1006ms SMT Verify possible using 165 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 2 ms to minimize.
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 0 ms to minimize.
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 1 ms to minimize.
[2024-05-29 12:58:01] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1341 ms
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-05-29 12:58:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 376 ms
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 484 ms
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2024-05-29 12:58:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2024-05-29 12:58:04] [INFO ] After 4277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 737 ms.
[2024-05-29 12:58:04] [INFO ] After 6157ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 126 ms.
Support contains 94 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 733/733 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 870 transition count 732
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 869 transition count 732
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 868 transition count 732
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 868 transition count 732
Applied a total of 5 rules in 180 ms. Remains 868 /870 variables (removed 2) and now considering 732/733 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 868/870 places, 732/733 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 118883 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118883 steps, saw 93574 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 732 rows 868 cols
[2024-05-29 12:58:08] [INFO ] Computed 331 invariants in 12 ms
[2024-05-29 12:58:08] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 12:58:09] [INFO ] [Nat]Absence check using 331 positive place invariants in 59 ms returned sat
[2024-05-29 12:58:10] [INFO ] After 725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 12:58:10] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-05-29 12:58:10] [INFO ] After 841ms SMT Verify possible using 167 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 12:58:11] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-29 12:58:11] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-29 12:58:11] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 12:58:11] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2024-05-29 12:58:11] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2024-05-29 12:58:11] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2024-05-29 12:58:12] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 0 ms to minimize.
[2024-05-29 12:58:12] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 0 ms to minimize.
[2024-05-29 12:58:12] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 1 ms to minimize.
[2024-05-29 12:58:12] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2024-05-29 12:58:12] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2024-05-29 12:58:12] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 1 ms to minimize.
[2024-05-29 12:58:13] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 2 ms to minimize.
[2024-05-29 12:58:13] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 2 ms to minimize.
[2024-05-29 12:58:13] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-05-29 12:58:13] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2024-05-29 12:58:13] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2024-05-29 12:58:13] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 0 ms to minimize.
[2024-05-29 12:58:14] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 0 ms to minimize.
[2024-05-29 12:58:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3105 ms
[2024-05-29 12:58:14] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2024-05-29 12:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-29 12:58:14] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 12:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-29 12:58:15] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 0 ms to minimize.
[2024-05-29 12:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2024-05-29 12:58:15] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2024-05-29 12:58:15] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2024-05-29 12:58:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2024-05-29 12:58:15] [INFO ] After 5518ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1507 ms.
[2024-05-29 12:58:17] [INFO ] After 8096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 201 ms.
Support contains 94 out of 868 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 732/732 transitions.
Applied a total of 0 rules in 61 ms. Remains 868 /868 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 868/868 places, 732/732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 868/868 places, 732/732 transitions.
Applied a total of 0 rules in 55 ms. Remains 868 /868 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-29 12:58:17] [INFO ] Invariant cache hit.
[2024-05-29 12:58:17] [INFO ] Implicit Places using invariants in 465 ms returned []
[2024-05-29 12:58:17] [INFO ] Invariant cache hit.
[2024-05-29 12:58:18] [INFO ] State equation strengthened by 167 read => feed constraints.
[2024-05-29 12:58:20] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 2716 ms to find 0 implicit places.
[2024-05-29 12:58:20] [INFO ] Redundant transitions in 43 ms returned []
[2024-05-29 12:58:20] [INFO ] Invariant cache hit.
[2024-05-29 12:58:20] [INFO ] Dead Transitions using invariants and state equation in 418 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3253 ms. Remains : 868/868 places, 732/732 transitions.
Partial Free-agglomeration rule applied 153 times.
Drop transitions removed 153 transitions
Iterating global reduction 0 with 153 rules applied. Total rules applied 153 place count 868 transition count 732
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 868 transition count 731
Applied a total of 154 rules in 146 ms. Remains 868 /868 variables (removed 0) and now considering 731/732 (removed 1) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 731 rows 868 cols
[2024-05-29 12:58:20] [INFO ] Computed 331 invariants in 11 ms
[2024-05-29 12:58:20] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 12:58:21] [INFO ] [Nat]Absence check using 331 positive place invariants in 66 ms returned sat
[2024-05-29 12:58:22] [INFO ] After 710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 12:58:22] [INFO ] State equation strengthened by 118 read => feed constraints.
[2024-05-29 12:58:22] [INFO ] After 755ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-05-29 12:58:23] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 12:58:23] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-29 12:58:23] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 12:58:23] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2024-05-29 12:58:23] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2024-05-29 12:58:23] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 12:58:23] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2024-05-29 12:58:24] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 12:58:24] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 0 ms to minimize.
[2024-05-29 12:58:24] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 1 ms to minimize.
[2024-05-29 12:58:24] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-29 12:58:24] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-05-29 12:58:24] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-29 12:58:24] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 0 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 1 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 0 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 1 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-29 12:58:25] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3254 ms
[2024-05-29 12:58:26] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 371 ms
[2024-05-29 12:58:26] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 0 ms to minimize.
[2024-05-29 12:58:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2024-05-29 12:58:27] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:58:27] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:58:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2024-05-29 12:58:27] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 12:58:27] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2024-05-29 12:58:27] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 0 ms to minimize.
[2024-05-29 12:58:27] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 12:58:27] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-29 12:58:28] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 12:58:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 750 ms
[2024-05-29 12:58:28] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-05-29 12:58:28] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 12:58:28] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2024-05-29 12:58:28] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
[2024-05-29 12:58:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 506 ms
[2024-05-29 12:58:28] [INFO ] After 6704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 737 ms.
[2024-05-29 12:58:29] [INFO ] After 8514ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2024-05-29 12:58:29] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 12:58:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 868 places, 732 transitions and 3087 arcs took 5 ms.
[2024-05-29 12:58:29] [INFO ] Flatten gal took : 103 ms
Total runtime 61424 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-030B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
ReachabilityCardinality

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

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

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

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

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

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

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

BK_STOP 1716987512229

--------------------
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/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/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: 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 # 25 (type EXCL) for 9 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 9 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 9 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 9 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 21 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05
lola: result : true
lola: fired transitions : 63
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 22 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 24 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05 (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 # 31 (type EXCL) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 27 (type FNDP) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 30 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
lola: result : true
lola: markings : 85
lola: fired transitions : 84
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 27 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 28 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08 (obsolete)
lola: CANCELED task # 31 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08 (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 # 37 (type EXCL) for 15 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 15 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 15 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 36 (type SRCH) for 15 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-22.sara.
lola: FINISHED task # 36 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
lola: result : true
lola: markings : 44
lola: fired transitions : 43
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 34 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 37 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10 (obsolete)
lola: FINISHED task # 27 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08
lola: result : true
lola: fired transitions : 83
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-34.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 33 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10
lola: result : true
lola: fired transitions : 42
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 # 43 (type EXCL) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 39 (type FNDP) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type EQUN) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 42 (type SRCH) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-28.sara.
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: 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: rewrite Frontend/Parser/formula_rewrite.k:711
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: FINISHED task # 39 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
lola: result : true
lola: fired transitions : 40
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 42 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14
lola: result : true
lola: markings : 42
lola: fired transitions : 41
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 40 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14 (obsolete)
lola: CANCELED task # 43 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14 (obsolete)
lola: LAUNCH task # 62 (type EXCL) for 6 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 45 (type FNDP) for 0 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type EQUN) for 0 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 48 (type SRCH) for 0 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/370/ReachabilityCardinality-40.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 48 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
lola: result : false
lola: markings : 7841
lola: fired transitions : 26785
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 45 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 46 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01 (obsolete)
lola: LAUNCH task # 51 (type FNDP) for 3 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type EQUN) for 3 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type SRCH) for 3 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 45 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01
lola: result : unknown
lola: fired transitions : 25929
lola: tried executions : 1026
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 54 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
lola: result : true
lola: markings : 45
lola: fired transitions : 44
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 51 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02 (obsolete)
lola: CANCELED task # 52 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02 (obsolete)
lola: LAUNCH task # 58 (type FNDP) for 6 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type EQUN) for 6 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 61 (type SRCH) for 6 ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 51 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02
lola: result : true
lola: fired transitions : 43
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: FINISHED task # 61 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03
lola: result : true
lola: markings : 68
lola: fired transitions : 67
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 58 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 59 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03 (obsolete)
lola: CANCELED task # 62 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-030B-ReachabilityCardinality-2024-01: EF false tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-2024-02: EF true tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-2024-03: AG false tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-2024-05: EF true findpath
ShieldPPPt-PT-030B-ReachabilityCardinality-2024-08: EF true tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-2024-10: EF true tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-2024-14: EF true findpath


Time elapsed: 2 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-030B"
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-030B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789200409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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