About the Execution of Smart+red for ShieldIIPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 967.663 | 254553.00 | 337523.00 | 58.80 | TTTT??TFTTT?TTF? | 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-167903718400159.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 ShieldIIPs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718400159
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:38 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.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 16:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 846K 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 ShieldIIPs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050B-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1679557149855
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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:39:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 07:39:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:39:12] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2023-03-23 07:39:13] [INFO ] Transformed 3003 places.
[2023-03-23 07:39:13] [INFO ] Transformed 2953 transitions.
[2023-03-23 07:39:13] [INFO ] Found NUPN structural information;
[2023-03-23 07:39:13] [INFO ] Parsed PT model containing 3003 places and 2953 transitions and 8906 arcs in 476 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=18 ) properties (out of 16) seen :8
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2953 rows 3003 cols
[2023-03-23 07:39:14] [INFO ] Computed 451 place invariants in 29 ms
[2023-03-23 07:39:15] [INFO ] [Real]Absence check using 451 positive place invariants in 367 ms returned sat
[2023-03-23 07:39:16] [INFO ] After 1806ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-23 07:39:17] [INFO ] [Nat]Absence check using 451 positive place invariants in 396 ms returned sat
[2023-03-23 07:39:28] [INFO ] After 10297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-23 07:39:30] [INFO ] Deduced a trap composed of 29 places in 1601 ms of which 16 ms to minimize.
[2023-03-23 07:39:31] [INFO ] Deduced a trap composed of 20 places in 1118 ms of which 16 ms to minimize.
[2023-03-23 07:39:32] [INFO ] Deduced a trap composed of 20 places in 1034 ms of which 22 ms to minimize.
[2023-03-23 07:39:34] [INFO ] Deduced a trap composed of 29 places in 1536 ms of which 36 ms to minimize.
[2023-03-23 07:39:35] [INFO ] Deduced a trap composed of 15 places in 896 ms of which 2 ms to minimize.
[2023-03-23 07:39:36] [INFO ] Deduced a trap composed of 24 places in 1017 ms of which 2 ms to minimize.
[2023-03-23 07:39:37] [INFO ] Deduced a trap composed of 26 places in 1159 ms of which 19 ms to minimize.
[2023-03-23 07:39:39] [INFO ] Deduced a trap composed of 20 places in 1100 ms of which 2 ms to minimize.
[2023-03-23 07:39:40] [INFO ] Deduced a trap composed of 37 places in 1306 ms of which 2 ms to minimize.
[2023-03-23 07:39:42] [INFO ] Deduced a trap composed of 31 places in 1572 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:39:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:39:42] [INFO ] After 26122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1425 ms.
Support contains 220 out of 3003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3003/3003 places, 2953/2953 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 221 place count 3003 transition count 2732
Reduce places removed 221 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 228 rules applied. Total rules applied 449 place count 2782 transition count 2725
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 456 place count 2775 transition count 2725
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 234 Pre rules applied. Total rules applied 456 place count 2775 transition count 2491
Deduced a syphon composed of 234 places in 8 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 468 rules applied. Total rules applied 924 place count 2541 transition count 2491
Discarding 311 places :
Symmetric choice reduction at 3 with 311 rule applications. Total rules 1235 place count 2230 transition count 2180
Iterating global reduction 3 with 311 rules applied. Total rules applied 1546 place count 2230 transition count 2180
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 1546 place count 2230 transition count 2080
Deduced a syphon composed of 100 places in 15 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 1746 place count 2130 transition count 2080
Performed 691 Post agglomeration using F-continuation condition.Transition count delta: 691
Deduced a syphon composed of 691 places in 5 ms
Reduce places removed 691 places and 0 transitions.
Iterating global reduction 3 with 1382 rules applied. Total rules applied 3128 place count 1439 transition count 1389
Partial Free-agglomeration rule applied 285 times.
Drop transitions removed 285 transitions
Iterating global reduction 3 with 285 rules applied. Total rules applied 3413 place count 1439 transition count 1389
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3414 place count 1438 transition count 1388
Applied a total of 3414 rules in 1108 ms. Remains 1438 /3003 variables (removed 1565) and now considering 1388/2953 (removed 1565) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1109 ms. Remains : 1438/3003 places, 1388/2953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 8) seen :2
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :1
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1388 rows 1438 cols
[2023-03-23 07:39:45] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-23 07:39:45] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 07:39:46] [INFO ] [Nat]Absence check using 441 positive place invariants in 94 ms returned sat
[2023-03-23 07:39:46] [INFO ] [Nat]Absence check using 441 positive and 10 generalized place invariants in 2 ms returned sat
[2023-03-23 07:39:47] [INFO ] After 1646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 07:39:48] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2023-03-23 07:39:48] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
[2023-03-23 07:39:49] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2023-03-23 07:39:49] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 1 ms to minimize.
[2023-03-23 07:39:50] [INFO ] Deduced a trap composed of 6 places in 387 ms of which 1 ms to minimize.
[2023-03-23 07:39:50] [INFO ] Deduced a trap composed of 5 places in 437 ms of which 0 ms to minimize.
[2023-03-23 07:39:51] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 0 ms to minimize.
[2023-03-23 07:39:51] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2023-03-23 07:39:51] [INFO ] Deduced a trap composed of 4 places in 429 ms of which 0 ms to minimize.
[2023-03-23 07:39:52] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 0 ms to minimize.
[2023-03-23 07:39:52] [INFO ] Deduced a trap composed of 7 places in 385 ms of which 1 ms to minimize.
[2023-03-23 07:39:53] [INFO ] Deduced a trap composed of 14 places in 224 ms of which 14 ms to minimize.
[2023-03-23 07:39:53] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2023-03-23 07:39:53] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 1 ms to minimize.
[2023-03-23 07:39:54] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 0 ms to minimize.
[2023-03-23 07:39:54] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 0 ms to minimize.
[2023-03-23 07:39:55] [INFO ] Deduced a trap composed of 8 places in 811 ms of which 1 ms to minimize.
[2023-03-23 07:39:55] [INFO ] Deduced a trap composed of 21 places in 346 ms of which 0 ms to minimize.
[2023-03-23 07:39:56] [INFO ] Deduced a trap composed of 8 places in 274 ms of which 1 ms to minimize.
[2023-03-23 07:39:56] [INFO ] Deduced a trap composed of 6 places in 449 ms of which 1 ms to minimize.
[2023-03-23 07:39:57] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 1 ms to minimize.
[2023-03-23 07:39:57] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-23 07:39:57] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 0 ms to minimize.
[2023-03-23 07:39:58] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 1 ms to minimize.
[2023-03-23 07:39:58] [INFO ] Deduced a trap composed of 6 places in 385 ms of which 1 ms to minimize.
[2023-03-23 07:39:59] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2023-03-23 07:39:59] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 1 ms to minimize.
[2023-03-23 07:39:59] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2023-03-23 07:40:00] [INFO ] Deduced a trap composed of 8 places in 445 ms of which 1 ms to minimize.
[2023-03-23 07:40:00] [INFO ] Deduced a trap composed of 8 places in 399 ms of which 8 ms to minimize.
[2023-03-23 07:40:01] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-23 07:40:01] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 0 ms to minimize.
[2023-03-23 07:40:01] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 3 ms to minimize.
[2023-03-23 07:40:02] [INFO ] Deduced a trap composed of 10 places in 353 ms of which 0 ms to minimize.
[2023-03-23 07:40:02] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 3 ms to minimize.
[2023-03-23 07:40:02] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2023-03-23 07:40:03] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 0 ms to minimize.
[2023-03-23 07:40:03] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:40:04] [INFO ] Deduced a trap composed of 22 places in 561 ms of which 2 ms to minimize.
[2023-03-23 07:40:04] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 1 ms to minimize.
[2023-03-23 07:40:05] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 23 ms to minimize.
[2023-03-23 07:40:05] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2023-03-23 07:40:05] [INFO ] Deduced a trap composed of 17 places in 211 ms of which 1 ms to minimize.
[2023-03-23 07:40:06] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 1 ms to minimize.
[2023-03-23 07:40:06] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 0 ms to minimize.
[2023-03-23 07:40:06] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 21 ms to minimize.
[2023-03-23 07:40:07] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 1 ms to minimize.
[2023-03-23 07:40:07] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2023-03-23 07:40:08] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2023-03-23 07:40:08] [INFO ] Trap strengthening (SAT) tested/added 50/49 trap constraints in 20019 ms
[2023-03-23 07:40:09] [INFO ] Deduced a trap composed of 9 places in 562 ms of which 1 ms to minimize.
[2023-03-23 07:40:09] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:40:09] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2023-03-23 07:40:09] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 0 ms to minimize.
[2023-03-23 07:40:10] [INFO ] Deduced a trap composed of 9 places in 642 ms of which 13 ms to minimize.
[2023-03-23 07:40:10] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 2420 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 07:40:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:40:10] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 271 ms.
Support contains 144 out of 1438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1438/1438 places, 1388/1388 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1438 transition count 1382
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1432 transition count 1382
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 12 place count 1432 transition count 1368
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 40 place count 1418 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 1417 transition count 1367
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 1417 transition count 1367
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 132 place count 1372 transition count 1322
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 2 with 27 rules applied. Total rules applied 159 place count 1372 transition count 1322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 160 place count 1371 transition count 1321
Applied a total of 160 rules in 295 ms. Remains 1371 /1438 variables (removed 67) and now considering 1321/1388 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 1371/1438 places, 1321/1388 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 68738 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{2=1}
Probabilistic random walk after 68738 steps, saw 65621 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :1
FORMULA ShieldIIPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 1321 rows 1371 cols
[2023-03-23 07:40:15] [INFO ] Computed 451 place invariants in 18 ms
[2023-03-23 07:40:15] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:40:15] [INFO ] [Nat]Absence check using 434 positive place invariants in 223 ms returned sat
[2023-03-23 07:40:15] [INFO ] [Nat]Absence check using 434 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-23 07:40:17] [INFO ] After 1583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:40:18] [INFO ] Deduced a trap composed of 5 places in 415 ms of which 1 ms to minimize.
[2023-03-23 07:40:19] [INFO ] Deduced a trap composed of 4 places in 726 ms of which 1 ms to minimize.
[2023-03-23 07:40:19] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 10 ms to minimize.
[2023-03-23 07:40:20] [INFO ] Deduced a trap composed of 5 places in 395 ms of which 13 ms to minimize.
[2023-03-23 07:40:20] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 1 ms to minimize.
[2023-03-23 07:40:21] [INFO ] Deduced a trap composed of 4 places in 749 ms of which 1 ms to minimize.
[2023-03-23 07:40:22] [INFO ] Deduced a trap composed of 8 places in 526 ms of which 1 ms to minimize.
[2023-03-23 07:40:22] [INFO ] Deduced a trap composed of 12 places in 383 ms of which 1 ms to minimize.
[2023-03-23 07:40:23] [INFO ] Deduced a trap composed of 3 places in 986 ms of which 2 ms to minimize.
[2023-03-23 07:40:24] [INFO ] Deduced a trap composed of 9 places in 550 ms of which 0 ms to minimize.
[2023-03-23 07:40:24] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 1 ms to minimize.
[2023-03-23 07:40:25] [INFO ] Deduced a trap composed of 5 places in 432 ms of which 1 ms to minimize.
[2023-03-23 07:40:25] [INFO ] Deduced a trap composed of 7 places in 325 ms of which 1 ms to minimize.
[2023-03-23 07:40:26] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 1 ms to minimize.
[2023-03-23 07:40:26] [INFO ] Deduced a trap composed of 8 places in 384 ms of which 0 ms to minimize.
[2023-03-23 07:40:27] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 0 ms to minimize.
[2023-03-23 07:40:27] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-23 07:40:27] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 1 ms to minimize.
[2023-03-23 07:40:28] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 1 ms to minimize.
[2023-03-23 07:40:28] [INFO ] Deduced a trap composed of 8 places in 355 ms of which 1 ms to minimize.
[2023-03-23 07:40:28] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 0 ms to minimize.
[2023-03-23 07:40:29] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2023-03-23 07:40:29] [INFO ] Deduced a trap composed of 12 places in 251 ms of which 1 ms to minimize.
[2023-03-23 07:40:30] [INFO ] Deduced a trap composed of 8 places in 381 ms of which 1 ms to minimize.
[2023-03-23 07:40:30] [INFO ] Deduced a trap composed of 17 places in 416 ms of which 1 ms to minimize.
[2023-03-23 07:40:30] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 1 ms to minimize.
[2023-03-23 07:40:31] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2023-03-23 07:40:31] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2023-03-23 07:40:32] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 0 ms to minimize.
[2023-03-23 07:40:32] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2023-03-23 07:40:33] [INFO ] Deduced a trap composed of 7 places in 376 ms of which 0 ms to minimize.
[2023-03-23 07:40:33] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 1 ms to minimize.
[2023-03-23 07:40:33] [INFO ] Deduced a trap composed of 6 places in 282 ms of which 0 ms to minimize.
[2023-03-23 07:40:34] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 1 ms to minimize.
[2023-03-23 07:40:34] [INFO ] Deduced a trap composed of 8 places in 329 ms of which 0 ms to minimize.
[2023-03-23 07:40:34] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2023-03-23 07:40:35] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 1 ms to minimize.
[2023-03-23 07:40:35] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 2 ms to minimize.
[2023-03-23 07:40:35] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 1 ms to minimize.
[2023-03-23 07:40:36] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 2 ms to minimize.
[2023-03-23 07:40:36] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-23 07:40:36] [INFO ] Deduced a trap composed of 17 places in 282 ms of which 1 ms to minimize.
[2023-03-23 07:40:37] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2023-03-23 07:40:37] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2023-03-23 07:40:38] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2023-03-23 07:40:38] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 1 ms to minimize.
[2023-03-23 07:40:39] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 1 ms to minimize.
[2023-03-23 07:40:39] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 0 ms to minimize.
[2023-03-23 07:40:39] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 0 ms to minimize.
[2023-03-23 07:40:40] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 1 ms to minimize.
[2023-03-23 07:40:40] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 22371 ms
[2023-03-23 07:40:40] [INFO ] Deduced a trap composed of 6 places in 377 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 07:40:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:40:40] [INFO ] After 25407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 167 ms.
Support contains 134 out of 1371 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1371/1371 places, 1321/1321 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 1371 transition count 1318
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1368 transition count 1318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 1366 transition count 1316
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 1366 transition count 1316
Applied a total of 13 rules in 112 ms. Remains 1366 /1371 variables (removed 5) and now considering 1316/1321 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 1366/1371 places, 1316/1321 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) 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 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 83897 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83897 steps, saw 79041 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1316 rows 1366 cols
[2023-03-23 07:40:44] [INFO ] Computed 451 place invariants in 20 ms
[2023-03-23 07:40:45] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:40:45] [INFO ] [Nat]Absence check using 435 positive place invariants in 155 ms returned sat
[2023-03-23 07:40:45] [INFO ] [Nat]Absence check using 435 positive and 16 generalized place invariants in 15 ms returned sat
[2023-03-23 07:40:47] [INFO ] After 1383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:40:47] [INFO ] Deduced a trap composed of 6 places in 373 ms of which 1 ms to minimize.
[2023-03-23 07:40:47] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2023-03-23 07:40:48] [INFO ] Deduced a trap composed of 3 places in 482 ms of which 1 ms to minimize.
[2023-03-23 07:40:49] [INFO ] Deduced a trap composed of 8 places in 651 ms of which 0 ms to minimize.
[2023-03-23 07:40:49] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 1 ms to minimize.
[2023-03-23 07:40:50] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 1 ms to minimize.
[2023-03-23 07:40:50] [INFO ] Deduced a trap composed of 5 places in 349 ms of which 0 ms to minimize.
[2023-03-23 07:40:50] [INFO ] Deduced a trap composed of 7 places in 371 ms of which 10 ms to minimize.
[2023-03-23 07:40:51] [INFO ] Deduced a trap composed of 4 places in 581 ms of which 0 ms to minimize.
[2023-03-23 07:40:52] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2023-03-23 07:40:52] [INFO ] Deduced a trap composed of 4 places in 710 ms of which 6 ms to minimize.
[2023-03-23 07:40:53] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 1 ms to minimize.
[2023-03-23 07:40:54] [INFO ] Deduced a trap composed of 3 places in 770 ms of which 1 ms to minimize.
[2023-03-23 07:40:54] [INFO ] Deduced a trap composed of 3 places in 582 ms of which 0 ms to minimize.
[2023-03-23 07:40:55] [INFO ] Deduced a trap composed of 5 places in 491 ms of which 1 ms to minimize.
[2023-03-23 07:40:56] [INFO ] Deduced a trap composed of 9 places in 477 ms of which 2 ms to minimize.
[2023-03-23 07:40:56] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 1 ms to minimize.
[2023-03-23 07:40:57] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 0 ms to minimize.
[2023-03-23 07:40:57] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 0 ms to minimize.
[2023-03-23 07:40:57] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2023-03-23 07:40:58] [INFO ] Deduced a trap composed of 6 places in 493 ms of which 14 ms to minimize.
[2023-03-23 07:40:59] [INFO ] Deduced a trap composed of 9 places in 1197 ms of which 0 ms to minimize.
[2023-03-23 07:40:59] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 0 ms to minimize.
[2023-03-23 07:41:00] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 0 ms to minimize.
[2023-03-23 07:41:00] [INFO ] Deduced a trap composed of 17 places in 416 ms of which 2 ms to minimize.
[2023-03-23 07:41:01] [INFO ] Deduced a trap composed of 19 places in 347 ms of which 1 ms to minimize.
[2023-03-23 07:41:01] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 14 ms to minimize.
[2023-03-23 07:41:01] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 1 ms to minimize.
[2023-03-23 07:41:02] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 0 ms to minimize.
[2023-03-23 07:41:02] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 1 ms to minimize.
[2023-03-23 07:41:03] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 1 ms to minimize.
[2023-03-23 07:41:03] [INFO ] Deduced a trap composed of 9 places in 582 ms of which 2 ms to minimize.
[2023-03-23 07:41:04] [INFO ] Deduced a trap composed of 23 places in 408 ms of which 0 ms to minimize.
[2023-03-23 07:41:04] [INFO ] Deduced a trap composed of 8 places in 363 ms of which 1 ms to minimize.
[2023-03-23 07:41:05] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 0 ms to minimize.
[2023-03-23 07:41:05] [INFO ] Deduced a trap composed of 11 places in 568 ms of which 0 ms to minimize.
[2023-03-23 07:41:06] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2023-03-23 07:41:06] [INFO ] Deduced a trap composed of 8 places in 549 ms of which 2 ms to minimize.
[2023-03-23 07:41:07] [INFO ] Deduced a trap composed of 17 places in 474 ms of which 2 ms to minimize.
[2023-03-23 07:41:07] [INFO ] Deduced a trap composed of 15 places in 424 ms of which 1 ms to minimize.
[2023-03-23 07:41:08] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 1 ms to minimize.
[2023-03-23 07:41:08] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 24 ms to minimize.
[2023-03-23 07:41:08] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 21451 ms
[2023-03-23 07:41:09] [INFO ] Deduced a trap composed of 7 places in 245 ms of which 1 ms to minimize.
[2023-03-23 07:41:09] [INFO ] Deduced a trap composed of 5 places in 373 ms of which 1 ms to minimize.
[2023-03-23 07:41:10] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2023-03-23 07:41:12] [INFO ] Deduced a trap composed of 3 places in 2023 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:41:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:41:12] [INFO ] After 27039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 125 ms.
Support contains 134 out of 1366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 35 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 1366/1366 places, 1316/1316 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 32 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
[2023-03-23 07:41:12] [INFO ] Invariant cache hit.
[2023-03-23 07:41:13] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-23 07:41:13] [INFO ] Invariant cache hit.
[2023-03-23 07:41:16] [INFO ] Implicit Places using invariants and state equation in 2985 ms returned []
Implicit Place search using SMT with State Equation took 4004 ms to find 0 implicit places.
[2023-03-23 07:41:16] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-23 07:41:16] [INFO ] Invariant cache hit.
[2023-03-23 07:41:17] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5386 ms. Remains : 1366/1366 places, 1316/1316 transitions.
Applied a total of 0 rules in 34 ms. Remains 1366 /1366 variables (removed 0) and now considering 1316/1316 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-23 07:41:17] [INFO ] Invariant cache hit.
[2023-03-23 07:41:18] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 07:41:18] [INFO ] [Nat]Absence check using 435 positive place invariants in 148 ms returned sat
[2023-03-23 07:41:18] [INFO ] [Nat]Absence check using 435 positive and 16 generalized place invariants in 18 ms returned sat
[2023-03-23 07:41:20] [INFO ] After 1507ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 07:41:20] [INFO ] Deduced a trap composed of 5 places in 315 ms of which 1 ms to minimize.
[2023-03-23 07:41:21] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2023-03-23 07:41:21] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 0 ms to minimize.
[2023-03-23 07:41:22] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 1 ms to minimize.
[2023-03-23 07:41:23] [INFO ] Deduced a trap composed of 4 places in 803 ms of which 1 ms to minimize.
[2023-03-23 07:41:23] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 1 ms to minimize.
[2023-03-23 07:41:23] [INFO ] Deduced a trap composed of 5 places in 488 ms of which 1 ms to minimize.
[2023-03-23 07:41:24] [INFO ] Deduced a trap composed of 4 places in 483 ms of which 2 ms to minimize.
[2023-03-23 07:41:25] [INFO ] Deduced a trap composed of 6 places in 515 ms of which 1 ms to minimize.
[2023-03-23 07:41:25] [INFO ] Deduced a trap composed of 8 places in 316 ms of which 1 ms to minimize.
[2023-03-23 07:41:25] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 0 ms to minimize.
[2023-03-23 07:41:26] [INFO ] Deduced a trap composed of 6 places in 514 ms of which 1 ms to minimize.
[2023-03-23 07:41:26] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2023-03-23 07:41:27] [INFO ] Deduced a trap composed of 14 places in 493 ms of which 2 ms to minimize.
[2023-03-23 07:41:28] [INFO ] Deduced a trap composed of 10 places in 653 ms of which 2 ms to minimize.
[2023-03-23 07:41:28] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 0 ms to minimize.
[2023-03-23 07:41:29] [INFO ] Deduced a trap composed of 6 places in 498 ms of which 1 ms to minimize.
[2023-03-23 07:41:29] [INFO ] Deduced a trap composed of 3 places in 469 ms of which 1 ms to minimize.
[2023-03-23 07:41:29] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2023-03-23 07:41:30] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 1 ms to minimize.
[2023-03-23 07:41:30] [INFO ] Deduced a trap composed of 9 places in 401 ms of which 0 ms to minimize.
[2023-03-23 07:41:31] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2023-03-23 07:41:31] [INFO ] Deduced a trap composed of 6 places in 489 ms of which 1 ms to minimize.
[2023-03-23 07:41:32] [INFO ] Deduced a trap composed of 6 places in 410 ms of which 1 ms to minimize.
[2023-03-23 07:41:32] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 1 ms to minimize.
[2023-03-23 07:41:33] [INFO ] Deduced a trap composed of 11 places in 512 ms of which 1 ms to minimize.
[2023-03-23 07:41:33] [INFO ] Deduced a trap composed of 12 places in 493 ms of which 0 ms to minimize.
[2023-03-23 07:41:34] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 0 ms to minimize.
[2023-03-23 07:41:34] [INFO ] Deduced a trap composed of 8 places in 403 ms of which 1 ms to minimize.
[2023-03-23 07:41:35] [INFO ] Deduced a trap composed of 3 places in 621 ms of which 1 ms to minimize.
[2023-03-23 07:41:35] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 1 ms to minimize.
[2023-03-23 07:41:36] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 0 ms to minimize.
[2023-03-23 07:41:36] [INFO ] Deduced a trap composed of 10 places in 685 ms of which 1 ms to minimize.
[2023-03-23 07:41:37] [INFO ] Deduced a trap composed of 15 places in 367 ms of which 0 ms to minimize.
[2023-03-23 07:41:37] [INFO ] Deduced a trap composed of 10 places in 428 ms of which 0 ms to minimize.
[2023-03-23 07:41:38] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 1 ms to minimize.
[2023-03-23 07:41:38] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 1 ms to minimize.
[2023-03-23 07:41:39] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2023-03-23 07:41:39] [INFO ] Deduced a trap composed of 17 places in 404 ms of which 1 ms to minimize.
[2023-03-23 07:41:40] [INFO ] Deduced a trap composed of 17 places in 536 ms of which 0 ms to minimize.
[2023-03-23 07:41:40] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 2 ms to minimize.
[2023-03-23 07:41:41] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 0 ms to minimize.
[2023-03-23 07:41:41] [INFO ] Deduced a trap composed of 5 places in 421 ms of which 1 ms to minimize.
[2023-03-23 07:41:41] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 2 ms to minimize.
[2023-03-23 07:41:42] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 1 ms to minimize.
[2023-03-23 07:41:42] [INFO ] Deduced a trap composed of 8 places in 273 ms of which 1 ms to minimize.
[2023-03-23 07:41:43] [INFO ] Deduced a trap composed of 9 places in 413 ms of which 0 ms to minimize.
[2023-03-23 07:41:43] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 22775 ms
[2023-03-23 07:41:43] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 2 ms to minimize.
[2023-03-23 07:41:44] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 1 ms to minimize.
[2023-03-23 07:41:44] [INFO ] Deduced a trap composed of 6 places in 466 ms of which 1 ms to minimize.
[2023-03-23 07:41:45] [INFO ] Deduced a trap composed of 7 places in 629 ms of which 1 ms to minimize.
[2023-03-23 07:41:45] [INFO ] Deduced a trap composed of 7 places in 402 ms of which 19 ms to minimize.
[2023-03-23 07:41:46] [INFO ] Deduced a trap composed of 5 places in 285 ms of which 1 ms to minimize.
[2023-03-23 07:41:46] [INFO ] Deduced a trap composed of 5 places in 287 ms of which 1 ms to minimize.
[2023-03-23 07:41:47] [INFO ] Deduced a trap composed of 5 places in 808 ms of which 1 ms to minimize.
[2023-03-23 07:41:47] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2023-03-23 07:41:48] [INFO ] Deduced a trap composed of 10 places in 380 ms of which 1 ms to minimize.
[2023-03-23 07:41:48] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 1 ms to minimize.
[2023-03-23 07:41:49] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 1 ms to minimize.
[2023-03-23 07:41:49] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2023-03-23 07:41:50] [INFO ] Deduced a trap composed of 7 places in 392 ms of which 1 ms to minimize.
[2023-03-23 07:41:50] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 0 ms to minimize.
[2023-03-23 07:41:50] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 0 ms to minimize.
[2023-03-23 07:41:51] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 0 ms to minimize.
[2023-03-23 07:41:51] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 0 ms to minimize.
[2023-03-23 07:41:51] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 1 ms to minimize.
[2023-03-23 07:41:52] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2023-03-23 07:41:52] [INFO ] Deduced a trap composed of 23 places in 295 ms of which 0 ms to minimize.
[2023-03-23 07:41:52] [INFO ] Deduced a trap composed of 18 places in 261 ms of which 1 ms to minimize.
[2023-03-23 07:41:53] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 1 ms to minimize.
[2023-03-23 07:41:53] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 13 ms to minimize.
[2023-03-23 07:41:53] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 0 ms to minimize.
[2023-03-23 07:41:54] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 1 ms to minimize.
[2023-03-23 07:41:54] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 11005 ms
[2023-03-23 07:41:54] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 1 ms to minimize.
[2023-03-23 07:41:55] [INFO ] Deduced a trap composed of 5 places in 275 ms of which 1 ms to minimize.
[2023-03-23 07:41:55] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 1 ms to minimize.
[2023-03-23 07:41:56] [INFO ] Deduced a trap composed of 4 places in 596 ms of which 0 ms to minimize.
[2023-03-23 07:41:56] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 1 ms to minimize.
[2023-03-23 07:41:57] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-23 07:41:57] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2023-03-23 07:41:57] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:41:57] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-23 07:41:58] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 2 ms to minimize.
[2023-03-23 07:41:58] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 0 ms to minimize.
[2023-03-23 07:41:58] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-23 07:41:59] [INFO ] Deduced a trap composed of 8 places in 543 ms of which 1 ms to minimize.
[2023-03-23 07:41:59] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 1 ms to minimize.
[2023-03-23 07:42:00] [INFO ] Deduced a trap composed of 16 places in 313 ms of which 1 ms to minimize.
[2023-03-23 07:42:00] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 0 ms to minimize.
[2023-03-23 07:42:00] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 0 ms to minimize.
[2023-03-23 07:42:01] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 4 ms to minimize.
[2023-03-23 07:42:01] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2023-03-23 07:42:01] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2023-03-23 07:42:02] [INFO ] Deduced a trap composed of 3 places in 476 ms of which 22 ms to minimize.
[2023-03-23 07:42:02] [INFO ] Deduced a trap composed of 4 places in 374 ms of which 1 ms to minimize.
[2023-03-23 07:42:02] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 0 ms to minimize.
[2023-03-23 07:42:03] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2023-03-23 07:42:03] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8831 ms
[2023-03-23 07:42:03] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
[2023-03-23 07:42:04] [INFO ] Deduced a trap composed of 5 places in 344 ms of which 0 ms to minimize.
[2023-03-23 07:42:04] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 1 ms to minimize.
[2023-03-23 07:42:05] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 1 ms to minimize.
[2023-03-23 07:42:05] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2023-03-23 07:42:05] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 0 ms to minimize.
[2023-03-23 07:42:06] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 0 ms to minimize.
[2023-03-23 07:42:06] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-23 07:42:06] [INFO ] Deduced a trap composed of 10 places in 262 ms of which 1 ms to minimize.
[2023-03-23 07:42:07] [INFO ] Deduced a trap composed of 14 places in 290 ms of which 2 ms to minimize.
[2023-03-23 07:42:07] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2023-03-23 07:42:08] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 1 ms to minimize.
[2023-03-23 07:42:08] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 1 ms to minimize.
[2023-03-23 07:42:09] [INFO ] Deduced a trap composed of 8 places in 582 ms of which 0 ms to minimize.
[2023-03-23 07:42:09] [INFO ] Deduced a trap composed of 19 places in 477 ms of which 0 ms to minimize.
[2023-03-23 07:42:10] [INFO ] Deduced a trap composed of 17 places in 505 ms of which 0 ms to minimize.
[2023-03-23 07:42:10] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 1 ms to minimize.
[2023-03-23 07:42:11] [INFO ] Deduced a trap composed of 6 places in 548 ms of which 0 ms to minimize.
[2023-03-23 07:42:11] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2023-03-23 07:42:12] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 1 ms to minimize.
[2023-03-23 07:42:12] [INFO ] Deduced a trap composed of 8 places in 335 ms of which 0 ms to minimize.
[2023-03-23 07:42:13] [INFO ] Deduced a trap composed of 12 places in 847 ms of which 0 ms to minimize.
[2023-03-23 07:42:13] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 0 ms to minimize.
[2023-03-23 07:42:14] [INFO ] Deduced a trap composed of 10 places in 428 ms of which 14 ms to minimize.
[2023-03-23 07:42:14] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 1 ms to minimize.
[2023-03-23 07:42:15] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2023-03-23 07:42:15] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 1 ms to minimize.
[2023-03-23 07:42:15] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2023-03-23 07:42:16] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 0 ms to minimize.
[2023-03-23 07:42:16] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 0 ms to minimize.
[2023-03-23 07:42:16] [INFO ] Deduced a trap composed of 9 places in 262 ms of which 1 ms to minimize.
[2023-03-23 07:42:17] [INFO ] Deduced a trap composed of 7 places in 422 ms of which 0 ms to minimize.
[2023-03-23 07:42:17] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2023-03-23 07:42:18] [INFO ] Deduced a trap composed of 8 places in 324 ms of which 0 ms to minimize.
[2023-03-23 07:42:18] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 0 ms to minimize.
[2023-03-23 07:42:18] [INFO ] Deduced a trap composed of 13 places in 330 ms of which 1 ms to minimize.
[2023-03-23 07:42:18] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 2 ms to minimize.
[2023-03-23 07:42:19] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 15574 ms
[2023-03-23 07:42:19] [INFO ] After 60359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 793 ms.
[2023-03-23 07:42:19] [INFO ] After 61829ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-23 07:42:19] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-23 07:42:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1366 places, 1316 transitions and 5993 arcs took 20 ms.
[2023-03-23 07:42:20] [INFO ] Flatten gal took : 198 ms
Total runtime 187839 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldIIPs (PT), instance 050B
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 1366 places, 1316 transitions, 5993 arcs.
Final Score: 21261.257
Took : 63 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
BK_STOP 1679557404408
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 8978:
syntax error
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="ShieldIIPs-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-050B, examination is ReachabilityFireability"
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-167903718400159"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050B.tgz
mv ShieldIIPs-PT-050B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;