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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 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:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M 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-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679572670971

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-100B
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 11:57:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 11:57:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 11:57:53] [INFO ] Load time of PNML (sax parser for PT used): 275 ms
[2023-03-23 11:57:53] [INFO ] Transformed 6803 places.
[2023-03-23 11:57:53] [INFO ] Transformed 6303 transitions.
[2023-03-23 11:57:53] [INFO ] Found NUPN structural information;
[2023-03-23 11:57:53] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 680 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-23 11:57:55] [INFO ] Computed 1101 place invariants in 70 ms
[2023-03-23 11:57:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 1043 ms returned sat
[2023-03-23 11:57:59] [INFO ] After 4020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-23 11:58:02] [INFO ] [Nat]Absence check using 1101 positive place invariants in 760 ms returned sat
[2023-03-23 11:58:24] [INFO ] After 19992ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-23 11:58:24] [INFO ] After 20009ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-23 11:58:24] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 12 Parikh solutions to 2 different solutions.
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 320 ms.
Support contains 275 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 6803 transition count 5670
Reduce places removed 633 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 655 rules applied. Total rules applied 1288 place count 6170 transition count 5648
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1310 place count 6148 transition count 5648
Performed 492 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 492 Pre rules applied. Total rules applied 1310 place count 6148 transition count 5156
Deduced a syphon composed of 492 places in 24 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 3 with 984 rules applied. Total rules applied 2294 place count 5656 transition count 5156
Discarding 648 places :
Symmetric choice reduction at 3 with 648 rule applications. Total rules 2942 place count 5008 transition count 4508
Iterating global reduction 3 with 648 rules applied. Total rules applied 3590 place count 5008 transition count 4508
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 242 Pre rules applied. Total rules applied 3590 place count 5008 transition count 4266
Deduced a syphon composed of 242 places in 25 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 484 rules applied. Total rules applied 4074 place count 4766 transition count 4266
Performed 1382 Post agglomeration using F-continuation condition.Transition count delta: 1382
Deduced a syphon composed of 1382 places in 10 ms
Reduce places removed 1382 places and 0 transitions.
Iterating global reduction 3 with 2764 rules applied. Total rules applied 6838 place count 3384 transition count 2884
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 820 times.
Drop transitions removed 820 transitions
Iterating global reduction 3 with 820 rules applied. Total rules applied 7658 place count 3384 transition count 2884
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7659 place count 3383 transition count 2883
Applied a total of 7659 rules in 2877 ms. Remains 3383 /6803 variables (removed 3420) and now considering 2883/6303 (removed 3420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2878 ms. Remains : 3383/6803 places, 2883/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 10) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2883 rows 3383 cols
[2023-03-23 11:58:28] [INFO ] Computed 1101 place invariants in 158 ms
[2023-03-23 11:58:30] [INFO ] [Real]Absence check using 1053 positive place invariants in 438 ms returned sat
[2023-03-23 11:58:30] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 34 ms returned sat
[2023-03-23 11:58:30] [INFO ] After 1516ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 11:58:31] [INFO ] [Nat]Absence check using 1053 positive place invariants in 291 ms returned sat
[2023-03-23 11:58:31] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 33 ms returned sat
[2023-03-23 11:58:39] [INFO ] After 7495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 11:58:41] [INFO ] Deduced a trap composed of 5 places in 1020 ms of which 11 ms to minimize.
[2023-03-23 11:58:42] [INFO ] Deduced a trap composed of 9 places in 873 ms of which 3 ms to minimize.
[2023-03-23 11:58:43] [INFO ] Deduced a trap composed of 7 places in 1115 ms of which 16 ms to minimize.
[2023-03-23 11:58:44] [INFO ] Deduced a trap composed of 5 places in 775 ms of which 14 ms to minimize.
[2023-03-23 11:58:45] [INFO ] Deduced a trap composed of 4 places in 846 ms of which 2 ms to minimize.
[2023-03-23 11:58:46] [INFO ] Deduced a trap composed of 4 places in 705 ms of which 2 ms to minimize.
[2023-03-23 11:58:47] [INFO ] Deduced a trap composed of 9 places in 715 ms of which 2 ms to minimize.
[2023-03-23 11:58:47] [INFO ] Deduced a trap composed of 4 places in 722 ms of which 2 ms to minimize.
[2023-03-23 11:58:48] [INFO ] Deduced a trap composed of 6 places in 749 ms of which 2 ms to minimize.
[2023-03-23 11:58:49] [INFO ] Deduced a trap composed of 16 places in 735 ms of which 1 ms to minimize.
[2023-03-23 11:58:50] [INFO ] Deduced a trap composed of 6 places in 753 ms of which 3 ms to minimize.
[2023-03-23 11:58:51] [INFO ] Deduced a trap composed of 5 places in 834 ms of which 2 ms to minimize.
[2023-03-23 11:58:52] [INFO ] Deduced a trap composed of 22 places in 867 ms of which 3 ms to minimize.
[2023-03-23 11:58:53] [INFO ] Deduced a trap composed of 8 places in 851 ms of which 1 ms to minimize.
[2023-03-23 11:58:54] [INFO ] Deduced a trap composed of 15 places in 675 ms of which 2 ms to minimize.
[2023-03-23 11:58:55] [INFO ] Deduced a trap composed of 21 places in 703 ms of which 2 ms to minimize.
[2023-03-23 11:58:56] [INFO ] Deduced a trap composed of 12 places in 679 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:58:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:58:56] [INFO ] After 25723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1542 ms.
Support contains 274 out of 3383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3383/3383 places, 2883/2883 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3383 transition count 2882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3382 transition count 2882
Applied a total of 2 rules in 180 ms. Remains 3382 /3383 variables (removed 1) and now considering 2882/2883 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 3382/3383 places, 2882/2883 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 89 ms. (steps per millisecond=112 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) 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 9) 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 9) seen :0
Interrupted probabilistic random walk after 61020 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61020 steps, saw 58769 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2882 rows 3382 cols
[2023-03-23 11:59:02] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-23 11:59:03] [INFO ] [Real]Absence check using 1046 positive place invariants in 291 ms returned sat
[2023-03-23 11:59:03] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 30 ms returned sat
[2023-03-23 11:59:03] [INFO ] After 1465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 11:59:05] [INFO ] [Nat]Absence check using 1046 positive place invariants in 444 ms returned sat
[2023-03-23 11:59:05] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 26 ms returned sat
[2023-03-23 11:59:15] [INFO ] After 9105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 11:59:16] [INFO ] Deduced a trap composed of 4 places in 1115 ms of which 2 ms to minimize.
[2023-03-23 11:59:17] [INFO ] Deduced a trap composed of 12 places in 799 ms of which 2 ms to minimize.
[2023-03-23 11:59:18] [INFO ] Deduced a trap composed of 9 places in 837 ms of which 2 ms to minimize.
[2023-03-23 11:59:19] [INFO ] Deduced a trap composed of 7 places in 813 ms of which 2 ms to minimize.
[2023-03-23 11:59:20] [INFO ] Deduced a trap composed of 7 places in 801 ms of which 2 ms to minimize.
[2023-03-23 11:59:21] [INFO ] Deduced a trap composed of 11 places in 776 ms of which 3 ms to minimize.
[2023-03-23 11:59:21] [INFO ] Deduced a trap composed of 8 places in 763 ms of which 2 ms to minimize.
[2023-03-23 11:59:22] [INFO ] Deduced a trap composed of 8 places in 865 ms of which 3 ms to minimize.
[2023-03-23 11:59:23] [INFO ] Deduced a trap composed of 9 places in 839 ms of which 2 ms to minimize.
[2023-03-23 11:59:24] [INFO ] Deduced a trap composed of 8 places in 748 ms of which 2 ms to minimize.
[2023-03-23 11:59:25] [INFO ] Deduced a trap composed of 6 places in 776 ms of which 2 ms to minimize.
[2023-03-23 11:59:26] [INFO ] Deduced a trap composed of 9 places in 720 ms of which 2 ms to minimize.
[2023-03-23 11:59:27] [INFO ] Deduced a trap composed of 15 places in 800 ms of which 1 ms to minimize.
[2023-03-23 11:59:28] [INFO ] Deduced a trap composed of 12 places in 858 ms of which 2 ms to minimize.
[2023-03-23 11:59:29] [INFO ] Deduced a trap composed of 7 places in 874 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:59:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 11:59:29] [INFO ] After 25851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1055 ms.
Support contains 274 out of 3382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 142 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 3382/3382 places, 2882/2882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 148 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
[2023-03-23 11:59:30] [INFO ] Invariant cache hit.
[2023-03-23 11:59:33] [INFO ] Implicit Places using invariants in 2724 ms returned []
[2023-03-23 11:59:33] [INFO ] Invariant cache hit.
[2023-03-23 11:59:35] [INFO ] Implicit Places using invariants and state equation in 2289 ms returned []
Implicit Place search using SMT with State Equation took 5029 ms to find 0 implicit places.
[2023-03-23 11:59:36] [INFO ] Redundant transitions in 188 ms returned []
[2023-03-23 11:59:36] [INFO ] Invariant cache hit.
[2023-03-23 11:59:38] [INFO ] Dead Transitions using invariants and state equation in 2587 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7964 ms. Remains : 3382/3382 places, 2882/2882 transitions.
Applied a total of 0 rules in 170 ms. Remains 3382 /3382 variables (removed 0) and now considering 2882/2882 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-03-23 11:59:38] [INFO ] Invariant cache hit.
[2023-03-23 11:59:40] [INFO ] [Real]Absence check using 1046 positive place invariants in 381 ms returned sat
[2023-03-23 11:59:40] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-23 11:59:40] [INFO ] After 1658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-23 11:59:41] [INFO ] [Nat]Absence check using 1046 positive place invariants in 403 ms returned sat
[2023-03-23 11:59:41] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 16 ms returned sat
[2023-03-23 11:59:50] [INFO ] After 8216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-23 11:59:51] [INFO ] Deduced a trap composed of 4 places in 816 ms of which 2 ms to minimize.
[2023-03-23 11:59:52] [INFO ] Deduced a trap composed of 6 places in 927 ms of which 8 ms to minimize.
[2023-03-23 11:59:53] [INFO ] Deduced a trap composed of 8 places in 796 ms of which 2 ms to minimize.
[2023-03-23 11:59:54] [INFO ] Deduced a trap composed of 4 places in 760 ms of which 2 ms to minimize.
[2023-03-23 11:59:55] [INFO ] Deduced a trap composed of 5 places in 1004 ms of which 2 ms to minimize.
[2023-03-23 11:59:56] [INFO ] Deduced a trap composed of 7 places in 966 ms of which 3 ms to minimize.
[2023-03-23 11:59:57] [INFO ] Deduced a trap composed of 9 places in 842 ms of which 4 ms to minimize.
[2023-03-23 11:59:58] [INFO ] Deduced a trap composed of 6 places in 841 ms of which 17 ms to minimize.
[2023-03-23 11:59:59] [INFO ] Deduced a trap composed of 6 places in 763 ms of which 1 ms to minimize.
[2023-03-23 12:00:00] [INFO ] Deduced a trap composed of 4 places in 775 ms of which 2 ms to minimize.
[2023-03-23 12:00:01] [INFO ] Deduced a trap composed of 10 places in 730 ms of which 1 ms to minimize.
[2023-03-23 12:00:02] [INFO ] Deduced a trap composed of 8 places in 826 ms of which 3 ms to minimize.
[2023-03-23 12:00:03] [INFO ] Deduced a trap composed of 13 places in 946 ms of which 2 ms to minimize.
[2023-03-23 12:00:04] [INFO ] Deduced a trap composed of 10 places in 833 ms of which 2 ms to minimize.
[2023-03-23 12:00:05] [INFO ] Deduced a trap composed of 8 places in 963 ms of which 2 ms to minimize.
[2023-03-23 12:00:06] [INFO ] Deduced a trap composed of 11 places in 845 ms of which 3 ms to minimize.
[2023-03-23 12:00:07] [INFO ] Deduced a trap composed of 9 places in 827 ms of which 2 ms to minimize.
[2023-03-23 12:00:08] [INFO ] Deduced a trap composed of 8 places in 770 ms of which 2 ms to minimize.
[2023-03-23 12:00:09] [INFO ] Deduced a trap composed of 5 places in 1039 ms of which 1 ms to minimize.
[2023-03-23 12:00:10] [INFO ] Deduced a trap composed of 26 places in 830 ms of which 2 ms to minimize.
[2023-03-23 12:00:11] [INFO ] Deduced a trap composed of 5 places in 704 ms of which 2 ms to minimize.
[2023-03-23 12:00:12] [INFO ] Deduced a trap composed of 7 places in 764 ms of which 2 ms to minimize.
[2023-03-23 12:00:13] [INFO ] Deduced a trap composed of 15 places in 761 ms of which 2 ms to minimize.
[2023-03-23 12:00:14] [INFO ] Deduced a trap composed of 5 places in 895 ms of which 6 ms to minimize.
[2023-03-23 12:00:15] [INFO ] Deduced a trap composed of 7 places in 1036 ms of which 2 ms to minimize.
[2023-03-23 12:00:16] [INFO ] Deduced a trap composed of 4 places in 966 ms of which 3 ms to minimize.
[2023-03-23 12:00:17] [INFO ] Deduced a trap composed of 4 places in 994 ms of which 4 ms to minimize.
[2023-03-23 12:00:19] [INFO ] Deduced a trap composed of 6 places in 1113 ms of which 2 ms to minimize.
[2023-03-23 12:00:20] [INFO ] Deduced a trap composed of 6 places in 969 ms of which 1 ms to minimize.
[2023-03-23 12:00:21] [INFO ] Deduced a trap composed of 4 places in 897 ms of which 2 ms to minimize.
[2023-03-23 12:00:22] [INFO ] Deduced a trap composed of 5 places in 879 ms of which 2 ms to minimize.
[2023-03-23 12:00:23] [INFO ] Deduced a trap composed of 4 places in 977 ms of which 3 ms to minimize.
[2023-03-23 12:00:24] [INFO ] Deduced a trap composed of 12 places in 901 ms of which 15 ms to minimize.
[2023-03-23 12:00:25] [INFO ] Deduced a trap composed of 13 places in 857 ms of which 2 ms to minimize.
[2023-03-23 12:00:26] [INFO ] Deduced a trap composed of 17 places in 806 ms of which 14 ms to minimize.
[2023-03-23 12:00:27] [INFO ] Deduced a trap composed of 21 places in 744 ms of which 4 ms to minimize.
[2023-03-23 12:00:28] [INFO ] Deduced a trap composed of 15 places in 765 ms of which 2 ms to minimize.
[2023-03-23 12:00:29] [INFO ] Deduced a trap composed of 14 places in 816 ms of which 3 ms to minimize.
[2023-03-23 12:00:30] [INFO ] Deduced a trap composed of 15 places in 965 ms of which 2 ms to minimize.
[2023-03-23 12:00:31] [INFO ] Deduced a trap composed of 24 places in 896 ms of which 1 ms to minimize.
[2023-03-23 12:00:32] [INFO ] Deduced a trap composed of 14 places in 1294 ms of which 2 ms to minimize.
[2023-03-23 12:00:33] [INFO ] Deduced a trap composed of 12 places in 771 ms of which 2 ms to minimize.
[2023-03-23 12:00:34] [INFO ] Deduced a trap composed of 14 places in 760 ms of which 2 ms to minimize.
[2023-03-23 12:00:35] [INFO ] Deduced a trap composed of 14 places in 815 ms of which 2 ms to minimize.
[2023-03-23 12:00:36] [INFO ] Deduced a trap composed of 16 places in 840 ms of which 1 ms to minimize.
[2023-03-23 12:00:37] [INFO ] Deduced a trap composed of 15 places in 830 ms of which 2 ms to minimize.
[2023-03-23 12:00:38] [INFO ] Deduced a trap composed of 18 places in 896 ms of which 2 ms to minimize.
[2023-03-23 12:00:39] [INFO ] Deduced a trap composed of 15 places in 798 ms of which 2 ms to minimize.
[2023-03-23 12:00:40] [INFO ] Deduced a trap composed of 13 places in 906 ms of which 1 ms to minimize.
[2023-03-23 12:00:41] [INFO ] Deduced a trap composed of 13 places in 838 ms of which 3 ms to minimize.
[2023-03-23 12:00:42] [INFO ] Deduced a trap composed of 13 places in 747 ms of which 2 ms to minimize.
[2023-03-23 12:00:43] [INFO ] Deduced a trap composed of 14 places in 719 ms of which 2 ms to minimize.
[2023-03-23 12:00:44] [INFO ] Deduced a trap composed of 24 places in 760 ms of which 1 ms to minimize.
[2023-03-23 12:00:45] [INFO ] Deduced a trap composed of 14 places in 759 ms of which 1 ms to minimize.
[2023-03-23 12:00:46] [INFO ] Deduced a trap composed of 17 places in 818 ms of which 1 ms to minimize.
[2023-03-23 12:00:47] [INFO ] Deduced a trap composed of 15 places in 847 ms of which 1 ms to minimize.
[2023-03-23 12:00:47] [INFO ] Deduced a trap composed of 16 places in 739 ms of which 2 ms to minimize.
[2023-03-23 12:00:48] [INFO ] Deduced a trap composed of 10 places in 831 ms of which 2 ms to minimize.
[2023-03-23 12:00:49] [INFO ] Deduced a trap composed of 15 places in 746 ms of which 1 ms to minimize.
[2023-03-23 12:00:50] [INFO ] Deduced a trap composed of 17 places in 870 ms of which 2 ms to minimize.
[2023-03-23 12:00:51] [INFO ] Deduced a trap composed of 15 places in 803 ms of which 2 ms to minimize.
[2023-03-23 12:00:52] [INFO ] Deduced a trap composed of 16 places in 823 ms of which 2 ms to minimize.
[2023-03-23 12:00:53] [INFO ] Deduced a trap composed of 15 places in 737 ms of which 1 ms to minimize.
[2023-03-23 12:00:54] [INFO ] Deduced a trap composed of 13 places in 867 ms of which 2 ms to minimize.
[2023-03-23 12:00:55] [INFO ] Deduced a trap composed of 13 places in 722 ms of which 2 ms to minimize.
[2023-03-23 12:00:56] [INFO ] Deduced a trap composed of 15 places in 813 ms of which 1 ms to minimize.
[2023-03-23 12:00:57] [INFO ] Deduced a trap composed of 15 places in 772 ms of which 1 ms to minimize.
[2023-03-23 12:00:58] [INFO ] Deduced a trap composed of 15 places in 816 ms of which 2 ms to minimize.
[2023-03-23 12:00:58] [INFO ] Deduced a trap composed of 15 places in 751 ms of which 1 ms to minimize.
[2023-03-23 12:00:59] [INFO ] Deduced a trap composed of 20 places in 849 ms of which 2 ms to minimize.
[2023-03-23 12:01:00] [INFO ] Deduced a trap composed of 18 places in 754 ms of which 1 ms to minimize.
[2023-03-23 12:01:01] [INFO ] Deduced a trap composed of 26 places in 669 ms of which 1 ms to minimize.
[2023-03-23 12:01:02] [INFO ] Deduced a trap composed of 15 places in 1027 ms of which 2 ms to minimize.
[2023-03-23 12:01:03] [INFO ] Deduced a trap composed of 16 places in 807 ms of which 20 ms to minimize.
[2023-03-23 12:01:04] [INFO ] Deduced a trap composed of 14 places in 639 ms of which 2 ms to minimize.
[2023-03-23 12:01:05] [INFO ] Deduced a trap composed of 18 places in 648 ms of which 1 ms to minimize.
[2023-03-23 12:01:05] [INFO ] Deduced a trap composed of 15 places in 611 ms of which 1 ms to minimize.
[2023-03-23 12:01:06] [INFO ] Deduced a trap composed of 29 places in 760 ms of which 2 ms to minimize.
[2023-03-23 12:01:07] [INFO ] Deduced a trap composed of 16 places in 706 ms of which 1 ms to minimize.
[2023-03-23 12:01:08] [INFO ] Deduced a trap composed of 29 places in 847 ms of which 2 ms to minimize.
[2023-03-23 12:01:09] [INFO ] Deduced a trap composed of 28 places in 760 ms of which 2 ms to minimize.
[2023-03-23 12:01:10] [INFO ] Deduced a trap composed of 15 places in 1029 ms of which 2 ms to minimize.
[2023-03-23 12:01:11] [INFO ] Deduced a trap composed of 21 places in 703 ms of which 2 ms to minimize.
[2023-03-23 12:01:12] [INFO ] Deduced a trap composed of 41 places in 653 ms of which 1 ms to minimize.
[2023-03-23 12:01:12] [INFO ] Trap strengthening (SAT) tested/added 85/84 trap constraints in 81640 ms
[2023-03-23 12:01:13] [INFO ] Deduced a trap composed of 4 places in 722 ms of which 2 ms to minimize.
[2023-03-23 12:01:14] [INFO ] Deduced a trap composed of 4 places in 650 ms of which 2 ms to minimize.
[2023-03-23 12:01:15] [INFO ] Deduced a trap composed of 7 places in 689 ms of which 2 ms to minimize.
[2023-03-23 12:01:16] [INFO ] Deduced a trap composed of 4 places in 758 ms of which 2 ms to minimize.
[2023-03-23 12:01:17] [INFO ] Deduced a trap composed of 5 places in 839 ms of which 1 ms to minimize.
[2023-03-23 12:01:18] [INFO ] Deduced a trap composed of 8 places in 751 ms of which 1 ms to minimize.
[2023-03-23 12:01:19] [INFO ] Deduced a trap composed of 4 places in 738 ms of which 18 ms to minimize.
[2023-03-23 12:01:20] [INFO ] Deduced a trap composed of 11 places in 918 ms of which 1 ms to minimize.
[2023-03-23 12:01:21] [INFO ] Deduced a trap composed of 12 places in 705 ms of which 1 ms to minimize.
[2023-03-23 12:01:21] [INFO ] Deduced a trap composed of 6 places in 574 ms of which 2 ms to minimize.
[2023-03-23 12:01:22] [INFO ] Deduced a trap composed of 10 places in 620 ms of which 2 ms to minimize.
[2023-03-23 12:01:23] [INFO ] Deduced a trap composed of 9 places in 663 ms of which 1 ms to minimize.
[2023-03-23 12:01:24] [INFO ] Deduced a trap composed of 7 places in 625 ms of which 1 ms to minimize.
[2023-03-23 12:01:24] [INFO ] Deduced a trap composed of 6 places in 693 ms of which 1 ms to minimize.
[2023-03-23 12:01:25] [INFO ] Deduced a trap composed of 7 places in 527 ms of which 2 ms to minimize.
[2023-03-23 12:01:26] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 2 ms to minimize.
[2023-03-23 12:01:27] [INFO ] Deduced a trap composed of 10 places in 1040 ms of which 1 ms to minimize.
[2023-03-23 12:01:28] [INFO ] Deduced a trap composed of 6 places in 572 ms of which 1 ms to minimize.
[2023-03-23 12:01:29] [INFO ] Deduced a trap composed of 9 places in 644 ms of which 28 ms to minimize.
[2023-03-23 12:01:29] [INFO ] Deduced a trap composed of 6 places in 630 ms of which 2 ms to minimize.
[2023-03-23 12:01:30] [INFO ] Deduced a trap composed of 13 places in 484 ms of which 1 ms to minimize.
[2023-03-23 12:01:31] [INFO ] Deduced a trap composed of 13 places in 544 ms of which 1 ms to minimize.
[2023-03-23 12:01:31] [INFO ] Deduced a trap composed of 20 places in 432 ms of which 1 ms to minimize.
[2023-03-23 12:01:32] [INFO ] Deduced a trap composed of 10 places in 550 ms of which 1 ms to minimize.
[2023-03-23 12:01:33] [INFO ] Deduced a trap composed of 9 places in 471 ms of which 1 ms to minimize.
[2023-03-23 12:01:33] [INFO ] Deduced a trap composed of 21 places in 535 ms of which 14 ms to minimize.
[2023-03-23 12:01:34] [INFO ] Deduced a trap composed of 13 places in 654 ms of which 1 ms to minimize.
[2023-03-23 12:01:35] [INFO ] Deduced a trap composed of 13 places in 517 ms of which 2 ms to minimize.
[2023-03-23 12:01:35] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 1 ms to minimize.
[2023-03-23 12:01:36] [INFO ] Deduced a trap composed of 13 places in 668 ms of which 1 ms to minimize.
[2023-03-23 12:01:37] [INFO ] Deduced a trap composed of 16 places in 534 ms of which 2 ms to minimize.
[2023-03-23 12:01:37] [INFO ] Deduced a trap composed of 19 places in 520 ms of which 2 ms to minimize.
[2023-03-23 12:01:38] [INFO ] Deduced a trap composed of 17 places in 443 ms of which 1 ms to minimize.
[2023-03-23 12:01:38] [INFO ] Deduced a trap composed of 16 places in 491 ms of which 2 ms to minimize.
[2023-03-23 12:01:39] [INFO ] Deduced a trap composed of 14 places in 499 ms of which 1 ms to minimize.
[2023-03-23 12:01:40] [INFO ] Deduced a trap composed of 15 places in 469 ms of which 1 ms to minimize.
[2023-03-23 12:01:40] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 1 ms to minimize.
[2023-03-23 12:01:41] [INFO ] Deduced a trap composed of 19 places in 483 ms of which 1 ms to minimize.
[2023-03-23 12:01:41] [INFO ] Deduced a trap composed of 29 places in 435 ms of which 1 ms to minimize.
[2023-03-23 12:01:42] [INFO ] Deduced a trap composed of 31 places in 541 ms of which 1 ms to minimize.
[2023-03-23 12:01:43] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 1 ms to minimize.
[2023-03-23 12:01:44] [INFO ] Deduced a trap composed of 11 places in 675 ms of which 1 ms to minimize.
[2023-03-23 12:01:44] [INFO ] Deduced a trap composed of 13 places in 495 ms of which 1 ms to minimize.
[2023-03-23 12:01:45] [INFO ] Deduced a trap composed of 30 places in 489 ms of which 1 ms to minimize.
[2023-03-23 12:01:45] [INFO ] Deduced a trap composed of 14 places in 505 ms of which 1 ms to minimize.
[2023-03-23 12:01:46] [INFO ] Deduced a trap composed of 34 places in 405 ms of which 3 ms to minimize.
[2023-03-23 12:01:46] [INFO ] Deduced a trap composed of 41 places in 428 ms of which 1 ms to minimize.
[2023-03-23 12:01:47] [INFO ] Deduced a trap composed of 8 places in 438 ms of which 1 ms to minimize.
[2023-03-23 12:01:48] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2023-03-23 12:01:48] [INFO ] Deduced a trap composed of 12 places in 532 ms of which 1 ms to minimize.
[2023-03-23 12:01:49] [INFO ] Deduced a trap composed of 17 places in 470 ms of which 1 ms to minimize.
[2023-03-23 12:01:49] [INFO ] Deduced a trap composed of 11 places in 483 ms of which 1 ms to minimize.
[2023-03-23 12:01:49] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 36953 ms
[2023-03-23 12:01:54] [INFO ] Deduced a trap composed of 8 places in 483 ms of which 1 ms to minimize.
[2023-03-23 12:01:55] [INFO ] Deduced a trap composed of 6 places in 476 ms of which 0 ms to minimize.
[2023-03-23 12:01:56] [INFO ] Deduced a trap composed of 8 places in 497 ms of which 1 ms to minimize.
[2023-03-23 12:01:56] [INFO ] Deduced a trap composed of 6 places in 457 ms of which 1 ms to minimize.
[2023-03-23 12:01:57] [INFO ] Deduced a trap composed of 6 places in 537 ms of which 1 ms to minimize.
[2023-03-23 12:01:57] [INFO ] Deduced a trap composed of 5 places in 483 ms of which 1 ms to minimize.
[2023-03-23 12:01:58] [INFO ] Deduced a trap composed of 12 places in 438 ms of which 0 ms to minimize.
[2023-03-23 12:01:59] [INFO ] Deduced a trap composed of 12 places in 424 ms of which 1 ms to minimize.
[2023-03-23 12:01:59] [INFO ] Deduced a trap composed of 7 places in 387 ms of which 1 ms to minimize.
[2023-03-23 12:02:00] [INFO ] Deduced a trap composed of 11 places in 361 ms of which 0 ms to minimize.
[2023-03-23 12:02:00] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 1 ms to minimize.
[2023-03-23 12:02:01] [INFO ] Deduced a trap composed of 7 places in 363 ms of which 1 ms to minimize.
[2023-03-23 12:02:01] [INFO ] Deduced a trap composed of 13 places in 410 ms of which 2 ms to minimize.
[2023-03-23 12:02:02] [INFO ] Deduced a trap composed of 8 places in 394 ms of which 1 ms to minimize.
[2023-03-23 12:02:02] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 1 ms to minimize.
[2023-03-23 12:02:03] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2023-03-23 12:02:04] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 1 ms to minimize.
[2023-03-23 12:02:04] [INFO ] Deduced a trap composed of 7 places in 320 ms of which 1 ms to minimize.
[2023-03-23 12:02:05] [INFO ] Deduced a trap composed of 8 places in 416 ms of which 1 ms to minimize.
[2023-03-23 12:02:05] [INFO ] Deduced a trap composed of 8 places in 295 ms of which 1 ms to minimize.
[2023-03-23 12:02:06] [INFO ] Deduced a trap composed of 6 places in 303 ms of which 0 ms to minimize.
[2023-03-23 12:02:06] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 1 ms to minimize.
[2023-03-23 12:02:07] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-23 12:02:07] [INFO ] Deduced a trap composed of 8 places in 261 ms of which 0 ms to minimize.
[2023-03-23 12:02:07] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 1 ms to minimize.
[2023-03-23 12:02:08] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 1 ms to minimize.
[2023-03-23 12:02:08] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2023-03-23 12:02:09] [INFO ] Deduced a trap composed of 9 places in 387 ms of which 0 ms to minimize.
[2023-03-23 12:02:09] [INFO ] Deduced a trap composed of 13 places in 315 ms of which 1 ms to minimize.
[2023-03-23 12:02:10] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 0 ms to minimize.
[2023-03-23 12:02:10] [INFO ] Deduced a trap composed of 13 places in 295 ms of which 0 ms to minimize.
[2023-03-23 12:02:11] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 0 ms to minimize.
[2023-03-23 12:02:11] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 2 ms to minimize.
[2023-03-23 12:02:11] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 0 ms to minimize.
[2023-03-23 12:02:12] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2023-03-23 12:02:12] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 0 ms to minimize.
[2023-03-23 12:02:13] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2023-03-23 12:02:13] [INFO ] Deduced a trap composed of 15 places in 318 ms of which 1 ms to minimize.
[2023-03-23 12:02:14] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 1 ms to minimize.
[2023-03-23 12:02:14] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 1 ms to minimize.
[2023-03-23 12:02:15] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 1 ms to minimize.
[2023-03-23 12:02:15] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2023-03-23 12:02:15] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 1 ms to minimize.
[2023-03-23 12:02:16] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2023-03-23 12:02:16] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 22719 ms
[2023-03-23 12:02:17] [INFO ] Deduced a trap composed of 28 places in 551 ms of which 1 ms to minimize.
[2023-03-23 12:02:18] [INFO ] Deduced a trap composed of 17 places in 502 ms of which 1 ms to minimize.
[2023-03-23 12:02:18] [INFO ] Deduced a trap composed of 17 places in 590 ms of which 7 ms to minimize.
[2023-03-23 12:02:19] [INFO ] Deduced a trap composed of 12 places in 519 ms of which 1 ms to minimize.
[2023-03-23 12:02:20] [INFO ] Deduced a trap composed of 5 places in 489 ms of which 1 ms to minimize.
[2023-03-23 12:02:20] [INFO ] Deduced a trap composed of 13 places in 531 ms of which 1 ms to minimize.
[2023-03-23 12:02:21] [INFO ] Deduced a trap composed of 12 places in 464 ms of which 1 ms to minimize.
[2023-03-23 12:02:21] [INFO ] Deduced a trap composed of 9 places in 429 ms of which 1 ms to minimize.
[2023-03-23 12:02:22] [INFO ] Deduced a trap composed of 11 places in 509 ms of which 1 ms to minimize.
[2023-03-23 12:02:23] [INFO ] Deduced a trap composed of 15 places in 447 ms of which 1 ms to minimize.
[2023-03-23 12:02:23] [INFO ] Deduced a trap composed of 8 places in 397 ms of which 1 ms to minimize.
[2023-03-23 12:02:24] [INFO ] Deduced a trap composed of 14 places in 420 ms of which 1 ms to minimize.
[2023-03-23 12:02:24] [INFO ] Deduced a trap composed of 12 places in 349 ms of which 1 ms to minimize.
[2023-03-23 12:02:25] [INFO ] Deduced a trap composed of 13 places in 433 ms of which 0 ms to minimize.
[2023-03-23 12:02:25] [INFO ] Deduced a trap composed of 16 places in 482 ms of which 1 ms to minimize.
[2023-03-23 12:02:26] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 1 ms to minimize.
[2023-03-23 12:02:27] [INFO ] Deduced a trap composed of 18 places in 432 ms of which 1 ms to minimize.
[2023-03-23 12:02:27] [INFO ] Deduced a trap composed of 9 places in 473 ms of which 0 ms to minimize.
[2023-03-23 12:02:28] [INFO ] Deduced a trap composed of 7 places in 344 ms of which 1 ms to minimize.
[2023-03-23 12:02:28] [INFO ] Deduced a trap composed of 12 places in 446 ms of which 12 ms to minimize.
[2023-03-23 12:02:29] [INFO ] Deduced a trap composed of 11 places in 434 ms of which 2 ms to minimize.
[2023-03-23 12:02:29] [INFO ] Deduced a trap composed of 29 places in 392 ms of which 6 ms to minimize.
[2023-03-23 12:02:30] [INFO ] Deduced a trap composed of 14 places in 370 ms of which 1 ms to minimize.
[2023-03-23 12:02:30] [INFO ] Deduced a trap composed of 14 places in 401 ms of which 1 ms to minimize.
[2023-03-23 12:02:31] [INFO ] Deduced a trap composed of 17 places in 436 ms of which 1 ms to minimize.
[2023-03-23 12:02:32] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 0 ms to minimize.
[2023-03-23 12:02:32] [INFO ] Deduced a trap composed of 18 places in 436 ms of which 1 ms to minimize.
[2023-03-23 12:02:33] [INFO ] Deduced a trap composed of 14 places in 380 ms of which 0 ms to minimize.
[2023-03-23 12:02:33] [INFO ] Deduced a trap composed of 16 places in 401 ms of which 1 ms to minimize.
[2023-03-23 12:02:34] [INFO ] Deduced a trap composed of 16 places in 413 ms of which 0 ms to minimize.
[2023-03-23 12:02:34] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 1 ms to minimize.
[2023-03-23 12:02:35] [INFO ] Deduced a trap composed of 16 places in 344 ms of which 1 ms to minimize.
[2023-03-23 12:02:35] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 1 ms to minimize.
[2023-03-23 12:02:36] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 1 ms to minimize.
[2023-03-23 12:02:36] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
[2023-03-23 12:02:37] [INFO ] Deduced a trap composed of 34 places in 363 ms of which 0 ms to minimize.
[2023-03-23 12:02:37] [INFO ] Deduced a trap composed of 27 places in 353 ms of which 2 ms to minimize.
[2023-03-23 12:02:37] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 1 ms to minimize.
[2023-03-23 12:02:38] [INFO ] Deduced a trap composed of 26 places in 696 ms of which 1 ms to minimize.
[2023-03-23 12:02:39] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 1 ms to minimize.
[2023-03-23 12:02:39] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 1 ms to minimize.
[2023-03-23 12:02:39] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 10 ms to minimize.
[2023-03-23 12:02:40] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 15 ms to minimize.
[2023-03-23 12:02:40] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 6 ms to minimize.
[2023-03-23 12:02:41] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 1 ms to minimize.
[2023-03-23 12:02:41] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2023-03-23 12:02:41] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 24846 ms
[2023-03-23 12:02:43] [INFO ] Deduced a trap composed of 5 places in 532 ms of which 1 ms to minimize.
[2023-03-23 12:02:44] [INFO ] Deduced a trap composed of 13 places in 656 ms of which 2 ms to minimize.
[2023-03-23 12:02:45] [INFO ] Deduced a trap composed of 11 places in 515 ms of which 1 ms to minimize.
[2023-03-23 12:02:45] [INFO ] Deduced a trap composed of 9 places in 522 ms of which 1 ms to minimize.
[2023-03-23 12:02:46] [INFO ] Deduced a trap composed of 9 places in 429 ms of which 1 ms to minimize.
[2023-03-23 12:02:47] [INFO ] Deduced a trap composed of 9 places in 428 ms of which 0 ms to minimize.
[2023-03-23 12:02:47] [INFO ] Deduced a trap composed of 8 places in 392 ms of which 1 ms to minimize.
[2023-03-23 12:02:48] [INFO ] Deduced a trap composed of 14 places in 645 ms of which 1 ms to minimize.
[2023-03-23 12:02:49] [INFO ] Deduced a trap composed of 10 places in 445 ms of which 1 ms to minimize.
[2023-03-23 12:02:49] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 1 ms to minimize.
[2023-03-23 12:02:50] [INFO ] Deduced a trap composed of 13 places in 385 ms of which 1 ms to minimize.
[2023-03-23 12:02:50] [INFO ] Deduced a trap composed of 14 places in 379 ms of which 1 ms to minimize.
[2023-03-23 12:02:51] [INFO ] Deduced a trap composed of 9 places in 437 ms of which 1 ms to minimize.
[2023-03-23 12:02:51] [INFO ] Deduced a trap composed of 6 places in 488 ms of which 1 ms to minimize.
[2023-03-23 12:02:52] [INFO ] Deduced a trap composed of 9 places in 435 ms of which 1 ms to minimize.
[2023-03-23 12:02:52] [INFO ] Deduced a trap composed of 15 places in 386 ms of which 1 ms to minimize.
[2023-03-23 12:02:53] [INFO ] Deduced a trap composed of 8 places in 436 ms of which 1 ms to minimize.
[2023-03-23 12:02:54] [INFO ] Deduced a trap composed of 15 places in 406 ms of which 13 ms to minimize.
[2023-03-23 12:02:54] [INFO ] Deduced a trap composed of 14 places in 453 ms of which 0 ms to minimize.
[2023-03-23 12:02:55] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2023-03-23 12:02:55] [INFO ] Deduced a trap composed of 14 places in 374 ms of which 1 ms to minimize.
[2023-03-23 12:02:56] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 0 ms to minimize.
[2023-03-23 12:02:56] [INFO ] Deduced a trap composed of 9 places in 332 ms of which 2 ms to minimize.
[2023-03-23 12:02:57] [INFO ] Deduced a trap composed of 13 places in 381 ms of which 1 ms to minimize.
[2023-03-23 12:02:57] [INFO ] Deduced a trap composed of 16 places in 343 ms of which 0 ms to minimize.
[2023-03-23 12:02:58] [INFO ] Deduced a trap composed of 16 places in 326 ms of which 1 ms to minimize.
[2023-03-23 12:02:58] [INFO ] Deduced a trap composed of 14 places in 341 ms of which 1 ms to minimize.
[2023-03-23 12:02:59] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 1 ms to minimize.
[2023-03-23 12:02:59] [INFO ] Deduced a trap composed of 17 places in 490 ms of which 1 ms to minimize.
[2023-03-23 12:03:00] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 1 ms to minimize.
[2023-03-23 12:03:00] [INFO ] Deduced a trap composed of 14 places in 447 ms of which 1 ms to minimize.
[2023-03-23 12:03:01] [INFO ] Deduced a trap composed of 15 places in 327 ms of which 1 ms to minimize.
[2023-03-23 12:03:02] [INFO ] Deduced a trap composed of 13 places in 503 ms of which 1 ms to minimize.
[2023-03-23 12:03:02] [INFO ] Deduced a trap composed of 15 places in 435 ms of which 1 ms to minimize.
[2023-03-23 12:03:03] [INFO ] Deduced a trap composed of 16 places in 334 ms of which 0 ms to minimize.
[2023-03-23 12:03:03] [INFO ] Deduced a trap composed of 14 places in 387 ms of which 0 ms to minimize.
[2023-03-23 12:03:04] [INFO ] Deduced a trap composed of 13 places in 455 ms of which 1 ms to minimize.
[2023-03-23 12:03:04] [INFO ] Deduced a trap composed of 14 places in 365 ms of which 0 ms to minimize.
[2023-03-23 12:03:05] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 1 ms to minimize.
[2023-03-23 12:03:05] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 1 ms to minimize.
[2023-03-23 12:03:06] [INFO ] Deduced a trap composed of 15 places in 323 ms of which 1 ms to minimize.
[2023-03-23 12:03:06] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 1 ms to minimize.
[2023-03-23 12:03:07] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 1 ms to minimize.
[2023-03-23 12:03:08] [INFO ] Deduced a trap composed of 15 places in 373 ms of which 0 ms to minimize.
[2023-03-23 12:03:08] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 1 ms to minimize.
[2023-03-23 12:03:09] [INFO ] Deduced a trap composed of 18 places in 302 ms of which 1 ms to minimize.
[2023-03-23 12:03:10] [INFO ] Deduced a trap composed of 14 places in 385 ms of which 1 ms to minimize.
[2023-03-23 12:03:10] [INFO ] Deduced a trap composed of 14 places in 298 ms of which 5 ms to minimize.
[2023-03-23 12:03:11] [INFO ] Deduced a trap composed of 14 places in 384 ms of which 0 ms to minimize.
[2023-03-23 12:03:11] [INFO ] Deduced a trap composed of 16 places in 283 ms of which 1 ms to minimize.
[2023-03-23 12:03:12] [INFO ] Deduced a trap composed of 16 places in 299 ms of which 0 ms to minimize.
[2023-03-23 12:03:12] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2023-03-23 12:03:12] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 1 ms to minimize.
[2023-03-23 12:03:13] [INFO ] Deduced a trap composed of 18 places in 256 ms of which 0 ms to minimize.
[2023-03-23 12:03:13] [INFO ] Deduced a trap composed of 17 places in 316 ms of which 1 ms to minimize.
[2023-03-23 12:03:13] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 31107 ms
[2023-03-23 12:03:15] [INFO ] Deduced a trap composed of 8 places in 497 ms of which 3 ms to minimize.
[2023-03-23 12:03:17] [INFO ] Deduced a trap composed of 7 places in 791 ms of which 3 ms to minimize.
[2023-03-23 12:03:18] [INFO ] Deduced a trap composed of 10 places in 426 ms of which 1 ms to minimize.
[2023-03-23 12:03:18] [INFO ] Deduced a trap composed of 8 places in 462 ms of which 1 ms to minimize.
[2023-03-23 12:03:19] [INFO ] Deduced a trap composed of 8 places in 433 ms of which 1 ms to minimize.
[2023-03-23 12:03:20] [INFO ] Deduced a trap composed of 11 places in 469 ms of which 1 ms to minimize.
[2023-03-23 12:03:20] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2023-03-23 12:03:21] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 0 ms to minimize.
[2023-03-23 12:03:21] [INFO ] Deduced a trap composed of 6 places in 399 ms of which 1 ms to minimize.
[2023-03-23 12:03:22] [INFO ] Deduced a trap composed of 9 places in 385 ms of which 1 ms to minimize.
[2023-03-23 12:03:22] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 0 ms to minimize.
[2023-03-23 12:03:23] [INFO ] Deduced a trap composed of 10 places in 515 ms of which 1 ms to minimize.
[2023-03-23 12:03:24] [INFO ] Deduced a trap composed of 10 places in 496 ms of which 1 ms to minimize.
[2023-03-23 12:03:24] [INFO ] Deduced a trap composed of 10 places in 387 ms of which 1 ms to minimize.
[2023-03-23 12:03:25] [INFO ] Deduced a trap composed of 10 places in 373 ms of which 1 ms to minimize.
[2023-03-23 12:03:26] [INFO ] Deduced a trap composed of 9 places in 480 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.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
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 12:03:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 12:03:26] [INFO ] After 225405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
[2023-03-23 12:03:26] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-23 12:03:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3382 places, 2882 transitions and 12694 arcs took 16 ms.
[2023-03-23 12:03:26] [INFO ] Flatten gal took : 267 ms
Total runtime 333312 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ShieldPPPs (PT), instance 100B
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: 3382 places, 2882 transitions, 12694 arcs.
Final Score: 1104954.172
Took : 29 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1679573037228

--------------------
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 19007:
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-100B"
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-100B, 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-167903718900527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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