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.r266-smll-167863541200638.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Peterson-PT-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 204K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 847K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 215K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 124K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 364K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 288K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 839K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 877K 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 Peterson-PT-6-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-6-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679217834345

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 09:23:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 09:23:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:23:57] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2023-03-19 09:23:57] [INFO ] Transformed 1330 places.
[2023-03-19 09:23:57] [INFO ] Transformed 2030 transitions.
[2023-03-19 09:23:57] [INFO ] Found NUPN structural information;
[2023-03-19 09:23:57] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2023-03-19 09:23:57] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 168 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=10 ) properties (out of 16) seen :1
FORMULA Peterson-PT-6-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 15) seen :1
FORMULA Peterson-PT-6-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-19 09:23:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-19 09:23:58] [INFO ] Computed 27 place invariants in 47 ms
[2023-03-19 09:24:01] [INFO ] After 1175ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2023-03-19 09:24:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-19 09:24:02] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-19 09:24:04] [INFO ] After 1748ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :7
[2023-03-19 09:24:04] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:24:05] [INFO ] After 1030ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :7 sat :7
[2023-03-19 09:24:07] [INFO ] Deduced a trap composed of 23 places in 1300 ms of which 12 ms to minimize.
[2023-03-19 09:24:08] [INFO ] Deduced a trap composed of 12 places in 1787 ms of which 3 ms to minimize.
[2023-03-19 09:24:10] [INFO ] Deduced a trap composed of 15 places in 1434 ms of which 1 ms to minimize.
[2023-03-19 09:24:12] [INFO ] Deduced a trap composed of 16 places in 1562 ms of which 3 ms to minimize.
[2023-03-19 09:24:13] [INFO ] Deduced a trap composed of 24 places in 1450 ms of which 2 ms to minimize.
[2023-03-19 09:24:15] [INFO ] Deduced a trap composed of 185 places in 1538 ms of which 2 ms to minimize.
[2023-03-19 09:24:16] [INFO ] Deduced a trap composed of 117 places in 1285 ms of which 2 ms to minimize.
[2023-03-19 09:24:18] [INFO ] Deduced a trap composed of 34 places in 1466 ms of which 2 ms to minimize.
[2023-03-19 09:24:19] [INFO ] Deduced a trap composed of 49 places in 1191 ms of which 2 ms to minimize.
[2023-03-19 09:24:21] [INFO ] Deduced a trap composed of 203 places in 1500 ms of which 3 ms to minimize.
[2023-03-19 09:24:22] [INFO ] Deduced a trap composed of 24 places in 1529 ms of which 2 ms to minimize.
[2023-03-19 09:24:24] [INFO ] Deduced a trap composed of 24 places in 1184 ms of which 1 ms to minimize.
[2023-03-19 09:24:25] [INFO ] Deduced a trap composed of 87 places in 1260 ms of which 2 ms to minimize.
[2023-03-19 09:24:27] [INFO ] Deduced a trap composed of 29 places in 1447 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-19 09:24:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:24:27] [INFO ] After 25554ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0 real:12
FORMULA Peterson-PT-6-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-6-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 327 ms.
Support contains 59 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 506 transitions
Trivial Post-agglo rules discarded 506 transitions
Performed 506 trivial Post agglomeration. Transition count delta: 506
Iterating post reduction 0 with 506 rules applied. Total rules applied 506 place count 1330 transition count 1524
Reduce places removed 506 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 530 rules applied. Total rules applied 1036 place count 824 transition count 1500
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 1060 place count 800 transition count 1500
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 265 Pre rules applied. Total rules applied 1060 place count 800 transition count 1235
Deduced a syphon composed of 265 places in 3 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 3 with 530 rules applied. Total rules applied 1590 place count 535 transition count 1235
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 1660 place count 500 transition count 1200
Applied a total of 1660 rules in 320 ms. Remains 500 /1330 variables (removed 830) and now considering 1200/2030 (removed 830) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 500/1330 places, 1200/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 339840 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 339840 steps, saw 53317 distinct states, run finished after 3002 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-19 09:24:31] [INFO ] Flow matrix only has 990 transitions (discarded 210 similar events)
// Phase 1: matrix 990 rows 500 cols
[2023-03-19 09:24:31] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-19 09:24:31] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-19 09:24:31] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-19 09:24:31] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 09:24:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-19 09:24:32] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 09:24:32] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 09:24:32] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:24:33] [INFO ] After 581ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 09:24:34] [INFO ] Deduced a trap composed of 42 places in 602 ms of which 1 ms to minimize.
[2023-03-19 09:24:34] [INFO ] Deduced a trap composed of 12 places in 576 ms of which 1 ms to minimize.
[2023-03-19 09:24:35] [INFO ] Deduced a trap composed of 41 places in 534 ms of which 1 ms to minimize.
[2023-03-19 09:24:35] [INFO ] Deduced a trap composed of 53 places in 551 ms of which 1 ms to minimize.
[2023-03-19 09:24:36] [INFO ] Deduced a trap composed of 72 places in 538 ms of which 1 ms to minimize.
[2023-03-19 09:24:37] [INFO ] Deduced a trap composed of 10 places in 531 ms of which 1 ms to minimize.
[2023-03-19 09:24:37] [INFO ] Deduced a trap composed of 11 places in 554 ms of which 1 ms to minimize.
[2023-03-19 09:24:38] [INFO ] Deduced a trap composed of 12 places in 556 ms of which 2 ms to minimize.
[2023-03-19 09:24:38] [INFO ] Deduced a trap composed of 34 places in 546 ms of which 1 ms to minimize.
[2023-03-19 09:24:39] [INFO ] Deduced a trap composed of 10 places in 517 ms of which 1 ms to minimize.
[2023-03-19 09:24:40] [INFO ] Deduced a trap composed of 29 places in 531 ms of which 1 ms to minimize.
[2023-03-19 09:24:40] [INFO ] Deduced a trap composed of 47 places in 529 ms of which 1 ms to minimize.
[2023-03-19 09:24:41] [INFO ] Deduced a trap composed of 68 places in 536 ms of which 1 ms to minimize.
[2023-03-19 09:24:41] [INFO ] Deduced a trap composed of 53 places in 540 ms of which 1 ms to minimize.
[2023-03-19 09:24:42] [INFO ] Deduced a trap composed of 38 places in 509 ms of which 1 ms to minimize.
[2023-03-19 09:24:42] [INFO ] Deduced a trap composed of 45 places in 536 ms of which 2 ms to minimize.
[2023-03-19 09:24:43] [INFO ] Deduced a trap composed of 15 places in 539 ms of which 1 ms to minimize.
[2023-03-19 09:24:44] [INFO ] Deduced a trap composed of 10 places in 545 ms of which 1 ms to minimize.
[2023-03-19 09:24:44] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 1 ms to minimize.
[2023-03-19 09:24:45] [INFO ] Deduced a trap composed of 21 places in 514 ms of which 1 ms to minimize.
[2023-03-19 09:24:45] [INFO ] Deduced a trap composed of 22 places in 517 ms of which 4 ms to minimize.
[2023-03-19 09:24:46] [INFO ] Deduced a trap composed of 22 places in 500 ms of which 1 ms to minimize.
[2023-03-19 09:24:46] [INFO ] Deduced a trap composed of 21 places in 518 ms of which 2 ms to minimize.
[2023-03-19 09:24:47] [INFO ] Deduced a trap composed of 42 places in 394 ms of which 1 ms to minimize.
[2023-03-19 09:24:47] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 1 ms to minimize.
[2023-03-19 09:24:47] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 1 ms to minimize.
[2023-03-19 09:24:48] [INFO ] Deduced a trap composed of 72 places in 220 ms of which 0 ms to minimize.
[2023-03-19 09:24:48] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 0 ms to minimize.
[2023-03-19 09:24:48] [INFO ] Deduced a trap composed of 67 places in 246 ms of which 1 ms to minimize.
[2023-03-19 09:24:49] [INFO ] Deduced a trap composed of 62 places in 245 ms of which 0 ms to minimize.
[2023-03-19 09:24:49] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 1 ms to minimize.
[2023-03-19 09:24:49] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 1 ms to minimize.
[2023-03-19 09:24:49] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2023-03-19 09:24:49] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 0 ms to minimize.
[2023-03-19 09:24:50] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2023-03-19 09:24:50] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 1 ms to minimize.
[2023-03-19 09:24:50] [INFO ] Deduced a trap composed of 62 places in 187 ms of which 1 ms to minimize.
[2023-03-19 09:24:50] [INFO ] Deduced a trap composed of 60 places in 193 ms of which 1 ms to minimize.
[2023-03-19 09:24:51] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 0 ms to minimize.
[2023-03-19 09:24:51] [INFO ] Deduced a trap composed of 44 places in 189 ms of which 1 ms to minimize.
[2023-03-19 09:24:51] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 1 ms to minimize.
[2023-03-19 09:24:51] [INFO ] Deduced a trap composed of 11 places in 241 ms of which 0 ms to minimize.
[2023-03-19 09:24:52] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 2 ms to minimize.
[2023-03-19 09:24:52] [INFO ] Deduced a trap composed of 12 places in 354 ms of which 1 ms to minimize.
[2023-03-19 09:24:53] [INFO ] Deduced a trap composed of 52 places in 511 ms of which 1 ms to minimize.
[2023-03-19 09:24:53] [INFO ] Deduced a trap composed of 21 places in 413 ms of which 1 ms to minimize.
[2023-03-19 09:24:54] [INFO ] Deduced a trap composed of 23 places in 510 ms of which 1 ms to minimize.
[2023-03-19 09:24:54] [INFO ] Deduced a trap composed of 42 places in 425 ms of which 1 ms to minimize.
[2023-03-19 09:24:55] [INFO ] Deduced a trap composed of 33 places in 450 ms of which 1 ms to minimize.
[2023-03-19 09:24:55] [INFO ] Deduced a trap composed of 45 places in 460 ms of which 2 ms to minimize.
[2023-03-19 09:24:56] [INFO ] Deduced a trap composed of 43 places in 403 ms of which 1 ms to minimize.
[2023-03-19 09:24:56] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 1 ms to minimize.
[2023-03-19 09:24:57] [INFO ] Deduced a trap composed of 33 places in 460 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-19 09:24:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:24:57] [INFO ] After 25205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 120 ms.
Support contains 59 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1200/1200 transitions.
Applied a total of 0 rules in 53 ms. Remains 500 /500 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 500/500 places, 1200/1200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1200/1200 transitions.
Applied a total of 0 rules in 49 ms. Remains 500 /500 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
[2023-03-19 09:24:57] [INFO ] Flow matrix only has 990 transitions (discarded 210 similar events)
[2023-03-19 09:24:57] [INFO ] Invariant cache hit.
[2023-03-19 09:24:58] [INFO ] Implicit Places using invariants in 779 ms returned [475, 476, 478, 490, 491, 492, 493]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 784 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 493/500 places, 1200/1200 transitions.
Applied a total of 0 rules in 48 ms. Remains 493 /493 variables (removed 0) and now considering 1200/1200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 884 ms. Remains : 493/500 places, 1200/1200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 7) seen :1
FORMULA Peterson-PT-6-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 09:24:58] [INFO ] Flow matrix only has 990 transitions (discarded 210 similar events)
// Phase 1: matrix 990 rows 493 cols
[2023-03-19 09:24:58] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-19 09:24:59] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-19 09:24:59] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:24:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-19 09:25:00] [INFO ] After 754ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:25:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:25:00] [INFO ] After 455ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:25:01] [INFO ] Deduced a trap composed of 18 places in 542 ms of which 3 ms to minimize.
[2023-03-19 09:25:01] [INFO ] Deduced a trap composed of 23 places in 353 ms of which 0 ms to minimize.
[2023-03-19 09:25:02] [INFO ] Deduced a trap composed of 10 places in 475 ms of which 1 ms to minimize.
[2023-03-19 09:25:02] [INFO ] Deduced a trap composed of 43 places in 546 ms of which 1 ms to minimize.
[2023-03-19 09:25:03] [INFO ] Deduced a trap composed of 29 places in 523 ms of which 1 ms to minimize.
[2023-03-19 09:25:03] [INFO ] Deduced a trap composed of 43 places in 466 ms of which 1 ms to minimize.
[2023-03-19 09:25:04] [INFO ] Deduced a trap composed of 53 places in 399 ms of which 1 ms to minimize.
[2023-03-19 09:25:04] [INFO ] Deduced a trap composed of 57 places in 416 ms of which 1 ms to minimize.
[2023-03-19 09:25:05] [INFO ] Deduced a trap composed of 43 places in 415 ms of which 1 ms to minimize.
[2023-03-19 09:25:05] [INFO ] Deduced a trap composed of 44 places in 536 ms of which 1 ms to minimize.
[2023-03-19 09:25:06] [INFO ] Deduced a trap composed of 12 places in 529 ms of which 1 ms to minimize.
[2023-03-19 09:25:06] [INFO ] Deduced a trap composed of 11 places in 576 ms of which 1 ms to minimize.
[2023-03-19 09:25:07] [INFO ] Deduced a trap composed of 10 places in 497 ms of which 1 ms to minimize.
[2023-03-19 09:25:08] [INFO ] Deduced a trap composed of 13 places in 516 ms of which 1 ms to minimize.
[2023-03-19 09:25:08] [INFO ] Deduced a trap composed of 13 places in 500 ms of which 1 ms to minimize.
[2023-03-19 09:25:09] [INFO ] Deduced a trap composed of 63 places in 499 ms of which 1 ms to minimize.
[2023-03-19 09:25:09] [INFO ] Deduced a trap composed of 12 places in 489 ms of which 2 ms to minimize.
[2023-03-19 09:25:10] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 1 ms to minimize.
[2023-03-19 09:25:10] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 1 ms to minimize.
[2023-03-19 09:25:11] [INFO ] Deduced a trap composed of 45 places in 412 ms of which 1 ms to minimize.
[2023-03-19 09:25:11] [INFO ] Deduced a trap composed of 41 places in 373 ms of which 1 ms to minimize.
[2023-03-19 09:25:11] [INFO ] Deduced a trap composed of 40 places in 423 ms of which 1 ms to minimize.
[2023-03-19 09:25:12] [INFO ] Deduced a trap composed of 47 places in 412 ms of which 0 ms to minimize.
[2023-03-19 09:25:13] [INFO ] Deduced a trap composed of 21 places in 486 ms of which 1 ms to minimize.
[2023-03-19 09:25:13] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 1 ms to minimize.
[2023-03-19 09:25:14] [INFO ] Deduced a trap composed of 24 places in 485 ms of which 1 ms to minimize.
[2023-03-19 09:25:14] [INFO ] Deduced a trap composed of 22 places in 447 ms of which 1 ms to minimize.
[2023-03-19 09:25:15] [INFO ] Deduced a trap composed of 41 places in 461 ms of which 1 ms to minimize.
[2023-03-19 09:25:15] [INFO ] Deduced a trap composed of 22 places in 448 ms of which 1 ms to minimize.
[2023-03-19 09:25:16] [INFO ] Deduced a trap composed of 23 places in 461 ms of which 1 ms to minimize.
[2023-03-19 09:25:16] [INFO ] Deduced a trap composed of 18 places in 473 ms of which 1 ms to minimize.
[2023-03-19 09:25:17] [INFO ] Deduced a trap composed of 18 places in 466 ms of which 1 ms to minimize.
[2023-03-19 09:25:17] [INFO ] Deduced a trap composed of 30 places in 469 ms of which 2 ms to minimize.
[2023-03-19 09:25:18] [INFO ] Deduced a trap composed of 34 places in 448 ms of which 1 ms to minimize.
[2023-03-19 09:25:19] [INFO ] Deduced a trap composed of 24 places in 498 ms of which 1 ms to minimize.
[2023-03-19 09:25:19] [INFO ] Deduced a trap composed of 37 places in 438 ms of which 1 ms to minimize.
[2023-03-19 09:25:20] [INFO ] Deduced a trap composed of 58 places in 483 ms of which 1 ms to minimize.
[2023-03-19 09:25:20] [INFO ] Deduced a trap composed of 24 places in 488 ms of which 2 ms to minimize.
[2023-03-19 09:25:21] [INFO ] Deduced a trap composed of 36 places in 440 ms of which 1 ms to minimize.
[2023-03-19 09:25:21] [INFO ] Deduced a trap composed of 29 places in 434 ms of which 1 ms to minimize.
[2023-03-19 09:25:22] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 1 ms to minimize.
[2023-03-19 09:25:22] [INFO ] Deduced a trap composed of 36 places in 445 ms of which 1 ms to minimize.
[2023-03-19 09:25:23] [INFO ] Deduced a trap composed of 31 places in 478 ms of which 1 ms to minimize.
[2023-03-19 09:25:23] [INFO ] Deduced a trap composed of 45 places in 373 ms of which 1 ms to minimize.
[2023-03-19 09:25:24] [INFO ] Deduced a trap composed of 42 places in 460 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 09:25:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:25:24] [INFO ] After 25064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 6 ms.
Support contains 24 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1200/1200 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 493 transition count 1176
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 469 transition count 1175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 468 transition count 1175
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 50 place count 468 transition count 1146
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 108 place count 439 transition count 1146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 place count 435 transition count 1142
Applied a total of 116 rules in 95 ms. Remains 435 /493 variables (removed 58) and now considering 1142/1200 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 435/493 places, 1142/1200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 409592 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 409592 steps, saw 56859 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-19 09:25:27] [INFO ] Flow matrix only has 932 transitions (discarded 210 similar events)
// Phase 1: matrix 932 rows 435 cols
[2023-03-19 09:25:27] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-19 09:25:27] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-19 09:25:28] [INFO ] After 386ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-19 09:25:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:25:28] [INFO ] After 115ms SMT Verify possible using 330 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:25:28] [INFO ] After 687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:25:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-19 09:25:29] [INFO ] After 727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:25:29] [INFO ] After 420ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:25:30] [INFO ] Deduced a trap composed of 48 places in 490 ms of which 1 ms to minimize.
[2023-03-19 09:25:31] [INFO ] Deduced a trap composed of 28 places in 502 ms of which 1 ms to minimize.
[2023-03-19 09:25:31] [INFO ] Deduced a trap composed of 80 places in 490 ms of which 1 ms to minimize.
[2023-03-19 09:25:32] [INFO ] Deduced a trap composed of 34 places in 468 ms of which 1 ms to minimize.
[2023-03-19 09:25:32] [INFO ] Deduced a trap composed of 34 places in 460 ms of which 1 ms to minimize.
[2023-03-19 09:25:33] [INFO ] Deduced a trap composed of 34 places in 458 ms of which 1 ms to minimize.
[2023-03-19 09:25:33] [INFO ] Deduced a trap composed of 34 places in 401 ms of which 1 ms to minimize.
[2023-03-19 09:25:34] [INFO ] Deduced a trap composed of 12 places in 477 ms of which 1 ms to minimize.
[2023-03-19 09:25:34] [INFO ] Deduced a trap composed of 18 places in 431 ms of which 1 ms to minimize.
[2023-03-19 09:25:35] [INFO ] Deduced a trap composed of 10 places in 448 ms of which 1 ms to minimize.
[2023-03-19 09:25:35] [INFO ] Deduced a trap composed of 10 places in 466 ms of which 2 ms to minimize.
[2023-03-19 09:25:36] [INFO ] Deduced a trap composed of 10 places in 455 ms of which 1 ms to minimize.
[2023-03-19 09:25:36] [INFO ] Deduced a trap composed of 10 places in 465 ms of which 1 ms to minimize.
[2023-03-19 09:25:37] [INFO ] Deduced a trap composed of 10 places in 460 ms of which 1 ms to minimize.
[2023-03-19 09:25:37] [INFO ] Deduced a trap composed of 10 places in 390 ms of which 0 ms to minimize.
[2023-03-19 09:25:38] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 1 ms to minimize.
[2023-03-19 09:25:38] [INFO ] Deduced a trap composed of 23 places in 456 ms of which 1 ms to minimize.
[2023-03-19 09:25:39] [INFO ] Deduced a trap composed of 23 places in 438 ms of which 1 ms to minimize.
[2023-03-19 09:25:39] [INFO ] Deduced a trap composed of 67 places in 450 ms of which 1 ms to minimize.
[2023-03-19 09:25:40] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 1 ms to minimize.
[2023-03-19 09:25:40] [INFO ] Deduced a trap composed of 29 places in 446 ms of which 1 ms to minimize.
[2023-03-19 09:25:41] [INFO ] Deduced a trap composed of 57 places in 450 ms of which 1 ms to minimize.
[2023-03-19 09:25:41] [INFO ] Deduced a trap composed of 18 places in 440 ms of which 1 ms to minimize.
[2023-03-19 09:25:42] [INFO ] Deduced a trap composed of 45 places in 450 ms of which 1 ms to minimize.
[2023-03-19 09:25:42] [INFO ] Deduced a trap composed of 53 places in 420 ms of which 1 ms to minimize.
[2023-03-19 09:25:43] [INFO ] Deduced a trap composed of 27 places in 454 ms of which 1 ms to minimize.
[2023-03-19 09:25:43] [INFO ] Deduced a trap composed of 19 places in 444 ms of which 1 ms to minimize.
[2023-03-19 09:25:44] [INFO ] Deduced a trap composed of 27 places in 446 ms of which 1 ms to minimize.
[2023-03-19 09:25:44] [INFO ] Deduced a trap composed of 18 places in 400 ms of which 1 ms to minimize.
[2023-03-19 09:25:44] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2023-03-19 09:25:44] [INFO ] Deduced a trap composed of 44 places in 162 ms of which 2 ms to minimize.
[2023-03-19 09:25:45] [INFO ] Deduced a trap composed of 20 places in 344 ms of which 1 ms to minimize.
[2023-03-19 09:25:45] [INFO ] Deduced a trap composed of 28 places in 392 ms of which 1 ms to minimize.
[2023-03-19 09:25:46] [INFO ] Deduced a trap composed of 28 places in 408 ms of which 1 ms to minimize.
[2023-03-19 09:25:46] [INFO ] Deduced a trap composed of 42 places in 409 ms of which 1 ms to minimize.
[2023-03-19 09:25:47] [INFO ] Deduced a trap composed of 28 places in 370 ms of which 1 ms to minimize.
[2023-03-19 09:25:47] [INFO ] Deduced a trap composed of 36 places in 316 ms of which 1 ms to minimize.
[2023-03-19 09:25:47] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 1 ms to minimize.
[2023-03-19 09:25:48] [INFO ] Deduced a trap composed of 36 places in 314 ms of which 2 ms to minimize.
[2023-03-19 09:25:48] [INFO ] Deduced a trap composed of 36 places in 328 ms of which 1 ms to minimize.
[2023-03-19 09:25:49] [INFO ] Deduced a trap composed of 20 places in 381 ms of which 1 ms to minimize.
[2023-03-19 09:25:49] [INFO ] Deduced a trap composed of 20 places in 391 ms of which 1 ms to minimize.
[2023-03-19 09:25:49] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 1 ms to minimize.
[2023-03-19 09:25:50] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 0 ms to minimize.
[2023-03-19 09:25:50] [INFO ] Deduced a trap composed of 53 places in 281 ms of which 0 ms to minimize.
[2023-03-19 09:25:50] [INFO ] Deduced a trap composed of 48 places in 279 ms of which 1 ms to minimize.
[2023-03-19 09:25:51] [INFO ] Deduced a trap composed of 70 places in 286 ms of which 1 ms to minimize.
[2023-03-19 09:25:51] [INFO ] Deduced a trap composed of 36 places in 285 ms of which 1 ms to minimize.
[2023-03-19 09:25:52] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 1 ms to minimize.
[2023-03-19 09:25:52] [INFO ] Deduced a trap composed of 22 places in 472 ms of which 1 ms to minimize.
[2023-03-19 09:25:53] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 1 ms to minimize.
[2023-03-19 09:25:53] [INFO ] Deduced a trap composed of 29 places in 431 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-19 09:25:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 09:25:53] [INFO ] After 25342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Parikh walk visited 0 properties in 57 ms.
Support contains 24 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1142/1142 transitions.
Applied a total of 0 rules in 31 ms. Remains 435 /435 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 435/435 places, 1142/1142 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 1142/1142 transitions.
Applied a total of 0 rules in 29 ms. Remains 435 /435 variables (removed 0) and now considering 1142/1142 (removed 0) transitions.
[2023-03-19 09:25:53] [INFO ] Flow matrix only has 932 transitions (discarded 210 similar events)
[2023-03-19 09:25:53] [INFO ] Invariant cache hit.
[2023-03-19 09:25:54] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-19 09:25:54] [INFO ] Flow matrix only has 932 transitions (discarded 210 similar events)
[2023-03-19 09:25:54] [INFO ] Invariant cache hit.
[2023-03-19 09:25:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:25:57] [INFO ] Implicit Places using invariants and state equation in 3049 ms returned []
Implicit Place search using SMT with State Equation took 3709 ms to find 0 implicit places.
[2023-03-19 09:25:57] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-19 09:25:57] [INFO ] Flow matrix only has 932 transitions (discarded 210 similar events)
[2023-03-19 09:25:57] [INFO ] Invariant cache hit.
[2023-03-19 09:25:58] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4929 ms. Remains : 435/435 places, 1142/1142 transitions.
Graph (trivial) has 802 edges and 435 vertex of which 235 / 435 are part of one of the 40 SCC in 6 ms
Free SCC test removed 195 places
Drop transitions removed 390 transitions
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 624 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 1 place count 240 transition count 494
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 49 place count 216 transition count 494
Performed 47 Post agglomeration using F-continuation condition with reduction of 29 identical transitions.
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 0 with 94 rules applied. Total rules applied 143 place count 169 transition count 418
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 146 place count 169 transition count 415
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 1 with 43 rules applied. Total rules applied 189 place count 144 transition count 478
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 72 edges and 144 vertex of which 30 / 144 are part of one of the 4 SCC in 0 ms
Free SCC test removed 26 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 202 place count 118 transition count 466
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 30 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 235 place count 117 transition count 434
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 239 place count 115 transition count 432
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 3 with 75 rules applied. Total rules applied 314 place count 115 transition count 357
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 318 place count 115 transition count 353
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 322 place count 111 transition count 353
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 322 place count 111 transition count 352
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 110 transition count 352
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 325 place count 110 transition count 351
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 326 place count 110 transition count 350
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 327 place count 109 transition count 350
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 336 place count 109 transition count 341
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 345 place count 100 transition count 341
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 350 place count 100 transition count 341
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 352 place count 100 transition count 339
Applied a total of 352 rules in 124 ms. Remains 100 /435 variables (removed 335) and now considering 339/1142 (removed 803) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 339 rows 100 cols
[2023-03-19 09:25:58] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 09:25:59] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 09:25:59] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 09:25:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-19 09:25:59] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 09:25:59] [INFO ] After 257ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-19 09:25:59] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-19 09:25:59] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-19 09:25:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 435 places, 1142 transitions and 4482 arcs took 8 ms.
[2023-03-19 09:26:00] [INFO ] Flatten gal took : 250 ms
Total runtime 123260 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Peterson_PT_6
(NrP: 435 NrTr: 1142 NrArc: 4482)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.113sec

net check time: 0m 0.001sec

init dd package: 0m 3.304sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10059544 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16090060 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.012sec

97693 335371 517504 729722 840407 1026203 1114435 1161626

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="Peterson-PT-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Peterson-PT-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863541200638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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