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-167903718800479.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-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-oct2-167903718800479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 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 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 528K 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-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679569252881

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=ShieldPPPs-PT-030B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 11:00:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 11:00:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:00:55] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2023-03-23 11:00:56] [INFO ] Transformed 2043 places.
[2023-03-23 11:00:56] [INFO ] Transformed 1893 transitions.
[2023-03-23 11:00:56] [INFO ] Found NUPN structural information;
[2023-03-23 11:00:56] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=15 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-23 11:00:57] [INFO ] Computed 331 place invariants in 44 ms
[2023-03-23 11:00:59] [INFO ] [Real]Absence check using 331 positive place invariants in 463 ms returned sat
[2023-03-23 11:00:59] [INFO ] After 1783ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 11:01:00] [INFO ] [Nat]Absence check using 331 positive place invariants in 203 ms returned sat
[2023-03-23 11:01:05] [INFO ] After 4325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 11:01:06] [INFO ] Deduced a trap composed of 24 places in 907 ms of which 12 ms to minimize.
[2023-03-23 11:01:07] [INFO ] Deduced a trap composed of 23 places in 940 ms of which 2 ms to minimize.
[2023-03-23 11:01:08] [INFO ] Deduced a trap composed of 18 places in 637 ms of which 15 ms to minimize.
[2023-03-23 11:01:08] [INFO ] Deduced a trap composed of 23 places in 642 ms of which 2 ms to minimize.
[2023-03-23 11:01:09] [INFO ] Deduced a trap composed of 21 places in 955 ms of which 2 ms to minimize.
[2023-03-23 11:01:10] [INFO ] Deduced a trap composed of 30 places in 918 ms of which 2 ms to minimize.
[2023-03-23 11:01:11] [INFO ] Deduced a trap composed of 24 places in 701 ms of which 17 ms to minimize.
[2023-03-23 11:01:12] [INFO ] Deduced a trap composed of 31 places in 559 ms of which 1 ms to minimize.
[2023-03-23 11:01:13] [INFO ] Deduced a trap composed of 14 places in 822 ms of which 2 ms to minimize.
[2023-03-23 11:01:13] [INFO ] Deduced a trap composed of 38 places in 574 ms of which 1 ms to minimize.
[2023-03-23 11:01:14] [INFO ] Deduced a trap composed of 27 places in 653 ms of which 2 ms to minimize.
[2023-03-23 11:01:15] [INFO ] Deduced a trap composed of 23 places in 605 ms of which 2 ms to minimize.
[2023-03-23 11:01:16] [INFO ] Deduced a trap composed of 24 places in 872 ms of which 2 ms to minimize.
[2023-03-23 11:01:17] [INFO ] Deduced a trap composed of 28 places in 690 ms of which 2 ms to minimize.
[2023-03-23 11:01:18] [INFO ] Deduced a trap composed of 32 places in 722 ms of which 1 ms to minimize.
[2023-03-23 11:01:19] [INFO ] Deduced a trap composed of 19 places in 853 ms of which 3 ms to minimize.
[2023-03-23 11:01:19] [INFO ] Deduced a trap composed of 20 places in 711 ms of which 1 ms to minimize.
[2023-03-23 11:01:20] [INFO ] Deduced a trap composed of 14 places in 491 ms of which 1 ms to minimize.
[2023-03-23 11:01:21] [INFO ] Deduced a trap composed of 11 places in 636 ms of which 2 ms to minimize.
[2023-03-23 11:01:21] [INFO ] Deduced a trap composed of 30 places in 581 ms of which 2 ms to minimize.
[2023-03-23 11:01:22] [INFO ] Deduced a trap composed of 19 places in 577 ms of which 2 ms to minimize.
[2023-03-23 11:01:23] [INFO ] Deduced a trap composed of 31 places in 614 ms of which 1 ms to minimize.
[2023-03-23 11:01:23] [INFO ] Deduced a trap composed of 19 places in 514 ms of which 1 ms to minimize.
[2023-03-23 11:01:24] [INFO ] Deduced a trap composed of 19 places in 681 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 11:01:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:01:24] [INFO ] After 25366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 1036 ms.
Support contains 182 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 2043 transition count 1728
Reduce places removed 165 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 177 rules applied. Total rules applied 342 place count 1878 transition count 1716
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 354 place count 1866 transition count 1716
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 354 place count 1866 transition count 1569
Deduced a syphon composed of 147 places in 8 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 648 place count 1719 transition count 1569
Discarding 168 places :
Symmetric choice reduction at 3 with 168 rule applications. Total rules 816 place count 1551 transition count 1401
Iterating global reduction 3 with 168 rules applied. Total rules applied 984 place count 1551 transition count 1401
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 984 place count 1551 transition count 1344
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 1098 place count 1494 transition count 1344
Performed 385 Post agglomeration using F-continuation condition.Transition count delta: 385
Deduced a syphon composed of 385 places in 6 ms
Reduce places removed 385 places and 0 transitions.
Iterating global reduction 3 with 770 rules applied. Total rules applied 1868 place count 1109 transition count 959
Partial Free-agglomeration rule applied 201 times.
Drop transitions removed 201 transitions
Iterating global reduction 3 with 201 rules applied. Total rules applied 2069 place count 1109 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2070 place count 1108 transition count 958
Applied a total of 2070 rules in 652 ms. Remains 1108 /2043 variables (removed 935) and now considering 958/1893 (removed 935) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 1108/2043 places, 958/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 8) seen :5
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 958 rows 1108 cols
[2023-03-23 11:01:26] [INFO ] Computed 331 place invariants in 31 ms
[2023-03-23 11:01:27] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 11:01:27] [INFO ] [Nat]Absence check using 318 positive place invariants in 168 ms returned sat
[2023-03-23 11:01:27] [INFO ] [Nat]Absence check using 318 positive and 13 generalized place invariants in 16 ms returned sat
[2023-03-23 11:01:29] [INFO ] After 1564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 11:01:29] [INFO ] Deduced a trap composed of 8 places in 445 ms of which 1 ms to minimize.
[2023-03-23 11:01:30] [INFO ] Deduced a trap composed of 21 places in 416 ms of which 1 ms to minimize.
[2023-03-23 11:01:30] [INFO ] Deduced a trap composed of 5 places in 398 ms of which 1 ms to minimize.
[2023-03-23 11:01:31] [INFO ] Deduced a trap composed of 20 places in 283 ms of which 1 ms to minimize.
[2023-03-23 11:01:31] [INFO ] Deduced a trap composed of 8 places in 232 ms of which 1 ms to minimize.
[2023-03-23 11:01:31] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 11 ms to minimize.
[2023-03-23 11:01:32] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 1 ms to minimize.
[2023-03-23 11:01:32] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2023-03-23 11:01:32] [INFO ] Deduced a trap composed of 11 places in 296 ms of which 1 ms to minimize.
[2023-03-23 11:01:32] [INFO ] Deduced a trap composed of 10 places in 242 ms of which 0 ms to minimize.
[2023-03-23 11:01:33] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2023-03-23 11:01:33] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 1 ms to minimize.
[2023-03-23 11:01:33] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2023-03-23 11:01:34] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5338 ms
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 0 ms to minimize.
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 0 ms to minimize.
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2023-03-23 11:01:35] [INFO ] Deduced a trap composed of 7 places in 229 ms of which 1 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 1 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 1 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 1 ms to minimize.
[2023-03-23 11:01:36] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-23 11:01:37] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-23 11:01:38] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 0 ms to minimize.
[2023-03-23 11:01:38] [INFO ] Deduced a trap composed of 8 places in 490 ms of which 0 ms to minimize.
[2023-03-23 11:01:39] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 1 ms to minimize.
[2023-03-23 11:01:39] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2023-03-23 11:01:39] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2023-03-23 11:01:39] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-23 11:01:40] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-23 11:01:40] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2023-03-23 11:01:40] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2023-03-23 11:01:40] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 1 ms to minimize.
[2023-03-23 11:01:41] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 0 ms to minimize.
[2023-03-23 11:01:41] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 0 ms to minimize.
[2023-03-23 11:01:41] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 3 ms to minimize.
[2023-03-23 11:01:41] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2023-03-23 11:01:41] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 13 ms to minimize.
[2023-03-23 11:01:42] [INFO ] Deduced a trap composed of 19 places in 171 ms of which 0 ms to minimize.
[2023-03-23 11:01:42] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2023-03-23 11:01:42] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 0 ms to minimize.
[2023-03-23 11:01:42] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 8043 ms
[2023-03-23 11:01:44] [INFO ] Deduced a trap composed of 9 places in 594 ms of which 1 ms to minimize.
[2023-03-23 11:01:44] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 1 ms to minimize.
[2023-03-23 11:01:45] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 1 ms to minimize.
[2023-03-23 11:01:45] [INFO ] Deduced a trap composed of 7 places in 495 ms of which 0 ms to minimize.
[2023-03-23 11:01:46] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-23 11:01:46] [INFO ] Deduced a trap composed of 14 places in 254 ms of which 1 ms to minimize.
[2023-03-23 11:01:46] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 0 ms to minimize.
[2023-03-23 11:01:47] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 1 ms to minimize.
[2023-03-23 11:01:47] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 1 ms to minimize.
[2023-03-23 11:01:48] [INFO ] Deduced a trap composed of 14 places in 501 ms of which 0 ms to minimize.
[2023-03-23 11:01:48] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 1 ms to minimize.
[2023-03-23 11:01:48] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 0 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 17 places in 332 ms of which 0 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 1 ms to minimize.
[2023-03-23 11:01:49] [INFO ] Deduced a trap composed of 16 places in 421 ms of which 1 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Deduced a trap composed of 18 places in 292 ms of which 1 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Deduced a trap composed of 14 places in 260 ms of which 1 ms to minimize.
[2023-03-23 11:01:50] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 0 ms to minimize.
[2023-03-23 11:01:51] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 0 ms to minimize.
[2023-03-23 11:01:51] [INFO ] Deduced a trap composed of 16 places in 363 ms of which 1 ms to minimize.
[2023-03-23 11:01:51] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:01:52] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 0 ms to minimize.
[2023-03-23 11:01:52] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 8379 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:01:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:01:52] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 76 ms.
Support contains 127 out of 1108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1108/1108 places, 958/958 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1108 transition count 953
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1103 transition count 953
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 10 place count 1103 transition count 948
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 1098 transition count 948
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 1097 transition count 947
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1097 transition count 947
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 1097 transition count 946
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 1096 transition count 946
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 5 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 98 place count 1059 transition count 909
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 113 place count 1059 transition count 909
Applied a total of 113 rules in 446 ms. Remains 1059 /1108 variables (removed 49) and now considering 909/958 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 447 ms. Remains : 1059/1108 places, 909/958 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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
Running SMT prover for 2 properties.
// Phase 1: matrix 909 rows 1059 cols
[2023-03-23 11:01:53] [INFO ] Computed 331 place invariants in 9 ms
[2023-03-23 11:01:53] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:01:53] [INFO ] [Nat]Absence check using 314 positive place invariants in 64 ms returned sat
[2023-03-23 11:01:53] [INFO ] [Nat]Absence check using 314 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-23 11:01:56] [INFO ] After 3115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:01:57] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 2 ms to minimize.
[2023-03-23 11:01:57] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-23 11:01:57] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 0 ms to minimize.
[2023-03-23 11:01:58] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-23 11:01:58] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2023-03-23 11:01:58] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-23 11:01:59] [INFO ] Deduced a trap composed of 5 places in 625 ms of which 1 ms to minimize.
[2023-03-23 11:02:00] [INFO ] Deduced a trap composed of 7 places in 564 ms of which 1 ms to minimize.
[2023-03-23 11:02:00] [INFO ] Deduced a trap composed of 7 places in 445 ms of which 0 ms to minimize.
[2023-03-23 11:02:01] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 0 ms to minimize.
[2023-03-23 11:02:01] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 0 ms to minimize.
[2023-03-23 11:02:01] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2023-03-23 11:02:02] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 0 ms to minimize.
[2023-03-23 11:02:02] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2023-03-23 11:02:02] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 0 ms to minimize.
[2023-03-23 11:02:02] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 0 ms to minimize.
[2023-03-23 11:02:03] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 0 ms to minimize.
[2023-03-23 11:02:03] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2023-03-23 11:02:03] [INFO ] Deduced a trap composed of 11 places in 243 ms of which 1 ms to minimize.
[2023-03-23 11:02:04] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 0 ms to minimize.
[2023-03-23 11:02:04] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2023-03-23 11:02:04] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 0 ms to minimize.
[2023-03-23 11:02:05] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2023-03-23 11:02:05] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2023-03-23 11:02:05] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2023-03-23 11:02:05] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 0 ms to minimize.
[2023-03-23 11:02:06] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 1 ms to minimize.
[2023-03-23 11:02:06] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2023-03-23 11:02:06] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 0 ms to minimize.
[2023-03-23 11:02:06] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 0 ms to minimize.
[2023-03-23 11:02:07] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 0 ms to minimize.
[2023-03-23 11:02:07] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 26 ms to minimize.
[2023-03-23 11:02:07] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 10770 ms
[2023-03-23 11:02:08] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2023-03-23 11:02:09] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2023-03-23 11:02:09] [INFO ] Deduced a trap composed of 7 places in 257 ms of which 0 ms to minimize.
[2023-03-23 11:02:09] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 1 ms to minimize.
[2023-03-23 11:02:09] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 0 ms to minimize.
[2023-03-23 11:02:10] [INFO ] Deduced a trap composed of 7 places in 544 ms of which 0 ms to minimize.
[2023-03-23 11:02:10] [INFO ] Deduced a trap composed of 7 places in 238 ms of which 1 ms to minimize.
[2023-03-23 11:02:11] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 1 ms to minimize.
[2023-03-23 11:02:11] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 1 ms to minimize.
[2023-03-23 11:02:14] [INFO ] Deduced a trap composed of 5 places in 2566 ms of which 2 ms to minimize.
[2023-03-23 11:02:14] [INFO ] Deduced a trap composed of 11 places in 356 ms of which 0 ms to minimize.
[2023-03-23 11:02:15] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 1 ms to minimize.
[2023-03-23 11:02:15] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 1 ms to minimize.
[2023-03-23 11:02:15] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 1 ms to minimize.
[2023-03-23 11:02:18] [INFO ] Deduced a trap composed of 10 places in 2143 ms of which 1 ms to minimize.
[2023-03-23 11:02:18] [INFO ] Deduced a trap composed of 12 places in 241 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:02:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:02:18] [INFO ] After 25115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 31 ms.
Support contains 103 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 909/909 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1059 transition count 906
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1056 transition count 906
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 1056 transition count 905
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 1055 transition count 905
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 44 place count 1037 transition count 887
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 56 place count 1037 transition count 887
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 1036 transition count 886
Applied a total of 57 rules in 178 ms. Remains 1036 /1059 variables (removed 23) and now considering 886/909 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1036/1059 places, 886/909 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 120935 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120935 steps, saw 112329 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 886 rows 1036 cols
[2023-03-23 11:02:21] [INFO ] Computed 331 place invariants in 17 ms
[2023-03-23 11:02:22] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:02:22] [INFO ] [Nat]Absence check using 311 positive place invariants in 60 ms returned sat
[2023-03-23 11:02:22] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 94 ms returned sat
[2023-03-23 11:02:23] [INFO ] After 1029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:02:24] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2023-03-23 11:02:24] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2023-03-23 11:02:24] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 1 ms to minimize.
[2023-03-23 11:02:24] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 0 ms to minimize.
[2023-03-23 11:02:25] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 1 ms to minimize.
[2023-03-23 11:02:25] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2023-03-23 11:02:25] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-23 11:02:25] [INFO ] Deduced a trap composed of 7 places in 223 ms of which 1 ms to minimize.
[2023-03-23 11:02:26] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2023-03-23 11:02:26] [INFO ] Deduced a trap composed of 5 places in 201 ms of which 0 ms to minimize.
[2023-03-23 11:02:26] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-23 11:02:27] [INFO ] Deduced a trap composed of 8 places in 182 ms of which 0 ms to minimize.
[2023-03-23 11:02:27] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2023-03-23 11:02:27] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-23 11:02:27] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2023-03-23 11:02:27] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2023-03-23 11:02:27] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 1 ms to minimize.
[2023-03-23 11:02:28] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 1 ms to minimize.
[2023-03-23 11:02:28] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 0 ms to minimize.
[2023-03-23 11:02:28] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 0 ms to minimize.
[2023-03-23 11:02:28] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4797 ms
[2023-03-23 11:02:29] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2023-03-23 11:02:29] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2023-03-23 11:02:30] [INFO ] Deduced a trap composed of 6 places in 458 ms of which 3 ms to minimize.
[2023-03-23 11:02:30] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2023-03-23 11:02:31] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2023-03-23 11:02:31] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 0 ms to minimize.
[2023-03-23 11:02:31] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 0 ms to minimize.
[2023-03-23 11:02:31] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-23 11:02:32] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-23 11:02:32] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2023-03-23 11:02:32] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2023-03-23 11:02:33] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-23 11:02:33] [INFO ] Deduced a trap composed of 11 places in 346 ms of which 0 ms to minimize.
[2023-03-23 11:02:33] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 0 ms to minimize.
[2023-03-23 11:02:34] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2023-03-23 11:02:34] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 0 ms to minimize.
[2023-03-23 11:02:34] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 1 ms to minimize.
[2023-03-23 11:02:35] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 0 ms to minimize.
[2023-03-23 11:02:35] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 1 ms to minimize.
[2023-03-23 11:02:35] [INFO ] Deduced a trap composed of 7 places in 281 ms of which 1 ms to minimize.
[2023-03-23 11:02:36] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 0 ms to minimize.
[2023-03-23 11:02:36] [INFO ] Deduced a trap composed of 11 places in 281 ms of which 1 ms to minimize.
[2023-03-23 11:02:36] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 1 ms to minimize.
[2023-03-23 11:02:37] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 0 ms to minimize.
[2023-03-23 11:02:37] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 0 ms to minimize.
[2023-03-23 11:02:37] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-23 11:02:37] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2023-03-23 11:02:37] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2023-03-23 11:02:38] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-23 11:02:38] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 0 ms to minimize.
[2023-03-23 11:02:38] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 0 ms to minimize.
[2023-03-23 11:02:38] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2023-03-23 11:02:38] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2023-03-23 11:02:39] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 9719 ms
[2023-03-23 11:02:39] [INFO ] After 16455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1067 ms.
[2023-03-23 11:02:40] [INFO ] After 18093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 80 ms.
Support contains 103 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 37 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 1036/1036 places, 886/886 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 26 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
[2023-03-23 11:02:40] [INFO ] Invariant cache hit.
[2023-03-23 11:02:41] [INFO ] Implicit Places using invariants in 1041 ms returned []
[2023-03-23 11:02:41] [INFO ] Invariant cache hit.
[2023-03-23 11:02:43] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2700 ms to find 0 implicit places.
[2023-03-23 11:02:43] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-23 11:02:43] [INFO ] Invariant cache hit.
[2023-03-23 11:02:43] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3412 ms. Remains : 1036/1036 places, 886/886 transitions.
Applied a total of 0 rules in 40 ms. Remains 1036 /1036 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-23 11:02:43] [INFO ] Invariant cache hit.
[2023-03-23 11:02:44] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 11:02:44] [INFO ] [Nat]Absence check using 311 positive place invariants in 74 ms returned sat
[2023-03-23 11:02:44] [INFO ] [Nat]Absence check using 311 positive and 20 generalized place invariants in 19 ms returned sat
[2023-03-23 11:02:46] [INFO ] After 1845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 11:02:46] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2023-03-23 11:02:46] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2023-03-23 11:02:47] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 0 ms to minimize.
[2023-03-23 11:02:47] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 1 ms to minimize.
[2023-03-23 11:02:47] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 1 ms to minimize.
[2023-03-23 11:02:47] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2023-03-23 11:02:47] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 1 ms to minimize.
[2023-03-23 11:02:48] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 1 ms to minimize.
[2023-03-23 11:02:48] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2023-03-23 11:02:48] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 0 ms to minimize.
[2023-03-23 11:02:48] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-03-23 11:02:49] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 1 ms to minimize.
[2023-03-23 11:02:49] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2023-03-23 11:02:49] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-23 11:02:49] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 0 ms to minimize.
[2023-03-23 11:02:49] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 1 ms to minimize.
[2023-03-23 11:02:49] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 0 ms to minimize.
[2023-03-23 11:02:50] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-23 11:02:50] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-23 11:02:50] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-23 11:02:51] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2023-03-23 11:02:51] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-23 11:02:51] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-23 11:02:51] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2023-03-23 11:02:52] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2023-03-23 11:02:52] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-23 11:02:52] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
[2023-03-23 11:02:52] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 1 ms to minimize.
[2023-03-23 11:02:52] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-23 11:02:53] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 0 ms to minimize.
[2023-03-23 11:02:53] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-23 11:02:53] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 6987 ms
[2023-03-23 11:02:54] [INFO ] Deduced a trap composed of 7 places in 160 ms of which 1 ms to minimize.
[2023-03-23 11:02:54] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 1 ms to minimize.
[2023-03-23 11:02:54] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 1 ms to minimize.
[2023-03-23 11:02:55] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-23 11:02:55] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-23 11:02:56] [INFO ] Deduced a trap composed of 9 places in 396 ms of which 0 ms to minimize.
[2023-03-23 11:02:56] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-23 11:02:56] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 3 ms to minimize.
[2023-03-23 11:02:56] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 1 ms to minimize.
[2023-03-23 11:02:57] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 2 ms to minimize.
[2023-03-23 11:02:57] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 0 ms to minimize.
[2023-03-23 11:02:57] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2023-03-23 11:02:58] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2023-03-23 11:02:58] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 1 ms to minimize.
[2023-03-23 11:02:58] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-23 11:02:59] [INFO ] Deduced a trap composed of 8 places in 368 ms of which 1 ms to minimize.
[2023-03-23 11:02:59] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2023-03-23 11:02:59] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 0 ms to minimize.
[2023-03-23 11:03:00] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2023-03-23 11:03:00] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2023-03-23 11:03:00] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2023-03-23 11:03:00] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 1 ms to minimize.
[2023-03-23 11:03:01] [INFO ] Deduced a trap composed of 8 places in 216 ms of which 0 ms to minimize.
[2023-03-23 11:03:01] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 0 ms to minimize.
[2023-03-23 11:03:01] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2023-03-23 11:03:01] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2023-03-23 11:03:01] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 7914 ms
[2023-03-23 11:03:01] [INFO ] After 17587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 818 ms.
[2023-03-23 11:03:02] [INFO ] After 18768ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-23 11:03:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 33 ms.
[2023-03-23 11:03:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1036 places, 886 transitions and 3763 arcs took 24 ms.
[2023-03-23 11:03:03] [INFO ] Flatten gal took : 131 ms
Total runtime 127658 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (PT), instance 030B
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: 1036 places, 886 transitions, 3763 arcs.
Final Score: 70328.059
Took : 38 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679569422183

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 5722:
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="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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-167903718800479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030B.tgz
mv ShieldPPPs-PT-030B 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;