Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 762K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679280071399

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:41:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:41:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:41:13] [INFO ] Load time of PNML (sax parser for PT used): 175 ms
[2023-03-20 02:41:13] [INFO ] Transformed 3123 places.
[2023-03-20 02:41:13] [INFO ] Transformed 2843 transitions.
[2023-03-20 02:41:13] [INFO ] Found NUPN structural information;
[2023-03-20 02:41:13] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 367 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 560 ms. (steps per millisecond=17 ) properties (out of 14) seen :3
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-20 02:41:15] [INFO ] Computed 441 place invariants in 29 ms
[2023-03-20 02:41:16] [INFO ] [Real]Absence check using 441 positive place invariants in 265 ms returned sat
[2023-03-20 02:41:16] [INFO ] After 1764ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 02:41:18] [INFO ] [Nat]Absence check using 441 positive place invariants in 291 ms returned sat
[2023-03-20 02:41:25] [INFO ] After 5670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 02:41:26] [INFO ] Deduced a trap composed of 22 places in 1014 ms of which 10 ms to minimize.
[2023-03-20 02:41:27] [INFO ] Deduced a trap composed of 23 places in 947 ms of which 6 ms to minimize.
[2023-03-20 02:41:28] [INFO ] Deduced a trap composed of 24 places in 876 ms of which 7 ms to minimize.
[2023-03-20 02:41:29] [INFO ] Deduced a trap composed of 28 places in 915 ms of which 27 ms to minimize.
[2023-03-20 02:41:30] [INFO ] Deduced a trap composed of 32 places in 933 ms of which 3 ms to minimize.
[2023-03-20 02:41:31] [INFO ] Deduced a trap composed of 34 places in 994 ms of which 2 ms to minimize.
[2023-03-20 02:41:32] [INFO ] Deduced a trap composed of 33 places in 973 ms of which 15 ms to minimize.
[2023-03-20 02:41:33] [INFO ] Deduced a trap composed of 22 places in 1077 ms of which 4 ms to minimize.
[2023-03-20 02:41:35] [INFO ] Deduced a trap composed of 25 places in 898 ms of which 2 ms to minimize.
[2023-03-20 02:41:36] [INFO ] Deduced a trap composed of 56 places in 868 ms of which 2 ms to minimize.
[2023-03-20 02:41:37] [INFO ] Deduced a trap composed of 13 places in 839 ms of which 2 ms to minimize.
[2023-03-20 02:41:37] [INFO ] Deduced a trap composed of 27 places in 779 ms of which 8 ms to minimize.
[2023-03-20 02:41:38] [INFO ] Deduced a trap composed of 44 places in 820 ms of which 1 ms to minimize.
[2023-03-20 02:41:39] [INFO ] Deduced a trap composed of 35 places in 789 ms of which 2 ms to minimize.
[2023-03-20 02:41:40] [INFO ] Deduced a trap composed of 53 places in 710 ms of which 1 ms to minimize.
[2023-03-20 02:41:41] [INFO ] Deduced a trap composed of 56 places in 664 ms of which 2 ms to minimize.
[2023-03-20 02:41:42] [INFO ] Deduced a trap composed of 45 places in 712 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:41:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:41:42] [INFO ] After 25365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1283 ms.
Support contains 104 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 686 place count 3123 transition count 2157
Reduce places removed 686 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 688 rules applied. Total rules applied 1374 place count 2437 transition count 2155
Reduce places removed 1 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 31 rules applied. Total rules applied 1405 place count 2436 transition count 2125
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1435 place count 2406 transition count 2125
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 1435 place count 2406 transition count 1956
Deduced a syphon composed of 169 places in 6 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1773 place count 2237 transition count 1956
Discarding 258 places :
Symmetric choice reduction at 4 with 258 rule applications. Total rules 2031 place count 1979 transition count 1698
Iterating global reduction 4 with 258 rules applied. Total rules applied 2289 place count 1979 transition count 1698
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 2289 place count 1979 transition count 1597
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2491 place count 1878 transition count 1597
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Deduced a syphon composed of 632 places in 6 ms
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 4 with 1264 rules applied. Total rules applied 3755 place count 1246 transition count 965
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 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3957 place count 1145 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3959 place count 1144 transition count 965
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3965 place count 1144 transition count 959
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 3971 place count 1138 transition count 959
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 4071 place count 1138 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4072 place count 1137 transition count 958
Applied a total of 4072 rules in 1044 ms. Remains 1137 /3123 variables (removed 1986) and now considering 958/2843 (removed 1885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1045 ms. Remains : 1137/3123 places, 958/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=25 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 82845 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82845 steps, saw 54012 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 958 rows 1137 cols
[2023-03-20 02:41:48] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-20 02:41:49] [INFO ] [Real]Absence check using 441 positive place invariants in 130 ms returned sat
[2023-03-20 02:41:49] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 02:41:49] [INFO ] [Nat]Absence check using 441 positive place invariants in 68 ms returned sat
[2023-03-20 02:41:50] [INFO ] After 1230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 02:41:50] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-20 02:41:53] [INFO ] After 3021ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 02:41:54] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2023-03-20 02:41:54] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 0 ms to minimize.
[2023-03-20 02:41:54] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-20 02:41:54] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2023-03-20 02:41:55] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 5 ms to minimize.
[2023-03-20 02:41:55] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 0 ms to minimize.
[2023-03-20 02:41:55] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-20 02:41:55] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2023-03-20 02:41:56] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:41:56] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-20 02:41:56] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2023-03-20 02:41:56] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 21 ms to minimize.
[2023-03-20 02:41:56] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-20 02:41:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2753 ms
[2023-03-20 02:41:57] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-20 02:41:57] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2023-03-20 02:41:57] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 1 ms to minimize.
[2023-03-20 02:41:57] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2023-03-20 02:41:58] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2023-03-20 02:41:58] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-20 02:41:58] [INFO ] Deduced a trap composed of 7 places in 338 ms of which 2 ms to minimize.
[2023-03-20 02:41:58] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 1 ms to minimize.
[2023-03-20 02:41:59] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2023-03-20 02:41:59] [INFO ] Deduced a trap composed of 7 places in 239 ms of which 0 ms to minimize.
[2023-03-20 02:41:59] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-20 02:41:59] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 1 ms to minimize.
[2023-03-20 02:42:00] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:42:00] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:42:00] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 2 ms to minimize.
[2023-03-20 02:42:00] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3874 ms
[2023-03-20 02:42:01] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2023-03-20 02:42:01] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 0 ms to minimize.
[2023-03-20 02:42:01] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2023-03-20 02:42:01] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2023-03-20 02:42:02] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-20 02:42:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1444 ms
[2023-03-20 02:42:02] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 14 ms to minimize.
[2023-03-20 02:42:02] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-03-20 02:42:03] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:42:03] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 9 ms to minimize.
[2023-03-20 02:42:03] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-20 02:42:04] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-20 02:42:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1752 ms
[2023-03-20 02:42:04] [INFO ] Deduced a trap composed of 6 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:42:04] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2023-03-20 02:42:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2023-03-20 02:42:06] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-20 02:42:07] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 0 ms to minimize.
[2023-03-20 02:42:07] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2023-03-20 02:42:07] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2023-03-20 02:42:07] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 1 ms to minimize.
[2023-03-20 02:42:08] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 10 ms to minimize.
[2023-03-20 02:42:08] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 4 ms to minimize.
[2023-03-20 02:42:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1887 ms
[2023-03-20 02:42:08] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-20 02:42:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-20 02:42:09] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 1 ms to minimize.
[2023-03-20 02:42:09] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 20 ms to minimize.
[2023-03-20 02:42:09] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 3 ms to minimize.
[2023-03-20 02:42:09] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2023-03-20 02:42:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 913 ms
[2023-03-20 02:42:09] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-20 02:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-20 02:42:10] [INFO ] After 19100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1564 ms.
[2023-03-20 02:42:11] [INFO ] After 22515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 168 ms.
Support contains 104 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 958/958 transitions.
Applied a total of 0 rules in 47 ms. Remains 1137 /1137 variables (removed 0) and now considering 958/958 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1137/1137 places, 958/958 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 958/958 transitions.
Applied a total of 0 rules in 55 ms. Remains 1137 /1137 variables (removed 0) and now considering 958/958 (removed 0) transitions.
[2023-03-20 02:42:11] [INFO ] Invariant cache hit.
[2023-03-20 02:42:12] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-20 02:42:12] [INFO ] Invariant cache hit.
[2023-03-20 02:42:13] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-20 02:42:16] [INFO ] Implicit Places using invariants and state equation in 3791 ms returned []
Implicit Place search using SMT with State Equation took 4346 ms to find 0 implicit places.
[2023-03-20 02:42:16] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 02:42:16] [INFO ] Invariant cache hit.
[2023-03-20 02:42:16] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5072 ms. Remains : 1137/1137 places, 958/958 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1137 transition count 957
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1136 transition count 957
Partial Free-agglomeration rule applied 216 times.
Drop transitions removed 216 transitions
Iterating global reduction 0 with 216 rules applied. Total rules applied 218 place count 1136 transition count 957
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 221 place count 1136 transition count 954
Applied a total of 221 rules in 94 ms. Remains 1136 /1137 variables (removed 1) and now considering 954/958 (removed 4) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 954 rows 1136 cols
[2023-03-20 02:42:17] [INFO ] Computed 441 place invariants in 9 ms
[2023-03-20 02:42:17] [INFO ] [Real]Absence check using 441 positive place invariants in 81 ms returned sat
[2023-03-20 02:42:17] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 02:42:17] [INFO ] [Nat]Absence check using 441 positive place invariants in 113 ms returned sat
[2023-03-20 02:42:19] [INFO ] After 1156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 02:42:19] [INFO ] State equation strengthened by 179 read => feed constraints.
[2023-03-20 02:42:21] [INFO ] After 2243ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 02:42:21] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 0 ms to minimize.
[2023-03-20 02:42:22] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:42:22] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2023-03-20 02:42:22] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 1 ms to minimize.
[2023-03-20 02:42:22] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2023-03-20 02:42:22] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2023-03-20 02:42:23] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 0 ms to minimize.
[2023-03-20 02:42:23] [INFO ] Deduced a trap composed of 8 places in 188 ms of which 1 ms to minimize.
[2023-03-20 02:42:23] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2023-03-20 02:42:23] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2023-03-20 02:42:24] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-20 02:42:24] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2023-03-20 02:42:24] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 0 ms to minimize.
[2023-03-20 02:42:24] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-20 02:42:25] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 0 ms to minimize.
[2023-03-20 02:42:25] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2023-03-20 02:42:25] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-20 02:42:25] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3901 ms
[2023-03-20 02:42:26] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 0 ms to minimize.
[2023-03-20 02:42:26] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 1 ms to minimize.
[2023-03-20 02:42:26] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2023-03-20 02:42:26] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-20 02:42:26] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:42:27] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 0 ms to minimize.
[2023-03-20 02:42:27] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2023-03-20 02:42:27] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2023-03-20 02:42:27] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 1 ms to minimize.
[2023-03-20 02:42:28] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 1 ms to minimize.
[2023-03-20 02:42:28] [INFO ] Deduced a trap composed of 11 places in 204 ms of which 1 ms to minimize.
[2023-03-20 02:42:28] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-20 02:42:28] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-20 02:42:28] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2023-03-20 02:42:29] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-20 02:42:29] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2023-03-20 02:42:29] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2023-03-20 02:42:29] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 1 ms to minimize.
[2023-03-20 02:42:30] [INFO ] Deduced a trap composed of 16 places in 186 ms of which 0 ms to minimize.
[2023-03-20 02:42:30] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2023-03-20 02:42:30] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4670 ms
[2023-03-20 02:42:30] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-20 02:42:31] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2023-03-20 02:42:31] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-20 02:42:31] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2023-03-20 02:42:31] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 1 ms to minimize.
[2023-03-20 02:42:31] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-20 02:42:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1259 ms
[2023-03-20 02:42:32] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2023-03-20 02:42:32] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 0 ms to minimize.
[2023-03-20 02:42:32] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 0 ms to minimize.
[2023-03-20 02:42:33] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 1 ms to minimize.
[2023-03-20 02:42:33] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2023-03-20 02:42:33] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2023-03-20 02:42:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1598 ms
[2023-03-20 02:42:33] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2023-03-20 02:42:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-20 02:42:35] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-20 02:42:35] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-20 02:42:35] [INFO ] Deduced a trap composed of 7 places in 208 ms of which 1 ms to minimize.
[2023-03-20 02:42:36] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2023-03-20 02:42:36] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 0 ms to minimize.
[2023-03-20 02:42:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1537 ms
[2023-03-20 02:42:37] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 0 ms to minimize.
[2023-03-20 02:42:37] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2023-03-20 02:42:37] [INFO ] Deduced a trap composed of 10 places in 305 ms of which 0 ms to minimize.
[2023-03-20 02:42:37] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-20 02:42:38] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-20 02:42:38] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-20 02:42:38] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 0 ms to minimize.
[2023-03-20 02:42:38] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 1 ms to minimize.
[2023-03-20 02:42:39] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 0 ms to minimize.
[2023-03-20 02:42:39] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 1 ms to minimize.
[2023-03-20 02:42:39] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-20 02:42:40] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 1 ms to minimize.
[2023-03-20 02:42:40] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 0 ms to minimize.
[2023-03-20 02:42:40] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3860 ms
[2023-03-20 02:42:41] [INFO ] Deduced a trap composed of 5 places in 394 ms of which 0 ms to minimize.
[2023-03-20 02:42:41] [INFO ] Deduced a trap composed of 7 places in 226 ms of which 3 ms to minimize.
[2023-03-20 02:42:41] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:42:42] [INFO ] Deduced a trap composed of 12 places in 539 ms of which 1 ms to minimize.
[2023-03-20 02:42:42] [INFO ] Deduced a trap composed of 8 places in 315 ms of which 0 ms to minimize.
[2023-03-20 02:42:42] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2023-03-20 02:42:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2311 ms
[2023-03-20 02:42:43] [INFO ] Deduced a trap composed of 11 places in 330 ms of which 0 ms to minimize.
[2023-03-20 02:42:43] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 1 ms to minimize.
[2023-03-20 02:42:43] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-20 02:42:44] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 1 ms to minimize.
[2023-03-20 02:42:44] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-20 02:42:44] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 0 ms to minimize.
[2023-03-20 02:42:44] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 0 ms to minimize.
[2023-03-20 02:42:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1692 ms
[2023-03-20 02:42:44] [INFO ] After 25400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 1804 ms.
[2023-03-20 02:42:46] [INFO ] After 29133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-20 02:42:46] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 18 ms.
[2023-03-20 02:42:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1137 places, 958 transitions and 4097 arcs took 12 ms.
[2023-03-20 02:42:46] [INFO ] Flatten gal took : 124 ms
Total runtime 93422 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-040B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
ReachabilityCardinality

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

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

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

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679280169449

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/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: 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 # 31 (type EXCL) for 0 ShieldPPPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 399 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 27 (type FNDP) for 0 ShieldPPPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 0 ShieldPPPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SRCH) for 0 ShieldPPPt-PT-040B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 30 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-00
lola: result : true
lola: markings : 53
lola: fired transitions : 52
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-040B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 28 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 31 (type EXCL) for ShieldPPPt-PT-040B-ReachabilityCardinality-00 (obsolete)
lola: FINISHED task # 27 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-00
lola: result : true
lola: fired transitions : 51
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/380/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: LAUNCH task # 37 (type EXCL) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-01
lola: time limit : 449 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 3 ShieldPPPt-PT-040B-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: FINISHED task # 36 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-01
lola: result : true
lola: markings : 112
lola: fired transitions : 111
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 33 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 34 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 37 (type EXCL) for ShieldPPPt-PT-040B-ReachabilityCardinality-01 (obsolete)
lola: LAUNCH task # 49 (type EXCL) for 18 ShieldPPPt-PT-040B-ReachabilityCardinality-08
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 40 (type FNDP) for 6 ShieldPPPt-PT-040B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 6 ShieldPPPt-PT-040B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 6 ShieldPPPt-PT-040B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: FINISHED task # 44 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-02
lola: result : true
lola: markings : 46
lola: fired transitions : 45
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 40 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 41 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-02 (obsolete)
lola: LAUNCH task # 51 (type FNDP) for 12 ShieldPPPt-PT-040B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type EQUN) for 12 ShieldPPPt-PT-040B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type SRCH) for 12 ShieldPPPt-PT-040B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 40 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-02
lola: result : true
lola: fired transitions : 44
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 33 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-01
lola: result : true
lola: fired transitions : 110
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 51 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 86
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/380/ReachabilityCardinality-41.sara.
lola: CANCELED task # 52 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 54 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-04 (obsolete)
sara: place or transition ordering is non-deterministic
lola: LAUNCH task # 57 (type FNDP) for 9 ShieldPPPt-PT-040B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 58 (type EQUN) for 9 ShieldPPPt-PT-040B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 60 (type SRCH) for 9 ShieldPPPt-PT-040B-ReachabilityCardinality-03
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: 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:711
sara: try reading problem file /home/mcc/execution/380/ReachabilityCardinality-52.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: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 # 60 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-03
lola: result : true
lola: markings : 28
lola: fired transitions : 27
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 57 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 58 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-03 (obsolete)
lola: LAUNCH task # 77 (type FNDP) for 15 ShieldPPPt-PT-040B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 78 (type EQUN) for 15 ShieldPPPt-PT-040B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 80 (type SRCH) for 15 ShieldPPPt-PT-040B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 57 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-03
lola: result : true
lola: fired transitions : 26
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 80 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-07
lola: result : true
lola: markings : 61
lola: fired transitions : 60
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 77 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 78 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-07 (obsolete)
lola: LAUNCH task # 70 (type FNDP) for 21 ShieldPPPt-PT-040B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 71 (type EQUN) for 21 ShieldPPPt-PT-040B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 73 (type SRCH) for 21 ShieldPPPt-PT-040B-ReachabilityCardinality-11
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 # 49 (type EXCL) for ShieldPPPt-PT-040B-ReachabilityCardinality-08
lola: result : true
lola: markings : 1238
lola: fired transitions : 1446
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 68 (type EXCL) for 24 ShieldPPPt-PT-040B-ReachabilityCardinality-15
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 77 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-07
lola: result : true
lola: fired transitions : 59
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 73 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-11
lola: result : true
lola: markings : 29
lola: fired transitions : 28
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 70 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 71 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-11 (obsolete)
sara: try reading problem file /home/mcc/execution/380/ReachabilityCardinality-58.sara.
lola: LAUNCH task # 64 (type FNDP) for 24 ShieldPPPt-PT-040B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 65 (type EQUN) for 24 ShieldPPPt-PT-040B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 67 (type SRCH) for 24 ShieldPPPt-PT-040B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 70 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-11
lola: result : unknown
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 # 67 (type SRCH) for ShieldPPPt-PT-040B-ReachabilityCardinality-15
lola: result : true
lola: markings : 77
lola: fired transitions : 76
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 64 (type FNDP) for ShieldPPPt-PT-040B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 65 (type EQUN) for ShieldPPPt-PT-040B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 68 (type EXCL) for ShieldPPPt-PT-040B-ReachabilityCardinality-15 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-040B-ReachabilityCardinality-00: EF true tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-01: EF true tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-02: EF true tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-03: EF true tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-04: EF true findpath
ShieldPPPt-PT-040B-ReachabilityCardinality-07: AG false tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-08: EF true tandem / relaxed
ShieldPPPt-PT-040B-ReachabilityCardinality-11: EF true tandem / insertion
ShieldPPPt-PT-040B-ReachabilityCardinality-15: AG false tandem / insertion


Time elapsed: 2 secs. Pages in use: 3

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPt-PT-040B, 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 r391-oct2-167903715600670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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