About the Execution of Smart+red for ShieldPPPs-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15192.500 | 3600000.00 | 3693545.00 | 148.50 | FTTF?TT?FTFTTFTF | normal |
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-167903718800494.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 ShieldPPPs-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718800494
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 01:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 26 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 01:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 708K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-040B-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679570406308
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=ShieldPPPs-PT-040B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 11:20:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 11:20:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:20:08] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2023-03-23 11:20:08] [INFO ] Transformed 2723 places.
[2023-03-23 11:20:08] [INFO ] Transformed 2523 transitions.
[2023-03-23 11:20:08] [INFO ] Found NUPN structural information;
[2023-03-23 11:20:08] [INFO ] Parsed PT model containing 2723 places and 2523 transitions and 6966 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 14) seen :7
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2523 rows 2723 cols
[2023-03-23 11:20:09] [INFO ] Computed 441 place invariants in 50 ms
[2023-03-23 11:20:11] [INFO ] After 1219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 11:20:12] [INFO ] [Nat]Absence check using 441 positive place invariants in 266 ms returned sat
[2023-03-23 11:20:16] [INFO ] After 3637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 11:20:17] [INFO ] Deduced a trap composed of 25 places in 730 ms of which 12 ms to minimize.
[2023-03-23 11:20:17] [INFO ] Deduced a trap composed of 19 places in 741 ms of which 5 ms to minimize.
[2023-03-23 11:20:18] [INFO ] Deduced a trap composed of 26 places in 678 ms of which 2 ms to minimize.
[2023-03-23 11:20:19] [INFO ] Deduced a trap composed of 29 places in 626 ms of which 2 ms to minimize.
[2023-03-23 11:20:20] [INFO ] Deduced a trap composed of 29 places in 772 ms of which 3 ms to minimize.
[2023-03-23 11:20:21] [INFO ] Deduced a trap composed of 33 places in 519 ms of which 2 ms to minimize.
[2023-03-23 11:20:21] [INFO ] Deduced a trap composed of 21 places in 474 ms of which 8 ms to minimize.
[2023-03-23 11:20:22] [INFO ] Deduced a trap composed of 20 places in 558 ms of which 2 ms to minimize.
[2023-03-23 11:20:23] [INFO ] Deduced a trap composed of 38 places in 769 ms of which 3 ms to minimize.
[2023-03-23 11:20:23] [INFO ] Deduced a trap composed of 31 places in 578 ms of which 2 ms to minimize.
[2023-03-23 11:20:24] [INFO ] Deduced a trap composed of 49 places in 575 ms of which 1 ms to minimize.
[2023-03-23 11:20:25] [INFO ] Deduced a trap composed of 51 places in 558 ms of which 2 ms to minimize.
[2023-03-23 11:20:25] [INFO ] Deduced a trap composed of 48 places in 553 ms of which 1 ms to minimize.
[2023-03-23 11:20:26] [INFO ] Deduced a trap composed of 29 places in 484 ms of which 1 ms to minimize.
[2023-03-23 11:20:27] [INFO ] Deduced a trap composed of 36 places in 570 ms of which 2 ms to minimize.
[2023-03-23 11:20:27] [INFO ] Deduced a trap composed of 32 places in 492 ms of which 1 ms to minimize.
[2023-03-23 11:20:28] [INFO ] Deduced a trap composed of 31 places in 536 ms of which 1 ms to minimize.
[2023-03-23 11:20:28] [INFO ] Deduced a trap composed of 29 places in 454 ms of which 1 ms to minimize.
[2023-03-23 11:20:29] [INFO ] Deduced a trap composed of 30 places in 596 ms of which 1 ms to minimize.
[2023-03-23 11:20:30] [INFO ] Deduced a trap composed of 36 places in 476 ms of which 3 ms to minimize.
[2023-03-23 11:20:30] [INFO ] Deduced a trap composed of 32 places in 443 ms of which 1 ms to minimize.
[2023-03-23 11:20:31] [INFO ] Deduced a trap composed of 43 places in 459 ms of which 1 ms to minimize.
[2023-03-23 11:20:31] [INFO ] Deduced a trap composed of 38 places in 488 ms of which 1 ms to minimize.
[2023-03-23 11:20:32] [INFO ] Deduced a trap composed of 42 places in 478 ms of which 1 ms to minimize.
[2023-03-23 11:20:33] [INFO ] Deduced a trap composed of 27 places in 545 ms of which 1 ms to minimize.
[2023-03-23 11:20:33] [INFO ] Deduced a trap composed of 50 places in 520 ms of which 1 ms to minimize.
[2023-03-23 11:20:34] [INFO ] Deduced a trap composed of 48 places in 1027 ms of which 2 ms to minimize.
[2023-03-23 11:20:35] [INFO ] Deduced a trap composed of 50 places in 428 ms of which 4 ms to minimize.
[2023-03-23 11:20:36] [INFO ] Deduced a trap composed of 45 places in 714 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 11:20:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:20:36] [INFO ] After 25112ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 833 ms.
Support contains 101 out of 2723 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 2723 transition count 2282
Reduce places removed 241 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 254 rules applied. Total rules applied 495 place count 2482 transition count 2269
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 508 place count 2469 transition count 2269
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 508 place count 2469 transition count 2070
Deduced a syphon composed of 199 places in 5 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 906 place count 2270 transition count 2070
Discarding 256 places :
Symmetric choice reduction at 3 with 256 rule applications. Total rules 1162 place count 2014 transition count 1814
Iterating global reduction 3 with 256 rules applied. Total rules applied 1418 place count 2014 transition count 1814
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 1418 place count 2014 transition count 1715
Deduced a syphon composed of 99 places in 10 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 1616 place count 1915 transition count 1715
Performed 554 Post agglomeration using F-continuation condition.Transition count delta: 554
Deduced a syphon composed of 554 places in 2 ms
Reduce places removed 554 places and 0 transitions.
Iterating global reduction 3 with 1108 rules applied. Total rules applied 2724 place count 1361 transition count 1161
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 322 times.
Drop transitions removed 322 transitions
Iterating global reduction 3 with 322 rules applied. Total rules applied 3046 place count 1361 transition count 1161
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3047 place count 1360 transition count 1160
Applied a total of 3047 rules in 879 ms. Remains 1360 /2723 variables (removed 1363) and now considering 1160/2523 (removed 1363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 880 ms. Remains : 1360/2723 places, 1160/2523 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 6) seen :4
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-040B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1160 rows 1360 cols
[2023-03-23 11:20:38] [INFO ] Computed 441 place invariants in 44 ms
[2023-03-23 11:20:38] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:20:38] [INFO ] [Nat]Absence check using 420 positive place invariants in 145 ms returned sat
[2023-03-23 11:20:38] [INFO ] [Nat]Absence check using 420 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-23 11:20:45] [INFO ] After 6838ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:20:46] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2023-03-23 11:20:46] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 0 ms to minimize.
[2023-03-23 11:20:46] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-23 11:20:46] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2023-03-23 11:20:47] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 5 ms to minimize.
[2023-03-23 11:20:47] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-23 11:20:47] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 0 ms to minimize.
[2023-03-23 11:20:48] [INFO ] Deduced a trap composed of 29 places in 312 ms of which 0 ms to minimize.
[2023-03-23 11:20:48] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2023-03-23 11:20:48] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2023-03-23 11:20:48] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-23 11:20:49] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-23 11:20:49] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 0 ms to minimize.
[2023-03-23 11:20:49] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-23 11:20:49] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2023-03-23 11:20:50] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 1 ms to minimize.
[2023-03-23 11:20:50] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2023-03-23 11:20:50] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2023-03-23 11:20:50] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 1 ms to minimize.
[2023-03-23 11:20:51] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2023-03-23 11:20:51] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2023-03-23 11:20:51] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2023-03-23 11:20:51] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-23 11:20:52] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 1 ms to minimize.
[2023-03-23 11:20:52] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 0 ms to minimize.
[2023-03-23 11:20:52] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-23 11:20:52] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 5 ms to minimize.
[2023-03-23 11:20:53] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 11 ms to minimize.
[2023-03-23 11:20:53] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-23 11:20:53] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-23 11:20:53] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 0 ms to minimize.
[2023-03-23 11:20:54] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2023-03-23 11:20:54] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2023-03-23 11:20:54] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 0 ms to minimize.
[2023-03-23 11:20:54] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-23 11:20:55] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-23 11:20:55] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2023-03-23 11:20:55] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 0 ms to minimize.
[2023-03-23 11:20:55] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 8 ms to minimize.
[2023-03-23 11:20:55] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 10172 ms
[2023-03-23 11:20:57] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 3 ms to minimize.
[2023-03-23 11:20:57] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-23 11:20:57] [INFO ] Deduced a trap composed of 10 places in 145 ms of which 0 ms to minimize.
[2023-03-23 11:20:58] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 0 ms to minimize.
[2023-03-23 11:20:58] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-23 11:20:58] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2023-03-23 11:20:58] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-23 11:20:59] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 1 ms to minimize.
[2023-03-23 11:20:59] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-23 11:20:59] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 1 ms to minimize.
[2023-03-23 11:21:00] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-23 11:21:00] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2023-03-23 11:21:01] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2023-03-23 11:21:01] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 1 ms to minimize.
[2023-03-23 11:21:01] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-23 11:21:01] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2023-03-23 11:21:01] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2023-03-23 11:21:02] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2023-03-23 11:21:02] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 1 ms to minimize.
[2023-03-23 11:21:02] [INFO ] Deduced a trap composed of 11 places in 159 ms of which 0 ms to minimize.
[2023-03-23 11:21:03] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-23 11:21:03] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2023-03-23 11:21:03] [INFO ] Deduced a trap composed of 11 places in 152 ms of which 0 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 11:21:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:21:03] [INFO ] After 25077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 59 ms.
Support contains 47 out of 1360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1360/1360 places, 1160/1160 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1360 transition count 1150
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1350 transition count 1150
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 20 place count 1350 transition count 1141
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 38 place count 1341 transition count 1141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 1340 transition count 1140
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 1340 transition count 1140
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 124 place count 1298 transition count 1098
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 131 place count 1298 transition count 1098
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 1295 transition count 1095
Applied a total of 134 rules in 539 ms. Remains 1295 /1360 variables (removed 65) and now considering 1095/1160 (removed 65) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 539 ms. Remains : 1295/1360 places, 1095/1160 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 102869 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102869 steps, saw 85433 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1095 rows 1295 cols
[2023-03-23 11:21:07] [INFO ] Computed 441 place invariants in 77 ms
[2023-03-23 11:21:07] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:21:07] [INFO ] [Nat]Absence check using 416 positive place invariants in 64 ms returned sat
[2023-03-23 11:21:07] [INFO ] [Nat]Absence check using 416 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-23 11:21:10] [INFO ] After 2622ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:21:11] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 0 ms to minimize.
[2023-03-23 11:21:11] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2023-03-23 11:21:11] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-23 11:21:11] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-23 11:21:11] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 0 ms to minimize.
[2023-03-23 11:21:12] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-23 11:21:12] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 0 ms to minimize.
[2023-03-23 11:21:12] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 1 ms to minimize.
[2023-03-23 11:21:12] [INFO ] Deduced a trap composed of 24 places in 195 ms of which 1 ms to minimize.
[2023-03-23 11:21:13] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 1 ms to minimize.
[2023-03-23 11:21:13] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 0 ms to minimize.
[2023-03-23 11:21:13] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 15 ms to minimize.
[2023-03-23 11:21:13] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2023-03-23 11:21:14] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 2 ms to minimize.
[2023-03-23 11:21:14] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 0 ms to minimize.
[2023-03-23 11:21:14] [INFO ] Deduced a trap composed of 20 places in 159 ms of which 0 ms to minimize.
[2023-03-23 11:21:14] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 1 ms to minimize.
[2023-03-23 11:21:15] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-23 11:21:15] [INFO ] Deduced a trap composed of 9 places in 230 ms of which 0 ms to minimize.
[2023-03-23 11:21:15] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-23 11:21:15] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 0 ms to minimize.
[2023-03-23 11:21:16] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-23 11:21:16] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 0 ms to minimize.
[2023-03-23 11:21:16] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2023-03-23 11:21:17] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2023-03-23 11:21:17] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 0 ms to minimize.
[2023-03-23 11:21:17] [INFO ] Deduced a trap composed of 18 places in 187 ms of which 0 ms to minimize.
[2023-03-23 11:21:17] [INFO ] Deduced a trap composed of 20 places in 167 ms of which 1 ms to minimize.
[2023-03-23 11:21:18] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 0 ms to minimize.
[2023-03-23 11:21:18] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2023-03-23 11:21:18] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-23 11:21:18] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 3 ms to minimize.
[2023-03-23 11:21:18] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-23 11:21:19] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 0 ms to minimize.
[2023-03-23 11:21:19] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 1 ms to minimize.
[2023-03-23 11:21:19] [INFO ] Deduced a trap composed of 5 places in 296 ms of which 1 ms to minimize.
[2023-03-23 11:21:20] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 0 ms to minimize.
[2023-03-23 11:21:20] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 9280 ms
[2023-03-23 11:21:22] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-23 11:21:23] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-23 11:21:23] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 0 ms to minimize.
[2023-03-23 11:21:23] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-23 11:21:24] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-23 11:21:24] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 0 ms to minimize.
[2023-03-23 11:21:24] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-23 11:21:25] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 1 ms to minimize.
[2023-03-23 11:21:25] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 1 ms to minimize.
[2023-03-23 11:21:26] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-23 11:21:26] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-23 11:21:26] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 0 ms to minimize.
[2023-03-23 11:21:26] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2023-03-23 11:21:27] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2023-03-23 11:21:27] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 1 ms to minimize.
[2023-03-23 11:21:27] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 0 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 0 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-23 11:21:28] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2023-03-23 11:21:29] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:21:29] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 0 ms to minimize.
[2023-03-23 11:21:29] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2023-03-23 11:21:30] [INFO ] Deduced a trap composed of 5 places in 504 ms of which 1 ms to minimize.
[2023-03-23 11:21:31] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 0 ms to minimize.
[2023-03-23 11:21:32] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2023-03-23 11:21:32] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 1 ms to minimize.
[2023-03-23 11:21:32] [INFO ] Trap strengthening (SAT) tested/added 27/27 trap constraints in 10111 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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 11:21:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:21:32] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 70 ms.
Support contains 47 out of 1295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1295/1295 places, 1095/1095 transitions.
Applied a total of 0 rules in 38 ms. Remains 1295 /1295 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1295/1295 places, 1095/1095 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1295/1295 places, 1095/1095 transitions.
Applied a total of 0 rules in 37 ms. Remains 1295 /1295 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2023-03-23 11:21:32] [INFO ] Invariant cache hit.
[2023-03-23 11:21:33] [INFO ] Implicit Places using invariants in 921 ms returned []
[2023-03-23 11:21:33] [INFO ] Invariant cache hit.
[2023-03-23 11:21:35] [INFO ] Implicit Places using invariants and state equation in 1891 ms returned []
Implicit Place search using SMT with State Equation took 2825 ms to find 0 implicit places.
[2023-03-23 11:21:35] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-23 11:21:35] [INFO ] Invariant cache hit.
[2023-03-23 11:21:36] [INFO ] Dead Transitions using invariants and state equation in 638 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3636 ms. Remains : 1295/1295 places, 1095/1095 transitions.
Applied a total of 0 rules in 37 ms. Remains 1295 /1295 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 11:21:36] [INFO ] Invariant cache hit.
[2023-03-23 11:21:36] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:21:36] [INFO ] [Nat]Absence check using 416 positive place invariants in 82 ms returned sat
[2023-03-23 11:21:37] [INFO ] [Nat]Absence check using 416 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-23 11:21:39] [INFO ] After 2175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:21:39] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 0 ms to minimize.
[2023-03-23 11:21:39] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 1 ms to minimize.
[2023-03-23 11:21:39] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 1 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 8 places in 312 ms of which 0 ms to minimize.
[2023-03-23 11:21:40] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 1 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 7 places in 246 ms of which 0 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-23 11:21:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2554 ms
[2023-03-23 11:21:45] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-23 11:21:46] [INFO ] Deduced a trap composed of 8 places in 244 ms of which 0 ms to minimize.
[2023-03-23 11:21:46] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-23 11:21:46] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-23 11:21:47] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-23 11:21:47] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2023-03-23 11:21:47] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 0 ms to minimize.
[2023-03-23 11:21:48] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 1 ms to minimize.
[2023-03-23 11:21:48] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-23 11:21:48] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:21:49] [INFO ] Deduced a trap composed of 7 places in 165 ms of which 1 ms to minimize.
[2023-03-23 11:21:49] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 15 ms to minimize.
[2023-03-23 11:21:49] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 8 ms to minimize.
[2023-03-23 11:21:49] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 0 ms to minimize.
[2023-03-23 11:21:50] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 1 ms to minimize.
[2023-03-23 11:21:50] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 0 ms to minimize.
[2023-03-23 11:21:51] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2023-03-23 11:21:51] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-23 11:21:51] [INFO ] Deduced a trap composed of 7 places in 296 ms of which 0 ms to minimize.
[2023-03-23 11:21:52] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 0 ms to minimize.
[2023-03-23 11:21:52] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2023-03-23 11:21:53] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 0 ms to minimize.
[2023-03-23 11:21:53] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 0 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 1 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 0 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 0 ms to minimize.
[2023-03-23 11:21:54] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 9022 ms
[2023-03-23 11:21:54] [INFO ] After 17718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7248 ms.
[2023-03-23 11:22:02] [INFO ] After 25262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:22:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2023-03-23 11:22:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1295 places, 1095 transitions and 4957 arcs took 7 ms.
[2023-03-23 11:22:02] [INFO ] Flatten gal took : 136 ms
Total runtime 113967 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (PT), instance 040B
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: 1295 places, 1095 transitions, 4957 arcs.
Final Score: 173955.883
Took : 51 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ShieldPPPs-PT-040B-ReachabilityCardinality-04 (reachable &!potential( ( ( ( ( (tk(P58)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P58)) ) ) | ( ( (tk(P185)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P185)) ) ) ) | ( ( ( ( (tk(P788)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P788)) ) ) & ( ( (tk(P931)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P931)) ) ) ) | ( ( ( ( (tk(P1016)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1016)) ) ) | ( ( (tk(P727)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P727)) ) ) ) & ( ( ( (tk(P348)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P348)) ) ) | ( ( ( (tk(P665)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P665)) ) ) & ( ( ( (tk(P950)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P950)) ) ) & ( ( (tk(P1274)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1274)) ) ) ) ) ) ) ) )))
PROPERTY: ShieldPPPs-PT-040B-ReachabilityCardinality-07 (reachable &!potential( ( ( ( ( (tk(P294)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P294)) ) ) | ( ( ( (tk(P1007)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1007)) ) ) | ( ( (tk(P695)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P695)) ) ) ) ) | ( ( ( ( ( ( (tk(P871)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P871)) ) ) & ( ( (tk(P620)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P620)) ) ) ) & ( ( ( (tk(P130)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P130)) ) ) & ( ( (tk(P1005)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1005)) ) ) ) ) & ( ( ( ( (tk(P681)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P681)) ) ) & ( ( ( (tk(P1104)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1104)) ) ) | ( ( (tk(P309)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P309)) ) ) ) ) & ( ( ( ( (tk(P730)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P730)) ) ) | ( ( ( ( ( (tk(P1172)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1172)) ) ) | ( ( (tk(P1041)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1041)) ) ) ) | ( ( ( (tk(P454)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P454)) ) ) | ( ( (tk(P653)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P653)) ) ) ) ) & ( ( ( (tk(P410)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P410)) ) ) | ( ( ( (tk(P1150)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1150)) ) ) | ( ( (tk(P1179)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1179)) ) ) ) ) ) ) & ( ( ( ( (tk(P565)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P565)) ) ) | ( ( ( (tk(P1061)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1061)) ) ) & ( ( (tk(P612)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P612)) ) ) ) ) & ( ( ( (tk(P989)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P989)) ) ) | ( ( ( (tk(P646)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P646)) ) ) | ( ( ( (tk(P713)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P713)) ) ) & ( ( (tk(P7)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P7)) ) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P1126)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1126)) ) ) & ( ( ( (tk(P257)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P257)) ) ) | ( ( ( (tk(P101)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P101)) ) ) & ( ( (tk(P236)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P236)) ) ) ) ) ) | ( ( ( ( (tk(P1234)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P1234)) ) ) & ( ( ( (tk(P800)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P800)) ) ) & ( ( (tk(P702)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P702)) ) ) ) ) & ( ( ( (tk(P251)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P251)) ) ) & ( ( ( (tk(P106)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P106)) ) ) & ( ( ( (tk(P886)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P886)) ) ) | ( ( ( (tk(P396)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P396)) ) ) & ( ( (tk(P761)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P761)) ) ) ) ) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 956336 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102096 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="ShieldPPPs-PT-040B"
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 ShieldPPPs-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 r395-oct2-167903718800494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-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 '
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 ;