Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r198-tall-171640627000518.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is HealthRecord-PT-17, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r198-tall-171640627000518
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 175K May 18 16:42 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 1716498210537

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=gold2023
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-17
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202304061127
[2024-05-23 21:03:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 21:03:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 21:03:32] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-23 21:03:32] [INFO ] Transformed 624 places.
[2024-05-23 21:03:32] [INFO ] Transformed 828 transitions.
[2024-05-23 21:03:32] [INFO ] Found NUPN structural information;
[2024-05-23 21:03:32] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 143 ms.
Graph (trivial) has 749 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 6 ms
Free SCC test removed 66 places
Structural test allowed to assert that 266 places are NOT stable. Took 16 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
[2024-05-23 21:03:32] [INFO ] Flatten gal took : 113 ms
[2024-05-23 21:03:32] [INFO ] Flatten gal took : 43 ms
[2024-05-23 21:03:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3605843556642743374.gal : 35 ms
[2024-05-23 21:03:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2970112965615837667.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3605843556642743374.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2970112965615837667.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2970112965615837667.prop.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 702 ms. (steps per millisecond=14 ) properties (out of 358) seen :36
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 322) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 322) seen :0
Running SMT prover for 322 properties.
[2024-05-23 21:03:33] [INFO ] Flow matrix only has 733 transitions (discarded 20 similar events)
// Phase 1: matrix 733 rows 558 cols
SDD proceeding with computation,358 properties remain. new max is 4
SDD size :1 after 5
[2024-05-23 21:03:33] [INFO ] Computed 18 invariants in 29 ms
SDD proceeding with computation,358 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,358 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,358 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,358 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,358 properties remain. new max is 128
SDD size :27 after 41
SDD proceeding with computation,358 properties remain. new max is 256
SDD size :41 after 461
SDD proceeding with computation,358 properties remain. new max is 512
SDD size :461 after 2.79368e+08
[2024-05-23 21:03:37] [INFO ] After 4093ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:322
[2024-05-23 21:03:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2024-05-23 21:03:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 10 ms returned sat
[2024-05-23 21:03:50] [INFO ] After 8053ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :322
[2024-05-23 21:03:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 21:03:58] [INFO ] After 7821ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :322
[2024-05-23 21:04:00] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 6 ms to minimize.
[2024-05-23 21:04:00] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 1 ms to minimize.
[2024-05-23 21:04:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 384 ms
[2024-05-23 21:04:01] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 1 ms to minimize.
[2024-05-23 21:04:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2024-05-23 21:04:02] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
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:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-23 21:04:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-23 21:04:02] [INFO ] After 25199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:322
Fused 322 Parikh solutions to 316 different solutions.
Parikh walk visited 22 properties in 2413 ms.
Support contains 300 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 753/753 transitions.
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 558 transition count 591
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 156 rules applied. Total rules applied 318 place count 417 transition count 576
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 326 place count 409 transition count 576
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 326 place count 409 transition count 566
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 346 place count 399 transition count 566
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 352 place count 393 transition count 554
Iterating global reduction 3 with 6 rules applied. Total rules applied 358 place count 393 transition count 554
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 394 place count 375 transition count 536
Performed 8 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 410 place count 367 transition count 573
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 414 place count 367 transition count 569
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 433 place count 367 transition count 550
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 435 place count 366 transition count 561
Free-agglomeration rule applied 19 times.
Iterating global reduction 4 with 19 rules applied. Total rules applied 454 place count 366 transition count 542
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 473 place count 347 transition count 542
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 479 place count 347 transition count 542
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 483 place count 347 transition count 542
Applied a total of 483 rules in 112 ms. Remains 347 /558 variables (removed 211) and now considering 542/753 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 347/558 places, 542/753 transitions.
Interrupted random walk after 699435 steps, including 76275 resets, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen 159
Incomplete Best-First random walk after 10000 steps, including 123 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 140 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10000 steps, including 130 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10000 steps, including 128 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10000 steps, including 122 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 141) seen :0
Running SMT prover for 141 properties.
// Phase 1: matrix 542 rows 347 cols
[2024-05-23 21:04:37] [INFO ] Computed 18 invariants in 17 ms
[2024-05-23 21:04:38] [INFO ] After 910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:141
[2024-05-23 21:04:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2024-05-23 21:04:39] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2024-05-23 21:04:42] [INFO ] After 2227ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :141
[2024-05-23 21:04:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 21:04:44] [INFO ] After 2145ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :141
[2024-05-23 21:04:44] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 0 ms to minimize.
[2024-05-23 21:04:44] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 0 ms to minimize.
[2024-05-23 21:04:45] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 1 ms to minimize.
[2024-05-23 21:04:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 356 ms
[2024-05-23 21:04:45] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 1 ms to minimize.
[2024-05-23 21:04:45] [INFO ] Deduced a trap composed of 91 places in 69 ms of which 1 ms to minimize.
[2024-05-23 21:04:45] [INFO ] Deduced a trap composed of 77 places in 82 ms of which 0 ms to minimize.
[2024-05-23 21:04:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 344 ms
[2024-05-23 21:04:46] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 0 ms to minimize.
[2024-05-23 21:04:46] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 0 ms to minimize.
[2024-05-23 21:04:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 218 ms
[2024-05-23 21:04:46] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-05-23 21:04:46] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 1 ms to minimize.
[2024-05-23 21:04:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2024-05-23 21:04:47] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 1 ms to minimize.
[2024-05-23 21:04:47] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 0 ms to minimize.
[2024-05-23 21:04:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2024-05-23 21:04:47] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-23 21:04:47] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 0 ms to minimize.
[2024-05-23 21:04:47] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 0 ms to minimize.
[2024-05-23 21:04:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 330 ms
[2024-05-23 21:04:47] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 0 ms to minimize.
[2024-05-23 21:04:48] [INFO ] Deduced a trap composed of 91 places in 73 ms of which 1 ms to minimize.
[2024-05-23 21:04:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2024-05-23 21:04:49] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 1 ms to minimize.
[2024-05-23 21:04:49] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-23 21:04:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2024-05-23 21:04:49] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 0 ms to minimize.
[2024-05-23 21:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-23 21:04:49] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 0 ms to minimize.
[2024-05-23 21:04:49] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 0 ms to minimize.
[2024-05-23 21:04:49] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 0 ms to minimize.
[2024-05-23 21:04:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2024-05-23 21:04:49] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 0 ms to minimize.
[2024-05-23 21:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-23 21:04:50] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 0 ms to minimize.
[2024-05-23 21:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-23 21:04:50] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 0 ms to minimize.
[2024-05-23 21:04:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2024-05-23 21:04:50] [INFO ] After 8459ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :141
Attempting to minimize the solution found.
Minimization took 2205 ms.
[2024-05-23 21:04:53] [INFO ] After 14437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :141
Fused 141 Parikh solutions to 121 different solutions.
Parikh walk visited 102 properties in 1080 ms.
Support contains 39 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 542/542 transitions.
Graph (complete) has 993 edges and 347 vertex of which 338 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 338 transition count 411
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 152 rules applied. Total rules applied 284 place count 207 transition count 390
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 289 place count 202 transition count 390
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 289 place count 202 transition count 386
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 297 place count 198 transition count 386
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 356 place count 139 transition count 261
Iterating global reduction 3 with 59 rules applied. Total rules applied 415 place count 139 transition count 261
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 422 place count 132 transition count 247
Iterating global reduction 3 with 7 rules applied. Total rules applied 429 place count 132 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 433 place count 132 transition count 243
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 436 place count 129 transition count 240
Iterating global reduction 4 with 3 rules applied. Total rules applied 439 place count 129 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 442 place count 129 transition count 237
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 476 place count 112 transition count 220
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 478 place count 112 transition count 218
Performed 7 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 492 place count 105 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 493 place count 105 transition count 243
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 496 place count 105 transition count 240
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 501 place count 105 transition count 235
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 508 place count 100 transition count 233
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 520 place count 100 transition count 233
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 530 place count 100 transition count 233
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 536 place count 100 transition count 233
Applied a total of 536 rules in 71 ms. Remains 100 /347 variables (removed 247) and now considering 233/542 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 100/347 places, 233/542 transitions.
Incomplete random walk after 1000000 steps, including 111195 resets, run finished after 26390 ms. (steps per millisecond=37 ) properties (out of 39) seen :24
Incomplete Best-First random walk after 100001 steps, including 1181 resets, run finished after 292 ms. (steps per millisecond=342 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1173 resets, run finished after 298 ms. (steps per millisecond=335 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1173 resets, run finished after 298 ms. (steps per millisecond=335 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1190 resets, run finished after 303 ms. (steps per millisecond=330 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1199 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1181 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1167 resets, run finished after 302 ms. (steps per millisecond=331 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1178 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1181 resets, run finished after 299 ms. (steps per millisecond=334 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1188 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1181 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1176 resets, run finished after 285 ms. (steps per millisecond=350 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1180 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1187 resets, run finished after 298 ms. (steps per millisecond=335 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1178 resets, run finished after 297 ms. (steps per millisecond=336 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2024-05-23 21:05:25] [INFO ] Flow matrix only has 224 transitions (discarded 9 similar events)
// Phase 1: matrix 224 rows 100 cols
[2024-05-23 21:05:25] [INFO ] Computed 9 invariants in 2 ms
[2024-05-23 21:05:25] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-05-23 21:05:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 21:05:25] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-23 21:05:25] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2024-05-23 21:05:25] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-23 21:05:25] [INFO ] After 97ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2024-05-23 21:05:25] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-05-23 21:05:25] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-23 21:05:25] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 21:05:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 173 ms
[2024-05-23 21:05:25] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-23 21:05:25] [INFO ] After 722ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 217 ms.
Support contains 15 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 233/233 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 100 transition count 214
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 81 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 76 transition count 206
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 76 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 75 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 75 transition count 204
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 72 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 60 place count 72 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 71 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 71 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 70 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 70 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 68 place count 70 transition count 187
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 68 transition count 191
Applied a total of 72 rules in 19 ms. Remains 68 /100 variables (removed 32) and now considering 191/233 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 68/100 places, 191/233 transitions.
Incomplete random walk after 1000000 steps, including 111061 resets, run finished after 24063 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1182 resets, run finished after 276 ms. (steps per millisecond=362 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1200 resets, run finished after 278 ms. (steps per millisecond=359 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1197 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1186 resets, run finished after 295 ms. (steps per millisecond=338 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1192 resets, run finished after 296 ms. (steps per millisecond=337 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1176 resets, run finished after 309 ms. (steps per millisecond=323 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1199 resets, run finished after 310 ms. (steps per millisecond=322 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1190 resets, run finished after 308 ms. (steps per millisecond=324 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 1193 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1185 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1192 resets, run finished after 278 ms. (steps per millisecond=359 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1183 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1177 resets, run finished after 276 ms. (steps per millisecond=362 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1201 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 1205 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 15) seen :0
Finished probabilistic random walk after 39855 steps, run visited all 15 properties in 258 ms. (steps per millisecond=154 )
Probabilistic random walk after 39855 steps, saw 10805 distinct states, run finished after 258 ms. (steps per millisecond=154 ) properties seen :15
Parikh walk visited 0 properties in 0 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
Able to resolve query StableMarking after proving 360 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 142673 ms.

BK_STOP 1716498356094

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="HealthRecord-PT-17"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is HealthRecord-PT-17, 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 r198-tall-171640627000518"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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