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.r395-oct2-167903719100686.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 smartxred
Input is ShieldPPPt-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903719100686
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 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.5K 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 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 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 955K 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-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679578096205

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 13:28:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 13:28:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:28:20] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2023-03-23 13:28:20] [INFO ] Transformed 3903 places.
[2023-03-23 13:28:20] [INFO ] Transformed 3553 transitions.
[2023-03-23 13:28:20] [INFO ] Found NUPN structural information;
[2023-03-23 13:28:20] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 944 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 13) seen :8
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2023-03-23 13:28:21] [INFO ] Computed 551 place invariants in 79 ms
[2023-03-23 13:28:24] [INFO ] [Real]Absence check using 551 positive place invariants in 655 ms returned sat
[2023-03-23 13:28:24] [INFO ] After 2562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 13:28:26] [INFO ] [Nat]Absence check using 551 positive place invariants in 413 ms returned sat
[2023-03-23 13:28:35] [INFO ] After 8487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 13:28:37] [INFO ] Deduced a trap composed of 27 places in 1344 ms of which 17 ms to minimize.
[2023-03-23 13:28:40] [INFO ] Deduced a trap composed of 36 places in 2158 ms of which 3 ms to minimize.
[2023-03-23 13:28:41] [INFO ] Deduced a trap composed of 18 places in 1206 ms of which 34 ms to minimize.
[2023-03-23 13:28:43] [INFO ] Deduced a trap composed of 32 places in 1231 ms of which 2 ms to minimize.
[2023-03-23 13:28:44] [INFO ] Deduced a trap composed of 25 places in 1592 ms of which 33 ms to minimize.
[2023-03-23 13:28:46] [INFO ] Deduced a trap composed of 25 places in 1682 ms of which 3 ms to minimize.
[2023-03-23 13:28:48] [INFO ] Deduced a trap composed of 21 places in 1734 ms of which 3 ms to minimize.
[2023-03-23 13:28:50] [INFO ] Deduced a trap composed of 35 places in 1327 ms of which 4 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-23 13:28:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 13:28:50] [INFO ] After 25611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1211 ms.
Support contains 48 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 922 transitions
Trivial Post-agglo rules discarded 922 transitions
Performed 922 trivial Post agglomeration. Transition count delta: 922
Iterating post reduction 0 with 922 rules applied. Total rules applied 922 place count 3903 transition count 2631
Reduce places removed 922 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 924 rules applied. Total rules applied 1846 place count 2981 transition count 2629
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 14 rules applied. Total rules applied 1860 place count 2980 transition count 2616
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1873 place count 2967 transition count 2616
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1873 place count 2967 transition count 2417
Deduced a syphon composed of 199 places in 16 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 2271 place count 2768 transition count 2417
Discarding 339 places :
Symmetric choice reduction at 4 with 339 rule applications. Total rules 2610 place count 2429 transition count 2078
Iterating global reduction 4 with 339 rules applied. Total rules applied 2949 place count 2429 transition count 2078
Performed 146 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 146 Pre rules applied. Total rules applied 2949 place count 2429 transition count 1932
Deduced a syphon composed of 146 places in 13 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 4 with 292 rules applied. Total rules applied 3241 place count 2283 transition count 1932
Performed 826 Post agglomeration using F-continuation condition.Transition count delta: 826
Deduced a syphon composed of 826 places in 23 ms
Reduce places removed 826 places and 0 transitions.
Iterating global reduction 4 with 1652 rules applied. Total rules applied 4893 place count 1457 transition count 1106
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 5095 place count 1356 transition count 1106
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 5175 place count 1316 transition count 1106
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 5179 place count 1316 transition count 1102
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 5183 place count 1312 transition count 1102
Partial Free-agglomeration rule applied 142 times.
Drop transitions removed 142 transitions
Iterating global reduction 5 with 142 rules applied. Total rules applied 5325 place count 1312 transition count 1102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5326 place count 1311 transition count 1101
Applied a total of 5326 rules in 1810 ms. Remains 1311 /3903 variables (removed 2592) and now considering 1101/3553 (removed 2452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1811 ms. Remains : 1311/3903 places, 1101/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 50381 steps, run timeout after 3004 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50381 steps, saw 33101 distinct states, run finished after 3009 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1101 rows 1311 cols
[2023-03-23 13:28:56] [INFO ] Computed 551 place invariants in 7 ms
[2023-03-23 13:28:57] [INFO ] [Real]Absence check using 551 positive place invariants in 259 ms returned sat
[2023-03-23 13:28:57] [INFO ] After 564ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 13:28:57] [INFO ] [Nat]Absence check using 551 positive place invariants in 156 ms returned sat
[2023-03-23 13:28:59] [INFO ] After 1526ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 13:28:59] [INFO ] State equation strengthened by 215 read => feed constraints.
[2023-03-23 13:29:00] [INFO ] After 1093ms SMT Verify possible using 215 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 13:29:00] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-23 13:29:01] [INFO ] Deduced a trap composed of 6 places in 784 ms of which 1 ms to minimize.
[2023-03-23 13:29:01] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 0 ms to minimize.
[2023-03-23 13:29:02] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 0 ms to minimize.
[2023-03-23 13:29:02] [INFO ] Deduced a trap composed of 9 places in 416 ms of which 1 ms to minimize.
[2023-03-23 13:29:02] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 1 ms to minimize.
[2023-03-23 13:29:03] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 0 ms to minimize.
[2023-03-23 13:29:03] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 1 ms to minimize.
[2023-03-23 13:29:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3049 ms
[2023-03-23 13:29:04] [INFO ] Deduced a trap composed of 5 places in 301 ms of which 0 ms to minimize.
[2023-03-23 13:29:04] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 13 ms to minimize.
[2023-03-23 13:29:04] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-23 13:29:05] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 1 ms to minimize.
[2023-03-23 13:29:05] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 0 ms to minimize.
[2023-03-23 13:29:06] [INFO ] Deduced a trap composed of 5 places in 790 ms of which 1 ms to minimize.
[2023-03-23 13:29:06] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 1 ms to minimize.
[2023-03-23 13:29:07] [INFO ] Deduced a trap composed of 7 places in 496 ms of which 1 ms to minimize.
[2023-03-23 13:29:07] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3805 ms
[2023-03-23 13:29:08] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 0 ms to minimize.
[2023-03-23 13:29:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 539 ms
[2023-03-23 13:29:09] [INFO ] After 9831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1245 ms.
[2023-03-23 13:29:10] [INFO ] After 13288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 228 ms.
Support contains 48 out of 1311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 1101/1101 transitions.
Applied a total of 0 rules in 42 ms. Remains 1311 /1311 variables (removed 0) and now considering 1101/1101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1311/1311 places, 1101/1101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1311/1311 places, 1101/1101 transitions.
Applied a total of 0 rules in 40 ms. Remains 1311 /1311 variables (removed 0) and now considering 1101/1101 (removed 0) transitions.
[2023-03-23 13:29:10] [INFO ] Invariant cache hit.
[2023-03-23 13:29:12] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2023-03-23 13:29:12] [INFO ] Invariant cache hit.
[2023-03-23 13:29:13] [INFO ] State equation strengthened by 215 read => feed constraints.
[2023-03-23 13:29:18] [INFO ] Implicit Places using invariants and state equation in 5966 ms returned []
Implicit Place search using SMT with State Equation took 7600 ms to find 0 implicit places.
[2023-03-23 13:29:18] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-23 13:29:18] [INFO ] Invariant cache hit.
[2023-03-23 13:29:19] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8768 ms. Remains : 1311/1311 places, 1101/1101 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 1311 transition count 1100
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 1310 transition count 1100
Partial Free-agglomeration rule applied 305 times.
Drop transitions removed 305 transitions
Iterating global reduction 0 with 305 rules applied. Total rules applied 307 place count 1310 transition count 1100
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 308 place count 1310 transition count 1099
Applied a total of 308 rules in 165 ms. Remains 1310 /1311 variables (removed 1) and now considering 1099/1101 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1099 rows 1310 cols
[2023-03-23 13:29:19] [INFO ] Computed 551 place invariants in 8 ms
[2023-03-23 13:29:20] [INFO ] [Real]Absence check using 551 positive place invariants in 122 ms returned sat
[2023-03-23 13:29:20] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 13:29:20] [INFO ] [Nat]Absence check using 551 positive place invariants in 174 ms returned sat
[2023-03-23 13:29:21] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 13:29:21] [INFO ] State equation strengthened by 292 read => feed constraints.
[2023-03-23 13:29:23] [INFO ] After 2234ms SMT Verify possible using 292 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 13:29:24] [INFO ] Deduced a trap composed of 5 places in 379 ms of which 2 ms to minimize.
[2023-03-23 13:29:25] [INFO ] Deduced a trap composed of 7 places in 654 ms of which 1 ms to minimize.
[2023-03-23 13:29:26] [INFO ] Deduced a trap composed of 6 places in 790 ms of which 6 ms to minimize.
[2023-03-23 13:29:26] [INFO ] Deduced a trap composed of 6 places in 699 ms of which 1 ms to minimize.
[2023-03-23 13:29:27] [INFO ] Deduced a trap composed of 6 places in 306 ms of which 1 ms to minimize.
[2023-03-23 13:29:27] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2023-03-23 13:29:27] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 0 ms to minimize.
[2023-03-23 13:29:28] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 1 ms to minimize.
[2023-03-23 13:29:29] [INFO ] Deduced a trap composed of 6 places in 550 ms of which 1 ms to minimize.
[2023-03-23 13:29:29] [INFO ] Deduced a trap composed of 7 places in 520 ms of which 1 ms to minimize.
[2023-03-23 13:29:30] [INFO ] Deduced a trap composed of 7 places in 661 ms of which 1 ms to minimize.
[2023-03-23 13:29:30] [INFO ] Deduced a trap composed of 15 places in 505 ms of which 1 ms to minimize.
[2023-03-23 13:29:31] [INFO ] Deduced a trap composed of 15 places in 381 ms of which 1 ms to minimize.
[2023-03-23 13:29:31] [INFO ] Deduced a trap composed of 8 places in 470 ms of which 23 ms to minimize.
[2023-03-23 13:29:32] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 1 ms to minimize.
[2023-03-23 13:29:32] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 1 ms to minimize.
[2023-03-23 13:29:33] [INFO ] Deduced a trap composed of 9 places in 386 ms of which 13 ms to minimize.
[2023-03-23 13:29:33] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2023-03-23 13:29:33] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 9561 ms
[2023-03-23 13:29:34] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2023-03-23 13:29:34] [INFO ] Deduced a trap composed of 7 places in 289 ms of which 1 ms to minimize.
[2023-03-23 13:29:34] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 0 ms to minimize.
[2023-03-23 13:29:35] [INFO ] Deduced a trap composed of 8 places in 434 ms of which 1 ms to minimize.
[2023-03-23 13:29:35] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 0 ms to minimize.
[2023-03-23 13:29:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2138 ms
[2023-03-23 13:29:36] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2023-03-23 13:29:37] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 22 ms to minimize.
[2023-03-23 13:29:37] [INFO ] Deduced a trap composed of 5 places in 448 ms of which 4 ms to minimize.
[2023-03-23 13:29:38] [INFO ] Deduced a trap composed of 8 places in 741 ms of which 1 ms to minimize.
[2023-03-23 13:29:38] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2023-03-23 13:29:39] [INFO ] Deduced a trap composed of 11 places in 310 ms of which 1 ms to minimize.
[2023-03-23 13:29:39] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 1 ms to minimize.
[2023-03-23 13:29:40] [INFO ] Deduced a trap composed of 7 places in 392 ms of which 1 ms to minimize.
[2023-03-23 13:29:40] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2023-03-23 13:29:41] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-23 13:29:41] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 1 ms to minimize.
[2023-03-23 13:29:42] [INFO ] Deduced a trap composed of 10 places in 415 ms of which 1 ms to minimize.
[2023-03-23 13:29:43] [INFO ] Deduced a trap composed of 11 places in 932 ms of which 1 ms to minimize.
[2023-03-23 13:29:43] [INFO ] Deduced a trap composed of 9 places in 371 ms of which 1 ms to minimize.
[2023-03-23 13:29:43] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 13 ms to minimize.
[2023-03-23 13:29:44] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 38 ms to minimize.
[2023-03-23 13:29:44] [INFO ] Deduced a trap composed of 7 places in 352 ms of which 0 ms to minimize.
[2023-03-23 13:29:45] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 2 ms to minimize.
[2023-03-23 13:29:45] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 3 ms to minimize.
[2023-03-23 13:29:46] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 0 ms to minimize.
[2023-03-23 13:29:46] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 9694 ms
[2023-03-23 13:29:47] [INFO ] Deduced a trap composed of 6 places in 441 ms of which 1 ms to minimize.
[2023-03-23 13:29:47] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 1 ms to minimize.
[2023-03-23 13:29:48] [INFO ] Deduced a trap composed of 11 places in 387 ms of which 1 ms to minimize.
[2023-03-23 13:29:48] [INFO ] Deduced a trap composed of 9 places in 271 ms of which 0 ms to minimize.
[2023-03-23 13:29:49] [INFO ] Deduced a trap composed of 7 places in 489 ms of which 0 ms to minimize.
[2023-03-23 13:29:49] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2023-03-23 13:29:50] [INFO ] Deduced a trap composed of 9 places in 469 ms of which 1 ms to minimize.
[2023-03-23 13:29:50] [INFO ] Deduced a trap composed of 13 places in 374 ms of which 0 ms to minimize.
[2023-03-23 13:29:51] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 0 ms to minimize.
[2023-03-23 13:29:51] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 0 ms to minimize.
[2023-03-23 13:29:51] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2023-03-23 13:29:52] [INFO ] Deduced a trap composed of 7 places in 485 ms of which 0 ms to minimize.
[2023-03-23 13:29:53] [INFO ] Deduced a trap composed of 10 places in 994 ms of which 0 ms to minimize.
[2023-03-23 13:29:54] [INFO ] Deduced a trap composed of 10 places in 498 ms of which 0 ms to minimize.
[2023-03-23 13:29:54] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2023-03-23 13:29:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 7861 ms
[2023-03-23 13:29:54] [INFO ] After 32971ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3489 ms.
[2023-03-23 13:29:58] [INFO ] After 38004ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-23 13:29:58] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-23 13:29:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1311 places, 1101 transitions and 4951 arcs took 7 ms.
[2023-03-23 13:29:58] [INFO ] Flatten gal took : 153 ms
Total runtime 99034 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPt (PT), instance 050B
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1311 places, 1101 transitions, 4951 arcs.
Final Score: 77145.08
Took : 49 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPt-PT-050B-ReachabilityCardinality-02 (reachable & potential(( ( ( (tk(P575)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P575)) ) ) & ( ( ( (tk(P930)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P930)) ) ) & ( ( (tk(P102)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P102)) ) ) ) )))
PROPERTY: ShieldPPPt-PT-050B-ReachabilityCardinality-03 (reachable &!potential( ( ( ( (tk(P602)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P602)) ) ) | ( ( ( ( (tk(P104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P104)) ) ) & ( ( ( (tk(P296)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P296)) ) ) & ( ( (tk(P396)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P396)) ) ) ) ) & ( ( ( (tk(P649)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P649)) ) ) & ( ( ( ( (tk(P623)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P623)) ) ) | ( ( ( (tk(P177)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P177)) ) ) | ( ( ( (tk(P680)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P680)) ) ) & ( ( ( (tk(P844)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P844)) ) ) | ( ( ( (tk(P951)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P951)) ) ) | ( ( (tk(P128)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P128)) ) ) ) ) ) ) ) & ( ( ( (tk(P527)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P527)) ) ) | ( ( (tk(P400)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P400)) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-050B-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( (tk(P162)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P162)) ) ) | ( ( (tk(P54)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P54)) ) ) ) | ( ( ( ( (tk(P1101)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1101)) ) ) & ( ( (tk(P839)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P839)) ) ) ) | ( ( ( (tk(P32)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P32)) ) ) & ( ( ( ( (tk(P1271)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1271)) ) ) | ( ( ( (tk(P1080)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1080)) ) ) | ( ( (tk(P734)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P734)) ) ) ) ) | ( ( ( ( ( (tk(P1307)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1307)) ) ) & ( ( (tk(P789)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P789)) ) ) ) & ( ( ( (tk(P245)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P245)) ) ) & ( ( (tk(P1310)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1310)) ) ) ) ) | ( ( ( ( ( (tk(P633)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P633)) ) ) & ( ( (tk(P1195)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1195)) ) ) ) & ( ( ( (tk(P768)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P768)) ) ) & ( ( ( (tk(P170)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P170)) ) ) & ( ( (tk(P87)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P87)) ) ) ) ) ) | ( ( ( ( (tk(P4)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P4)) ) ) & ( ( (tk(P95)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P95)) ) ) ) & ( ( ( (tk(P1201)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1201)) ) ) & ( ( ( ( (tk(P1193)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1193)) ) ) | ( ( ( ( (tk(P637)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P637)) ) ) & ( ( (tk(P159)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P159)) ) ) ) | ( ( ( (tk(P1302)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1302)) ) ) & ( ( (tk(P739)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P739)) ) ) ) ) ) & ( ( ( (tk(P897)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P897)) ) ) | ( ( (tk(P382)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P382)) ) ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPt-PT-050B-ReachabilityCardinality-15 (reachable & potential(( ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) & ( ( (tk(P707)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P707)) ) ) ) & ( ( ( (tk(P1028)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1028)) ) ) & ( ( ( (tk(P685)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P685)) ) ) | ( ( (tk(P78)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P78)) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 3769928 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102240 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-050B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ShieldPPPt-PT-050B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r395-oct2-167903719100686"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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