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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 5.7K Feb 26 04:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 04:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 04:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 04:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 04:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 04:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 04:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679124911342

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS17pb114-PT-4
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 07:35:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 07:35:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 07:35:15] [INFO ] Load time of PNML (sax parser for PT used): 1990 ms
[2023-03-18 07:35:15] [INFO ] Transformed 1446 places.
[2023-03-18 07:35:15] [INFO ] Transformed 151085 transitions.
[2023-03-18 07:35:15] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2603 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1716 ms. (steps per millisecond=5 ) properties (out of 1446) seen :1075
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=3 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 371) seen :0
Running SMT prover for 371 properties.
[2023-03-18 07:35:19] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-18 07:35:20] [INFO ] Computed 35 place invariants in 560 ms
[2023-03-18 07:35:30] [INFO ] After 10260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:371
[2023-03-18 07:35:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 25 ms returned sat
[2023-03-18 07:35:39] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 23 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
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.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 07:35:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 07:35:55] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:371
Fused 371 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 371 out of 1446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 3195 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3209 ms. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 203762 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=6 ) properties seen 361
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4097 ms. (steps per millisecond=244 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3931 ms. (steps per millisecond=254 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3881 ms. (steps per millisecond=257 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3954 ms. (steps per millisecond=252 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3841 ms. (steps per millisecond=260 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3804 ms. (steps per millisecond=262 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 07:36:52] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 07:36:52] [INFO ] Computed 18 place invariants in 337 ms
[2023-03-18 07:36:53] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 07:36:53] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 07:37:19] [INFO ] After 26283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 07:37:21] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 07:37:36] [INFO ] After 15118ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 07:37:49] [INFO ] Deduced a trap composed of 64 places in 12234 ms of which 9 ms to minimize.
[2023-03-18 07:38:02] [INFO ] Deduced a trap composed of 40 places in 11490 ms of which 3 ms to minimize.
[2023-03-18 07:38:15] [INFO ] Deduced a trap composed of 64 places in 11699 ms of which 3 ms to minimize.
[2023-03-18 07:38:28] [INFO ] Deduced a trap composed of 64 places in 11223 ms of which 4 ms to minimize.
[2023-03-18 07:38:39] [INFO ] Deduced a trap composed of 40 places in 10631 ms of which 4 ms to minimize.
[2023-03-18 07:38:51] [INFO ] Deduced a trap composed of 96 places in 10072 ms of which 2 ms to minimize.
[2023-03-18 07:39:01] [INFO ] Deduced a trap composed of 128 places in 8790 ms of which 1 ms to minimize.
[2023-03-18 07:39:12] [INFO ] Deduced a trap composed of 96 places in 9623 ms of which 2 ms to minimize.
[2023-03-18 07:39:21] [INFO ] Deduced a trap composed of 64 places in 8281 ms of which 1 ms to minimize.
[2023-03-18 07:39:30] [INFO ] Deduced a trap composed of 96 places in 7696 ms of which 1 ms to minimize.
[2023-03-18 07:39:38] [INFO ] Deduced a trap composed of 96 places in 6655 ms of which 1 ms to minimize.
[2023-03-18 07:39:45] [INFO ] Deduced a trap composed of 64 places in 6163 ms of which 1 ms to minimize.
[2023-03-18 07:39:51] [INFO ] Deduced a trap composed of 128 places in 4932 ms of which 1 ms to minimize.
[2023-03-18 07:39:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 139887 ms
[2023-03-18 07:40:24] [INFO ] After 183098ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 7797 ms.
[2023-03-18 07:40:32] [INFO ] After 218925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1584 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1586 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 248950 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4138 ms. (steps per millisecond=241 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4424 ms. (steps per millisecond=226 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4221 ms. (steps per millisecond=236 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 07:41:17] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 07:41:17] [INFO ] Invariant cache hit.
[2023-03-18 07:41:17] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 07:41:17] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 07:41:40] [INFO ] After 23228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 07:41:42] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 07:41:53] [INFO ] After 10882ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 07:42:05] [INFO ] Deduced a trap composed of 40 places in 11141 ms of which 2 ms to minimize.
[2023-03-18 07:42:18] [INFO ] Deduced a trap composed of 64 places in 11396 ms of which 2 ms to minimize.
[2023-03-18 07:42:30] [INFO ] Deduced a trap composed of 40 places in 10628 ms of which 2 ms to minimize.
[2023-03-18 07:42:41] [INFO ] Deduced a trap composed of 96 places in 9996 ms of which 3 ms to minimize.
[2023-03-18 07:42:51] [INFO ] Deduced a trap composed of 64 places in 9037 ms of which 2 ms to minimize.
[2023-03-18 07:43:01] [INFO ] Deduced a trap composed of 64 places in 8548 ms of which 1 ms to minimize.
[2023-03-18 07:43:11] [INFO ] Deduced a trap composed of 96 places in 8646 ms of which 2 ms to minimize.
[2023-03-18 07:43:20] [INFO ] Deduced a trap composed of 64 places in 8437 ms of which 2 ms to minimize.
[2023-03-18 07:43:29] [INFO ] Deduced a trap composed of 128 places in 7600 ms of which 1 ms to minimize.
[2023-03-18 07:43:37] [INFO ] Deduced a trap composed of 96 places in 6535 ms of which 0 ms to minimize.
[2023-03-18 07:43:43] [INFO ] Deduced a trap composed of 96 places in 5181 ms of which 2 ms to minimize.
[2023-03-18 07:43:49] [INFO ] Deduced a trap composed of 64 places in 4648 ms of which 0 ms to minimize.
[2023-03-18 07:43:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 120856 ms
[2023-03-18 07:44:05] [INFO ] After 143056ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 3401 ms.
[2023-03-18 07:44:08] [INFO ] After 171381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1264 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1265 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 288998 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3442 ms. (steps per millisecond=290 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3332 ms. (steps per millisecond=300 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 07:44:47] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 07:44:47] [INFO ] Invariant cache hit.
[2023-03-18 07:44:47] [INFO ] After 179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 07:44:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-18 07:45:09] [INFO ] After 21821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 07:45:10] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 07:45:20] [INFO ] After 9723ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 07:45:32] [INFO ] Deduced a trap composed of 40 places in 10723 ms of which 2 ms to minimize.
[2023-03-18 07:45:43] [INFO ] Deduced a trap composed of 64 places in 10658 ms of which 2 ms to minimize.
[2023-03-18 07:45:54] [INFO ] Deduced a trap composed of 40 places in 9922 ms of which 1 ms to minimize.
[2023-03-18 07:46:06] [INFO ] Deduced a trap composed of 96 places in 10558 ms of which 1 ms to minimize.
[2023-03-18 07:46:16] [INFO ] Deduced a trap composed of 64 places in 8807 ms of which 1 ms to minimize.
[2023-03-18 07:46:26] [INFO ] Deduced a trap composed of 64 places in 9082 ms of which 1 ms to minimize.
[2023-03-18 07:46:36] [INFO ] Deduced a trap composed of 96 places in 8790 ms of which 14 ms to minimize.
[2023-03-18 07:46:45] [INFO ] Deduced a trap composed of 64 places in 8046 ms of which 7 ms to minimize.
[2023-03-18 07:46:54] [INFO ] Deduced a trap composed of 128 places in 7174 ms of which 1 ms to minimize.
[2023-03-18 07:47:01] [INFO ] Deduced a trap composed of 96 places in 6364 ms of which 1 ms to minimize.
[2023-03-18 07:47:08] [INFO ] Deduced a trap composed of 96 places in 5233 ms of which 0 ms to minimize.
[2023-03-18 07:47:13] [INFO ] Deduced a trap composed of 64 places in 4542 ms of which 1 ms to minimize.
[2023-03-18 07:47:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 118304 ms
[2023-03-18 07:47:24] [INFO ] After 134149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2384 ms.
[2023-03-18 07:47:27] [INFO ] After 159416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1269 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1269 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 266089 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3735 ms. (steps per millisecond=267 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3651 ms. (steps per millisecond=273 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 184184 steps, run timeout after 111006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 184184 steps, saw 170528 distinct states, run finished after 111013 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 07:49:57] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 07:49:57] [INFO ] Invariant cache hit.
[2023-03-18 07:49:57] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 07:49:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-18 07:50:19] [INFO ] After 21542ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 07:50:19] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 07:50:28] [INFO ] After 8840ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 07:50:40] [INFO ] Deduced a trap composed of 40 places in 10681 ms of which 2 ms to minimize.
[2023-03-18 07:50:52] [INFO ] Deduced a trap composed of 64 places in 10608 ms of which 2 ms to minimize.
[2023-03-18 07:51:04] [INFO ] Deduced a trap composed of 40 places in 10848 ms of which 2 ms to minimize.
[2023-03-18 07:51:15] [INFO ] Deduced a trap composed of 96 places in 9619 ms of which 2 ms to minimize.
[2023-03-18 07:51:24] [INFO ] Deduced a trap composed of 64 places in 8537 ms of which 1 ms to minimize.
[2023-03-18 07:51:34] [INFO ] Deduced a trap composed of 64 places in 8692 ms of which 1 ms to minimize.
[2023-03-18 07:51:44] [INFO ] Deduced a trap composed of 96 places in 8969 ms of which 1 ms to minimize.
[2023-03-18 07:51:54] [INFO ] Deduced a trap composed of 64 places in 8702 ms of which 1 ms to minimize.
[2023-03-18 07:52:03] [INFO ] Deduced a trap composed of 128 places in 7859 ms of which 1 ms to minimize.
[2023-03-18 07:52:11] [INFO ] Deduced a trap composed of 96 places in 6929 ms of which 1 ms to minimize.
[2023-03-18 07:52:18] [INFO ] Deduced a trap composed of 96 places in 5436 ms of which 2 ms to minimize.
[2023-03-18 07:52:24] [INFO ] Deduced a trap composed of 64 places in 4591 ms of which 1 ms to minimize.
[2023-03-18 07:52:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 120263 ms
[2023-03-18 07:52:34] [INFO ] After 135195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2421 ms.
[2023-03-18 07:52:37] [INFO ] After 160028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1528 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1528 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1522 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 07:52:40] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 07:52:40] [INFO ] Invariant cache hit.
[2023-03-18 07:52:49] [INFO ] Implicit Places using invariants in 9084 ms returned []
Implicit Place search using SMT only with invariants took 9085 ms to find 0 implicit places.
[2023-03-18 07:52:49] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 07:52:49] [INFO ] Invariant cache hit.
[2023-03-18 07:53:19] [INFO ] Performed 87271/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 07:53:42] [INFO ] Dead Transitions using invariants and state equation in 52462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63086 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 12211 ms. (steps per millisecond=8 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-18 07:53:54] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 07:53:54] [INFO ] Invariant cache hit.
[2023-03-18 07:53:54] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-18 07:54:15] [INFO ] After 20289ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 07:54:17] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 07:54:24] [INFO ] After 7531ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-18 07:54:39] [INFO ] Deduced a trap composed of 40 places in 13290 ms of which 3 ms to minimize.
[2023-03-18 07:54:53] [INFO ] Deduced a trap composed of 64 places in 12302 ms of which 2 ms to minimize.
[2023-03-18 07:55:06] [INFO ] Deduced a trap composed of 96 places in 11605 ms of which 9 ms to minimize.
[2023-03-18 07:55:17] [INFO ] Deduced a trap composed of 96 places in 10524 ms of which 2 ms to minimize.
[2023-03-18 07:55:28] [INFO ] Deduced a trap composed of 64 places in 9101 ms of which 1 ms to minimize.
[2023-03-18 07:55:39] [INFO ] Deduced a trap composed of 64 places in 9994 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 07:55:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 07:55:39] [INFO ] After 104520ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 269098 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4049 ms. (steps per millisecond=246 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 07:56:13] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 07:56:13] [INFO ] Invariant cache hit.
[2023-03-18 07:56:13] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 07:56:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-18 07:56:35] [INFO ] After 21989ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 07:56:36] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 07:56:43] [INFO ] After 7233ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 07:56:57] [INFO ] Deduced a trap composed of 40 places in 12041 ms of which 3 ms to minimize.
[2023-03-18 07:57:10] [INFO ] Deduced a trap composed of 64 places in 11853 ms of which 2 ms to minimize.
[2023-03-18 07:57:23] [INFO ] Deduced a trap composed of 96 places in 11675 ms of which 2 ms to minimize.
[2023-03-18 07:57:34] [INFO ] Deduced a trap composed of 96 places in 10489 ms of which 2 ms to minimize.
[2023-03-18 07:57:46] [INFO ] Deduced a trap composed of 64 places in 10352 ms of which 7 ms to minimize.
[2023-03-18 07:57:56] [INFO ] Deduced a trap composed of 64 places in 9366 ms of which 1 ms to minimize.
[2023-03-18 07:58:06] [INFO ] Deduced a trap composed of 96 places in 8261 ms of which 3 ms to minimize.
[2023-03-18 07:58:16] [INFO ] Deduced a trap composed of 128 places in 8810 ms of which 5 ms to minimize.
[2023-03-18 07:58:26] [INFO ] Deduced a trap composed of 128 places in 8423 ms of which 3 ms to minimize.
[2023-03-18 07:58:35] [INFO ] Deduced a trap composed of 40 places in 8055 ms of which 1 ms to minimize.
[2023-03-18 07:58:43] [INFO ] Deduced a trap composed of 64 places in 7221 ms of which 1 ms to minimize.
[2023-03-18 07:58:53] [INFO ] Deduced a trap composed of 64 places in 8300 ms of which 0 ms to minimize.
[2023-03-18 07:59:01] [INFO ] Deduced a trap composed of 96 places in 7203 ms of which 1 ms to minimize.
[2023-03-18 07:59:08] [INFO ] Deduced a trap composed of 128 places in 5363 ms of which 0 ms to minimize.
[2023-03-18 07:59:13] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 149247 ms
[2023-03-18 07:59:13] [INFO ] After 157265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1322 ms.
[2023-03-18 07:59:15] [INFO ] After 181634ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1345 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1345 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 282875 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3560 ms. (steps per millisecond=280 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181531 steps, run timeout after 99001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 181531 steps, saw 168126 distinct states, run finished after 99002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 08:01:29] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:01:29] [INFO ] Invariant cache hit.
[2023-03-18 08:01:29] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 08:01:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 08:01:52] [INFO ] After 22825ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 08:01:53] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 08:02:02] [INFO ] After 8265ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 08:02:16] [INFO ] Deduced a trap composed of 40 places in 12654 ms of which 2 ms to minimize.
[2023-03-18 08:02:29] [INFO ] Deduced a trap composed of 64 places in 12267 ms of which 3 ms to minimize.
[2023-03-18 08:02:42] [INFO ] Deduced a trap composed of 96 places in 11510 ms of which 3 ms to minimize.
[2023-03-18 08:02:54] [INFO ] Deduced a trap composed of 96 places in 10549 ms of which 1 ms to minimize.
[2023-03-18 08:03:05] [INFO ] Deduced a trap composed of 64 places in 10147 ms of which 1 ms to minimize.
[2023-03-18 08:03:16] [INFO ] Deduced a trap composed of 64 places in 10091 ms of which 2 ms to minimize.
[2023-03-18 08:03:27] [INFO ] Deduced a trap composed of 96 places in 9626 ms of which 1 ms to minimize.
[2023-03-18 08:03:37] [INFO ] Deduced a trap composed of 128 places in 9207 ms of which 1 ms to minimize.
[2023-03-18 08:03:47] [INFO ] Deduced a trap composed of 128 places in 7905 ms of which 2 ms to minimize.
[2023-03-18 08:03:55] [INFO ] Deduced a trap composed of 40 places in 7411 ms of which 1 ms to minimize.
[2023-03-18 08:04:04] [INFO ] Deduced a trap composed of 64 places in 7463 ms of which 1 ms to minimize.
[2023-03-18 08:04:12] [INFO ] Deduced a trap composed of 64 places in 7078 ms of which 0 ms to minimize.
[2023-03-18 08:04:20] [INFO ] Deduced a trap composed of 96 places in 6855 ms of which 1 ms to minimize.
[2023-03-18 08:04:27] [INFO ] Deduced a trap composed of 128 places in 5892 ms of which 1 ms to minimize.
[2023-03-18 08:04:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 150120 ms
[2023-03-18 08:04:33] [INFO ] After 159153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1192 ms.
[2023-03-18 08:04:34] [INFO ] After 184328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1262 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1262 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1234 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 08:04:36] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:04:36] [INFO ] Invariant cache hit.
[2023-03-18 08:04:45] [INFO ] Implicit Places using invariants in 8913 ms returned []
Implicit Place search using SMT only with invariants took 8915 ms to find 0 implicit places.
[2023-03-18 08:04:45] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-18 08:04:45] [INFO ] Invariant cache hit.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13497264 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16043476 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="RERS17pb114-PT-4"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is RERS17pb114-PT-4, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r344-tall-167889215800063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-4.tgz
mv RERS17pb114-PT-4 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;