About the Execution of LTSMin+red for DoubleExponent-PT-200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5534.380 | 1614384.00 | 3002346.00 | 3370.70 | [undef] | Cannot compute |
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.r137-smll-167819418600498.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 ltsminxred
Input is DoubleExponent-PT-200, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418600498
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.5M Mar 5 18:22 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 DoubleExponent-PT-200-CTLFireability-00
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-01
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-02
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-03
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-04
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-05
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-06
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-07
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-08
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-09
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-10
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-11
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-12
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-13
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-14
FORMULA_NAME DoubleExponent-PT-200-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678894515060
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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-200
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 15:35:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 15:35:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 15:35:18] [INFO ] Load time of PNML (sax parser for PT used): 664 ms
[2023-03-15 15:35:18] [INFO ] Transformed 10604 places.
[2023-03-15 15:35:18] [INFO ] Transformed 9998 transitions.
[2023-03-15 15:35:18] [INFO ] Parsed PT model containing 10604 places and 9998 transitions and 28194 arcs in 846 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 171 out of 10604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10604/10604 places, 9998/9998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 10600 transition count 9998
Applied a total of 4 rules in 5255 ms. Remains 10600 /10604 variables (removed 4) and now considering 9998/9998 (removed 0) transitions.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 15:35:29] [INFO ] Invariants computation overflowed in 614 ms
[2023-03-15 15:35:31] [INFO ] Implicit Places using invariants in 2429 ms returned []
Implicit Place search using SMT only with invariants took 2470 ms to find 0 implicit places.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 15:35:31] [INFO ] Invariants computation overflowed in 338 ms
[2023-03-15 15:35:33] [INFO ] Dead Transitions using invariants and state equation in 2003 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 10600/10604 places, 9998/9998 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9734 ms. Remains : 10600/10604 places, 9998/9998 transitions.
Support contains 171 out of 10600 places after structural reductions.
[2023-03-15 15:35:37] [INFO ] Flatten gal took : 772 ms
[2023-03-15 15:35:37] [INFO ] Flatten gal took : 502 ms
[2023-03-15 15:35:38] [INFO ] Input system was already deterministic with 9998 transitions.
Support contains 169 out of 10600 places (down from 171) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 334 resets, run finished after 994 ms. (steps per millisecond=10 ) properties (out of 88) seen :1
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 69 ms. (steps per millisecond=14 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 70 ms. (steps per millisecond=14 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 76 ms. (steps per millisecond=13 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 21 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 57 ms. (steps per millisecond=17 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 56 ms. (steps per millisecond=17 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 67 ms. (steps per millisecond=14 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 23 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 30 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 22 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 61 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 25 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 87) seen :0
Interrupted probabilistic random walk after 61419 steps, run timeout after 9001 ms. (steps per millisecond=6 ) properties seen :{}
Probabilistic random walk after 61419 steps, saw 30715 distinct states, run finished after 9004 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 87 properties.
// Phase 1: matrix 9998 rows 10600 cols
[2023-03-15 15:35:55] [INFO ] Invariants computation overflowed in 298 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-15 15:36:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:36:21] [INFO ] After 25098ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 87 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 168 out of 10600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.51 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2222 transitions
Trivial Post-agglo rules discarded 2222 transitions
Performed 2222 trivial Post agglomeration. Transition count delta: 2222
Iterating post reduction 0 with 2225 rules applied. Total rules applied 2226 place count 10597 transition count 7774
Reduce places removed 2222 places and 0 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 1 with 2281 rules applied. Total rules applied 4507 place count 8375 transition count 7715
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 2 with 59 rules applied. Total rules applied 4566 place count 8316 transition count 7715
Performed 414 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 414 Pre rules applied. Total rules applied 4566 place count 8316 transition count 7301
Deduced a syphon composed of 414 places in 1522 ms
Reduce places removed 414 places and 0 transitions.
Iterating global reduction 3 with 828 rules applied. Total rules applied 5394 place count 7902 transition count 7301
Performed 1734 Post agglomeration using F-continuation condition.Transition count delta: 1734
Deduced a syphon composed of 1734 places in 551 ms
Reduce places removed 1734 places and 0 transitions.
Iterating global reduction 3 with 3468 rules applied. Total rules applied 8862 place count 6168 transition count 5567
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 353 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9064 place count 6067 transition count 5567
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 333 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9266 place count 5966 transition count 5567
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 302 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9468 place count 5865 transition count 5567
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 73 places in 307 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 9614 place count 5792 transition count 5567
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 9617 place count 5792 transition count 5564
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 9620 place count 5789 transition count 5564
Free-agglomeration rule (complex) applied 810 times.
Iterating global reduction 4 with 810 rules applied. Total rules applied 10430 place count 5789 transition count 4754
Reduce places removed 810 places and 0 transitions.
Iterating post reduction 4 with 810 rules applied. Total rules applied 11240 place count 4979 transition count 4754
Partial Free-agglomeration rule applied 805 times.
Drop transitions removed 805 transitions
Iterating global reduction 5 with 805 rules applied. Total rules applied 12045 place count 4979 transition count 4754
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 12046 place count 4978 transition count 4753
Applied a total of 12046 rules in 12928 ms. Remains 4978 /10600 variables (removed 5622) and now considering 4753/9998 (removed 5245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12932 ms. Remains : 4978/10600 places, 4753/9998 transitions.
Incomplete random walk after 10000 steps, including 1285 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 77 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1001 steps, including 81 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 79 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 87) seen :0
Incomplete Best-First random walk after 1000 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 87) seen :0
Interrupted probabilistic random walk after 78285 steps, run timeout after 6001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 78285 steps, saw 39156 distinct states, run finished after 6006 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 87 properties.
// Phase 1: matrix 4753 rows 4978 cols
[2023-03-15 15:36:42] [INFO ] Invariants computation overflowed in 139 ms
[2023-03-15 15:37:06] [INFO ] After 23837ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:87
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-15 15:37:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:37:31] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:87
Fused 87 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 168 out of 4978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4978/4978 places, 4753/4753 transitions.
Applied a total of 0 rules in 830 ms. Remains 4978 /4978 variables (removed 0) and now considering 4753/4753 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 831 ms. Remains : 4978/4978 places, 4753/4753 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4978/4978 places, 4753/4753 transitions.
Applied a total of 0 rules in 661 ms. Remains 4978 /4978 variables (removed 0) and now considering 4753/4753 (removed 0) transitions.
// Phase 1: matrix 4753 rows 4978 cols
[2023-03-15 15:37:33] [INFO ] Invariants computation overflowed in 136 ms
[2023-03-15 15:37:34] [INFO ] Implicit Places using invariants in 988 ms returned []
// Phase 1: matrix 4753 rows 4978 cols
[2023-03-15 15:37:34] [INFO ] Invariants computation overflowed in 132 ms
[2023-03-15 15:37:36] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2838 ms to find 0 implicit places.
[2023-03-15 15:37:37] [INFO ] Redundant transitions in 868 ms returned []
// Phase 1: matrix 4753 rows 4978 cols
[2023-03-15 15:37:37] [INFO ] Invariants computation overflowed in 219 ms
[2023-03-15 15:37:44] [INFO ] Dead Transitions using invariants and state equation in 7263 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11641 ms. Remains : 4978/4978 places, 4753/4753 transitions.
[2023-03-15 15:37:45] [INFO ] Flatten gal took : 379 ms
[2023-03-15 15:37:45] [INFO ] Flatten gal took : 331 ms
[2023-03-15 15:37:46] [INFO ] Input system was already deterministic with 9998 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 18191 edges and 10600 vertex of which 10598 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.59 ms
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4212 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4217 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:37:50] [INFO ] Flatten gal took : 270 ms
[2023-03-15 15:37:51] [INFO ] Flatten gal took : 290 ms
[2023-03-15 15:37:51] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4205 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4209 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:37:56] [INFO ] Flatten gal took : 271 ms
[2023-03-15 15:37:56] [INFO ] Flatten gal took : 313 ms
[2023-03-15 15:37:57] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4259 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4275 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:38:01] [INFO ] Flatten gal took : 236 ms
[2023-03-15 15:38:01] [INFO ] Flatten gal took : 261 ms
[2023-03-15 15:38:02] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4183 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4184 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:38:06] [INFO ] Flatten gal took : 236 ms
[2023-03-15 15:38:07] [INFO ] Flatten gal took : 267 ms
[2023-03-15 15:38:07] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2394 transitions
Trivial Post-agglo rules discarded 2394 transitions
Performed 2394 trivial Post agglomeration. Transition count delta: 2394
Iterating post reduction 0 with 2394 rules applied. Total rules applied 2394 place count 10599 transition count 7603
Reduce places removed 2394 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2396 rules applied. Total rules applied 4790 place count 8205 transition count 7601
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4792 place count 8203 transition count 7601
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 4792 place count 8203 transition count 7200
Deduced a syphon composed of 401 places in 850 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1400 Post agglomeration using F-continuation condition.Transition count delta: 1400
Deduced a syphon composed of 1400 places in 464 ms
Reduce places removed 1400 places and 0 transitions.
Iterating global reduction 3 with 2800 rules applied. Total rules applied 8394 place count 6402 transition count 5800
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8395 place count 6401 transition count 5799
Applied a total of 8395 rules in 5965 ms. Remains 6401 /10600 variables (removed 4199) and now considering 5799/9998 (removed 4199) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5965 ms. Remains : 6401/10600 places, 5799/9998 transitions.
[2023-03-15 15:38:13] [INFO ] Flatten gal took : 183 ms
[2023-03-15 15:38:13] [INFO ] Flatten gal took : 209 ms
[2023-03-15 15:38:14] [INFO ] Input system was already deterministic with 5799 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4508 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4508 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:38:19] [INFO ] Flatten gal took : 253 ms
[2023-03-15 15:38:19] [INFO ] Flatten gal took : 273 ms
[2023-03-15 15:38:19] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4307 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4309 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:38:24] [INFO ] Flatten gal took : 262 ms
[2023-03-15 15:38:24] [INFO ] Flatten gal took : 257 ms
[2023-03-15 15:38:25] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2398 transitions
Trivial Post-agglo rules discarded 2398 transitions
Performed 2398 trivial Post agglomeration. Transition count delta: 2398
Iterating post reduction 0 with 2398 rules applied. Total rules applied 2398 place count 10599 transition count 7599
Reduce places removed 2398 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2400 rules applied. Total rules applied 4798 place count 8201 transition count 7597
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4800 place count 8199 transition count 7597
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4800 place count 8199 transition count 7197
Deduced a syphon composed of 400 places in 960 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5600 place count 7799 transition count 7197
Performed 1400 Post agglomeration using F-continuation condition.Transition count delta: 1400
Deduced a syphon composed of 1400 places in 419 ms
Reduce places removed 1400 places and 0 transitions.
Iterating global reduction 3 with 2800 rules applied. Total rules applied 8400 place count 6399 transition count 5797
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8401 place count 6398 transition count 5796
Applied a total of 8401 rules in 5674 ms. Remains 6398 /10600 variables (removed 4202) and now considering 5796/9998 (removed 4202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5674 ms. Remains : 6398/10600 places, 5796/9998 transitions.
[2023-03-15 15:38:30] [INFO ] Flatten gal took : 152 ms
[2023-03-15 15:38:31] [INFO ] Flatten gal took : 177 ms
[2023-03-15 15:38:31] [INFO ] Input system was already deterministic with 5796 transitions.
Incomplete random walk after 10000 steps, including 1023 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 680 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 50371 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :{}
Probabilistic random walk after 50371 steps, saw 25192 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5796 rows 6398 cols
[2023-03-15 15:38:34] [INFO ] Invariants computation overflowed in 168 ms
[2023-03-15 15:38:41] [INFO ] After 5444ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 15:38:41] [INFO ] State equation strengthened by 398 read => feed constraints.
[2023-03-15 15:38:41] [INFO ] After 407ms SMT Verify possible using 398 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 15:38:43] [INFO ] After 1895ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 302 ms.
[2023-03-15 15:38:43] [INFO ] After 8808ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3968 ms.
Support contains 2 out of 6398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6398/6398 places, 5796/5796 transitions.
Graph (complete) has 16178 edges and 6398 vertex of which 6396 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 6395 transition count 5794
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 6395 transition count 5793
Deduced a syphon composed of 1 places in 389 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 6394 transition count 5793
Performed 403 Post agglomeration using F-continuation condition.Transition count delta: 403
Deduced a syphon composed of 403 places in 344 ms
Reduce places removed 403 places and 0 transitions.
Iterating global reduction 1 with 806 rules applied. Total rules applied 812 place count 5991 transition count 5390
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 309 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 1 with 202 rules applied. Total rules applied 1014 place count 5890 transition count 5390
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 296 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 1 with 202 rules applied. Total rules applied 1216 place count 5789 transition count 5390
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 257 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 1 with 202 rules applied. Total rules applied 1418 place count 5688 transition count 5390
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 95 places in 260 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 1 with 190 rules applied. Total rules applied 1608 place count 5593 transition count 5390
Free-agglomeration rule (complex) applied 796 times.
Iterating global reduction 1 with 796 rules applied. Total rules applied 2404 place count 5593 transition count 4594
Reduce places removed 796 places and 0 transitions.
Iterating post reduction 1 with 796 rules applied. Total rules applied 3200 place count 4797 transition count 4594
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 799 times.
Drop transitions removed 799 transitions
Iterating global reduction 2 with 799 rules applied. Total rules applied 3999 place count 4797 transition count 4594
Applied a total of 3999 rules in 9352 ms. Remains 4797 /6398 variables (removed 1601) and now considering 4594/5796 (removed 1202) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9353 ms. Remains : 4797/6398 places, 4594/5796 transitions.
Incomplete random walk after 1000000 steps, including 127197 resets, run finished after 3732 ms. (steps per millisecond=267 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84169 resets, run finished after 2465 ms. (steps per millisecond=405 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 382005 steps, run timeout after 18001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 382005 steps, saw 191129 distinct states, run finished after 18001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:39:22] [INFO ] Invariants computation overflowed in 129 ms
[2023-03-15 15:40:10] [INFO ] After 48721ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 4797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Applied a total of 0 rules in 1469 ms. Remains 4797 /4797 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1469 ms. Remains : 4797/4797 places, 4594/4594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Applied a total of 0 rules in 1462 ms. Remains 4797 /4797 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:40:13] [INFO ] Invariants computation overflowed in 137 ms
[2023-03-15 15:40:14] [INFO ] Implicit Places using invariants in 948 ms returned []
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:40:14] [INFO ] Invariants computation overflowed in 191 ms
[2023-03-15 15:40:16] [INFO ] Implicit Places using invariants and state equation in 1872 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
[2023-03-15 15:40:17] [INFO ] Redundant transitions in 1007 ms returned []
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:40:17] [INFO ] Invariants computation overflowed in 188 ms
[2023-03-15 15:40:25] [INFO ] Dead Transitions using invariants and state equation in 8014 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13330 ms. Remains : 4797/4797 places, 4594/4594 transitions.
Incomplete random walk after 100000 steps, including 12800 resets, run finished after 2021 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:40:28] [INFO ] Invariants computation overflowed in 116 ms
[2023-03-15 15:40:37] [INFO ] After 7865ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 15:40:37] [INFO ] State equation strengthened by 798 read => feed constraints.
[2023-03-15 15:42:08] [INFO ] After 91382ms SMT Verify possible using 798 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-15 15:42:08] [INFO ] After 100112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 127302 resets, run finished after 3843 ms. (steps per millisecond=260 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84092 resets, run finished after 2511 ms. (steps per millisecond=398 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 377646 steps, run timeout after 18001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 377646 steps, saw 188943 distinct states, run finished after 18001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:42:33] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-15 15:43:20] [INFO ] After 47511ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 4797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Applied a total of 0 rules in 1444 ms. Remains 4797 /4797 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1445 ms. Remains : 4797/4797 places, 4594/4594 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Applied a total of 0 rules in 1455 ms. Remains 4797 /4797 variables (removed 0) and now considering 4594/4594 (removed 0) transitions.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:43:23] [INFO ] Invariants computation overflowed in 181 ms
[2023-03-15 15:43:24] [INFO ] Implicit Places using invariants in 943 ms returned []
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:43:24] [INFO ] Invariants computation overflowed in 141 ms
[2023-03-15 15:43:26] [INFO ] Implicit Places using invariants and state equation in 1748 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2023-03-15 15:43:27] [INFO ] Redundant transitions in 1182 ms returned []
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:43:27] [INFO ] Invariants computation overflowed in 115 ms
[2023-03-15 15:43:38] [INFO ] Dead Transitions using invariants and state equation in 10809 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16164 ms. Remains : 4797/4797 places, 4594/4594 transitions.
Incomplete random walk after 100000 steps, including 12725 resets, run finished after 1451 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:43:41] [INFO ] Invariants computation overflowed in 127 ms
[2023-03-15 15:43:49] [INFO ] After 8039ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-15 15:43:49] [INFO ] State equation strengthened by 798 read => feed constraints.
[2023-03-15 15:45:21] [INFO ] After 91196ms SMT Verify possible using 798 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-15 15:45:21] [INFO ] After 100116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 1267 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 60842 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 60842 steps, saw 30440 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:45:26] [INFO ] Invariants computation overflowed in 139 ms
[2023-03-15 15:45:33] [INFO ] After 6957ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:45:40] [INFO ] After 6303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:45:40] [INFO ] State equation strengthened by 798 read => feed constraints.
[2023-03-15 15:45:41] [INFO ] After 1358ms SMT Verify possible using 798 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 15:45:43] [INFO ] After 3108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 239 ms.
[2023-03-15 15:45:43] [INFO ] After 10724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 4797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4797 transition count 4593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4796 transition count 4593
Applied a total of 2 rules in 3159 ms. Remains 4796 /4797 variables (removed 1) and now considering 4593/4594 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3160 ms. Remains : 4796/4797 places, 4593/4594 transitions.
Incomplete random walk after 10000 steps, including 1298 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 62891 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 62891 steps, saw 31467 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:45:50] [INFO ] Invariants computation overflowed in 77 ms
[2023-03-15 15:45:57] [INFO ] After 5623ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 15:45:57] [INFO ] State equation strengthened by 798 read => feed constraints.
[2023-03-15 15:46:06] [INFO ] After 9111ms SMT Verify possible using 798 Read/Feed constraints in real domain returned unsat :0 sat :0
[2023-03-15 15:46:06] [INFO ] After 15742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4796/4796 places, 4593/4593 transitions.
Applied a total of 0 rules in 1481 ms. Remains 4796 /4796 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1482 ms. Remains : 4796/4796 places, 4593/4593 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4796/4796 places, 4593/4593 transitions.
Applied a total of 0 rules in 1571 ms. Remains 4796 /4796 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:46:09] [INFO ] Invariants computation overflowed in 72 ms
[2023-03-15 15:46:10] [INFO ] Implicit Places using invariants in 784 ms returned []
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:46:10] [INFO ] Invariants computation overflowed in 111 ms
[2023-03-15 15:46:11] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2023-03-15 15:46:12] [INFO ] Redundant transitions in 988 ms returned []
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:46:13] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-15 15:46:21] [INFO ] Dead Transitions using invariants and state equation in 8239 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12979 ms. Remains : 4796/4796 places, 4593/4593 transitions.
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 399 Pre rules applied. Total rules applied 0 place count 4796 transition count 4194
Deduced a syphon composed of 399 places in 817 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 0 with 798 rules applied. Total rules applied 798 place count 4397 transition count 4194
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 799 place count 4397 transition count 4193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 800 place count 4396 transition count 4193
Applied a total of 800 rules in 4040 ms. Remains 4396 /4796 variables (removed 400) and now considering 4193/4593 (removed 400) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4193 rows 4396 cols
[2023-03-15 15:46:26] [INFO ] Invariants computation overflowed in 120 ms
[2023-03-15 15:46:34] [INFO ] After 6924ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 15:47:07] [INFO ] Deduced a trap composed of 13 places in 33097 ms of which 12 ms to minimize.
[2023-03-15 15:47:37] [INFO ] Deduced a trap composed of 1113 places in 29647 ms of which 7 ms to minimize.
[2023-03-15 15:47:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67210 ms
[2023-03-15 15:47:41] [INFO ] After 74284ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:47:41] [INFO ] After 75194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:47:47] [INFO ] After 5519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:48:17] [INFO ] Deduced a trap composed of 13 places in 29274 ms of which 9 ms to minimize.
[2023-03-15 15:48:47] [INFO ] Deduced a trap composed of 1113 places in 30169 ms of which 7 ms to minimize.
[2023-03-15 15:49:18] [INFO ] Deduced a trap composed of 1114 places in 27716 ms of which 8 ms to minimize.
[2023-03-15 15:49:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 96024 ms
[2023-03-15 15:49:24] [INFO ] After 101675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 238 ms.
[2023-03-15 15:49:24] [INFO ] After 102670ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 1299 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 833 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 61009 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61009 steps, saw 30528 distinct states, run finished after 3002 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4594 rows 4797 cols
[2023-03-15 15:49:30] [INFO ] Invariants computation overflowed in 158 ms
[2023-03-15 15:49:55] [INFO ] After 25045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 4797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4797/4797 places, 4594/4594 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 830 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4796 transition count 4593
Applied a total of 2 rules in 2884 ms. Remains 4796 /4797 variables (removed 1) and now considering 4593/4594 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2885 ms. Remains : 4796/4797 places, 4593/4594 transitions.
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 849 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 59652 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59652 steps, saw 29854 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:50:02] [INFO ] Invariants computation overflowed in 78 ms
[2023-03-15 15:50:27] [INFO ] After 25037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 4796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4796/4796 places, 4593/4593 transitions.
Applied a total of 0 rules in 1523 ms. Remains 4796 /4796 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1523 ms. Remains : 4796/4796 places, 4593/4593 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4796/4796 places, 4593/4593 transitions.
Applied a total of 0 rules in 1518 ms. Remains 4796 /4796 variables (removed 0) and now considering 4593/4593 (removed 0) transitions.
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:50:31] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-15 15:51:02] [INFO ] Performed 889/4796 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-15 15:51:32] [INFO ] Performed 1600/4796 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2023-03-15 15:52:02] [INFO ] Performed 2352/4796 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2023-03-15 15:52:32] [INFO ] Performed 3179/4796 implicitness test of which 0 returned IMPLICIT in 121 seconds.
[2023-03-15 15:52:32] [INFO ] Timeout of Implicit test with SMT after 121 seconds.
[2023-03-15 15:52:32] [INFO ] Implicit Places using invariants in 121808 ms returned []
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:52:32] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-15 15:52:34] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 123281 ms to find 0 implicit places.
[2023-03-15 15:52:34] [INFO ] Redundant transitions in 770 ms returned []
// Phase 1: matrix 4593 rows 4796 cols
[2023-03-15 15:52:35] [INFO ] Invariants computation overflowed in 80 ms
[2023-03-15 15:52:42] [INFO ] Dead Transitions using invariants and state equation in 7469 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133053 ms. Remains : 4796/4796 places, 4593/4593 transitions.
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 399 Pre rules applied. Total rules applied 0 place count 4797 transition count 4195
Deduced a syphon composed of 399 places in 858 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 0 with 798 rules applied. Total rules applied 798 place count 4398 transition count 4195
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 799 place count 4398 transition count 4194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 800 place count 4397 transition count 4194
Applied a total of 800 rules in 4255 ms. Remains 4397 /4797 variables (removed 400) and now considering 4194/4594 (removed 400) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4194 rows 4397 cols
[2023-03-15 15:52:47] [INFO ] Invariants computation overflowed in 96 ms
[2023-03-15 15:53:02] [INFO ] After 14705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4367 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4367 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:53:09] [INFO ] Flatten gal took : 261 ms
[2023-03-15 15:53:09] [INFO ] Flatten gal took : 298 ms
[2023-03-15 15:53:09] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2396 transitions
Trivial Post-agglo rules discarded 2396 transitions
Performed 2396 trivial Post agglomeration. Transition count delta: 2396
Iterating post reduction 0 with 2396 rules applied. Total rules applied 2396 place count 10599 transition count 7601
Reduce places removed 2396 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2397 rules applied. Total rules applied 4793 place count 8203 transition count 7600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4794 place count 8202 transition count 7600
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 4794 place count 8202 transition count 7200
Deduced a syphon composed of 400 places in 868 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 5594 place count 7802 transition count 7200
Performed 1397 Post agglomeration using F-continuation condition.Transition count delta: 1397
Deduced a syphon composed of 1397 places in 419 ms
Reduce places removed 1397 places and 0 transitions.
Iterating global reduction 3 with 2794 rules applied. Total rules applied 8388 place count 6405 transition count 5803
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8389 place count 6404 transition count 5802
Applied a total of 8389 rules in 5512 ms. Remains 6404 /10600 variables (removed 4196) and now considering 5802/9998 (removed 4196) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5512 ms. Remains : 6404/10600 places, 5802/9998 transitions.
[2023-03-15 15:53:15] [INFO ] Flatten gal took : 162 ms
[2023-03-15 15:53:15] [INFO ] Flatten gal took : 188 ms
[2023-03-15 15:53:16] [INFO ] Input system was already deterministic with 5802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4386 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4386 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:53:20] [INFO ] Flatten gal took : 257 ms
[2023-03-15 15:53:21] [INFO ] Flatten gal took : 273 ms
[2023-03-15 15:53:21] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4361 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4361 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:53:26] [INFO ] Flatten gal took : 256 ms
[2023-03-15 15:53:26] [INFO ] Flatten gal took : 297 ms
[2023-03-15 15:53:26] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4281 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4282 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:53:31] [INFO ] Flatten gal took : 246 ms
[2023-03-15 15:53:31] [INFO ] Flatten gal took : 286 ms
[2023-03-15 15:53:32] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4330 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4331 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:53:36] [INFO ] Flatten gal took : 261 ms
[2023-03-15 15:53:37] [INFO ] Flatten gal took : 300 ms
[2023-03-15 15:53:37] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4271 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4271 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:53:42] [INFO ] Flatten gal took : 248 ms
[2023-03-15 15:53:42] [INFO ] Flatten gal took : 279 ms
[2023-03-15 15:53:43] [INFO ] Input system was already deterministic with 9998 transitions.
Starting structural reductions in LTL mode, iteration 0 : 10600/10600 places, 9998/9998 transitions.
Applied a total of 0 rules in 4242 ms. Remains 10600 /10600 variables (removed 0) and now considering 9998/9998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4243 ms. Remains : 10600/10600 places, 9998/9998 transitions.
[2023-03-15 15:53:47] [INFO ] Flatten gal took : 247 ms
[2023-03-15 15:53:47] [INFO ] Flatten gal took : 281 ms
[2023-03-15 15:53:48] [INFO ] Input system was already deterministic with 9998 transitions.
[2023-03-15 15:53:48] [INFO ] Flatten gal took : 281 ms
[2023-03-15 15:53:48] [INFO ] Flatten gal took : 278 ms
[2023-03-15 15:53:49] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2023-03-15 15:53:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10600 places, 9998 transitions and 28190 arcs took 69 ms.
Total runtime 1111156 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/658/ctl_0_ --ctl=/tmp/658/ctl_1_ --ctl=/tmp/658/ctl_2_ --ctl=/tmp/658/ctl_3_ --ctl=/tmp/658/ctl_4_ --ctl=/tmp/658/ctl_5_ --ctl=/tmp/658/ctl_6_ --ctl=/tmp/658/ctl_7_ --ctl=/tmp/658/ctl_8_ --ctl=/tmp/658/ctl_9_ --ctl=/tmp/658/ctl_10_ --ctl=/tmp/658/ctl_11_ --ctl=/tmp/658/ctl_12_ --ctl=/tmp/658/ctl_13_ --ctl=/tmp/658/ctl_14_ --ctl=/tmp/658/ctl_15_ --mu-par --mu-opt
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-00
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-01
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-02
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-03
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-04
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-05
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-06
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-07
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-08
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-09
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-10
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-11
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-12
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-13
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-14
Could not compute solution for formula : DoubleExponent-PT-200-CTLFireability-15
BK_STOP 1678896129444
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name DoubleExponent-PT-200-CTLFireability-00
ctl formula formula --ctl=/tmp/658/ctl_0_
ctl formula name DoubleExponent-PT-200-CTLFireability-01
ctl formula formula --ctl=/tmp/658/ctl_1_
ctl formula name DoubleExponent-PT-200-CTLFireability-02
ctl formula formula --ctl=/tmp/658/ctl_2_
ctl formula name DoubleExponent-PT-200-CTLFireability-03
ctl formula formula --ctl=/tmp/658/ctl_3_
ctl formula name DoubleExponent-PT-200-CTLFireability-04
ctl formula formula --ctl=/tmp/658/ctl_4_
ctl formula name DoubleExponent-PT-200-CTLFireability-05
ctl formula formula --ctl=/tmp/658/ctl_5_
ctl formula name DoubleExponent-PT-200-CTLFireability-06
ctl formula formula --ctl=/tmp/658/ctl_6_
ctl formula name DoubleExponent-PT-200-CTLFireability-07
ctl formula formula --ctl=/tmp/658/ctl_7_
ctl formula name DoubleExponent-PT-200-CTLFireability-08
ctl formula formula --ctl=/tmp/658/ctl_8_
ctl formula name DoubleExponent-PT-200-CTLFireability-09
ctl formula formula --ctl=/tmp/658/ctl_9_
ctl formula name DoubleExponent-PT-200-CTLFireability-10
ctl formula formula --ctl=/tmp/658/ctl_10_
ctl formula name DoubleExponent-PT-200-CTLFireability-11
ctl formula formula --ctl=/tmp/658/ctl_11_
ctl formula name DoubleExponent-PT-200-CTLFireability-12
ctl formula formula --ctl=/tmp/658/ctl_12_
ctl formula name DoubleExponent-PT-200-CTLFireability-13
ctl formula formula --ctl=/tmp/658/ctl_13_
ctl formula name DoubleExponent-PT-200-CTLFireability-14
ctl formula formula --ctl=/tmp/658/ctl_14_
ctl formula name DoubleExponent-PT-200-CTLFireability-15
ctl formula formula --ctl=/tmp/658/ctl_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 10600 places, 9998 transitions and 28190 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.230 real 0.090 user 0.140 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 9998->9998 groups
pnml2lts-sym: Regrouping took 70.720 real 70.330 user 0.390 sys
pnml2lts-sym: state vector length is 10600; there are 9998 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
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="DoubleExponent-PT-200"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-200, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r137-smll-167819418600498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-200.tgz
mv DoubleExponent-PT-200 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;