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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 293K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678998058407

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=ASLink-PT-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 20:21:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-16 20:21:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 20:21:00] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2023-03-16 20:21:00] [INFO ] Transformed 846 places.
[2023-03-16 20:21:00] [INFO ] Transformed 1148 transitions.
[2023-03-16 20:21:00] [INFO ] Found NUPN structural information;
[2023-03-16 20:21:00] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 186 ms.
Structural test allowed to assert that 96 places are NOT stable. Took 10 ms.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 551 ms. (steps per millisecond=18 ) properties (out of 750) seen :634
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 116) 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 116) 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 116) 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 116) 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 116) 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 116) 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 116) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 116) seen :0
Running SMT prover for 116 properties.
// Phase 1: matrix 1148 rows 846 cols
[2023-03-16 20:21:01] [INFO ] Computed 82 place invariants in 52 ms
[2023-03-16 20:21:04] [INFO ] After 3153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:116
[2023-03-16 20:21:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 26 ms returned sat
[2023-03-16 20:21:07] [INFO ] [Nat]Absence check using 19 positive and 63 generalized place invariants in 62 ms returned sat
[2023-03-16 20:21:20] [INFO ] After 8803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :116
[2023-03-16 20:21:21] [INFO ] Deduced a trap composed of 35 places in 470 ms of which 5 ms to minimize.
[2023-03-16 20:21:21] [INFO ] Deduced a trap composed of 75 places in 340 ms of which 1 ms to minimize.
[2023-03-16 20:21:22] [INFO ] Deduced a trap composed of 102 places in 357 ms of which 1 ms to minimize.
[2023-03-16 20:21:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1352 ms
[2023-03-16 20:21:23] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 4 ms to minimize.
[2023-03-16 20:21:23] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 14 ms to minimize.
[2023-03-16 20:21:23] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 1 ms to minimize.
[2023-03-16 20:21:24] [INFO ] Deduced a trap composed of 107 places in 266 ms of which 1 ms to minimize.
[2023-03-16 20:21:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1153 ms
[2023-03-16 20:21:26] [INFO ] Deduced a trap composed of 195 places in 346 ms of which 1 ms to minimize.
[2023-03-16 20:21:26] [INFO ] Deduced a trap composed of 196 places in 481 ms of which 1 ms to minimize.
[2023-03-16 20:21:27] [INFO ] Deduced a trap composed of 227 places in 327 ms of which 1 ms to minimize.
[2023-03-16 20:21:27] [INFO ] Deduced a trap composed of 202 places in 369 ms of which 1 ms to minimize.
[2023-03-16 20:21:27] [INFO ] Deduced a trap composed of 75 places in 338 ms of which 1 ms to minimize.
[2023-03-16 20:21:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2239 ms
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.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.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-16 20:21:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 20:21:30] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:116
Fused 116 Parikh solutions to 114 different solutions.
Parikh walk visited 17 properties in 27005 ms.
Support contains 99 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 167 place count 846 transition count 981
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 177 rules applied. Total rules applied 344 place count 679 transition count 971
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 347 place count 676 transition count 971
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 347 place count 676 transition count 801
Deduced a syphon composed of 170 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 699 place count 494 transition count 801
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 10 rules applied. Total rules applied 709 place count 493 transition count 792
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 718 place count 484 transition count 792
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 718 place count 484 transition count 788
Deduced a syphon composed of 4 places in 18 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 730 place count 476 transition count 788
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 730 place count 476 transition count 784
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 738 place count 472 transition count 784
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 760 place count 450 transition count 762
Iterating global reduction 5 with 22 rules applied. Total rules applied 782 place count 450 transition count 762
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 783 place count 450 transition count 761
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 783 place count 450 transition count 753
Deduced a syphon composed of 8 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 17 rules applied. Total rules applied 800 place count 441 transition count 753
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 800 place count 441 transition count 752
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 803 place count 439 transition count 752
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 805 place count 437 transition count 737
Iterating global reduction 6 with 2 rules applied. Total rules applied 807 place count 437 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 807 place count 437 transition count 736
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 809 place count 436 transition count 736
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 810 place count 435 transition count 728
Iterating global reduction 6 with 1 rules applied. Total rules applied 811 place count 435 transition count 728
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 812 place count 434 transition count 720
Iterating global reduction 6 with 1 rules applied. Total rules applied 813 place count 434 transition count 720
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 814 place count 433 transition count 712
Iterating global reduction 6 with 1 rules applied. Total rules applied 815 place count 433 transition count 712
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 816 place count 432 transition count 704
Iterating global reduction 6 with 1 rules applied. Total rules applied 817 place count 432 transition count 704
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 818 place count 431 transition count 696
Iterating global reduction 6 with 1 rules applied. Total rules applied 819 place count 431 transition count 696
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 820 place count 430 transition count 688
Iterating global reduction 6 with 1 rules applied. Total rules applied 821 place count 430 transition count 688
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 822 place count 429 transition count 680
Iterating global reduction 6 with 1 rules applied. Total rules applied 823 place count 429 transition count 680
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 824 place count 428 transition count 672
Iterating global reduction 6 with 1 rules applied. Total rules applied 825 place count 428 transition count 672
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 826 place count 427 transition count 664
Iterating global reduction 6 with 1 rules applied. Total rules applied 827 place count 427 transition count 664
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 828 place count 426 transition count 656
Iterating global reduction 6 with 1 rules applied. Total rules applied 829 place count 426 transition count 656
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 830 place count 425 transition count 648
Iterating global reduction 6 with 1 rules applied. Total rules applied 831 place count 425 transition count 648
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 832 place count 424 transition count 640
Iterating global reduction 6 with 1 rules applied. Total rules applied 833 place count 424 transition count 640
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 834 place count 423 transition count 632
Iterating global reduction 6 with 1 rules applied. Total rules applied 835 place count 423 transition count 632
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 836 place count 422 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 837 place count 422 transition count 624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 838 place count 421 transition count 616
Iterating global reduction 6 with 1 rules applied. Total rules applied 839 place count 421 transition count 616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 840 place count 420 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 841 place count 420 transition count 608
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 919 place count 381 transition count 569
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 920 place count 380 transition count 568
Ensure Unique test removed 1 places
Iterating global reduction 6 with 2 rules applied. Total rules applied 922 place count 379 transition count 568
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 923 place count 378 transition count 567
Iterating global reduction 6 with 1 rules applied. Total rules applied 924 place count 378 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 926 place count 378 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 927 place count 377 transition count 565
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 929 place count 376 transition count 574
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 932 place count 376 transition count 571
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 935 place count 373 transition count 571
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 936 place count 372 transition count 570
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 937 place count 371 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 937 place count 371 transition count 569
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 939 place count 370 transition count 569
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 940 place count 369 transition count 569
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 944 place count 367 transition count 567
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 945 place count 366 transition count 566
Iterating global reduction 11 with 1 rules applied. Total rules applied 946 place count 366 transition count 566
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 947 place count 366 transition count 565
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 948 place count 365 transition count 565
Applied a total of 948 rules in 461 ms. Remains 365 /846 variables (removed 481) and now considering 565/1148 (removed 583) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 365/846 places, 565/1148 transitions.
Interrupted random walk after 896261 steps, including 18907 resets, run timeout after 30001 ms. (steps per millisecond=29 ) properties seen 68
Incomplete Best-First random walk after 100001 steps, including 918 resets, run finished after 1405 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 931 resets, run finished after 1366 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 932 resets, run finished after 1561 ms. (steps per millisecond=64 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 903 resets, run finished after 1477 ms. (steps per millisecond=67 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 907 resets, run finished after 1363 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 919 resets, run finished after 1450 ms. (steps per millisecond=68 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 903 resets, run finished after 1343 ms. (steps per millisecond=74 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 959 resets, run finished after 1366 ms. (steps per millisecond=73 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 916 resets, run finished after 1402 ms. (steps per millisecond=71 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 958 resets, run finished after 1491 ms. (steps per millisecond=67 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 938 resets, run finished after 1473 ms. (steps per millisecond=67 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 935 resets, run finished after 1318 ms. (steps per millisecond=75 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 918 resets, run finished after 1453 ms. (steps per millisecond=68 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 926 resets, run finished after 1517 ms. (steps per millisecond=65 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 909 resets, run finished after 1418 ms. (steps per millisecond=70 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 926 resets, run finished after 1512 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 935 resets, run finished after 1561 ms. (steps per millisecond=64 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 940 resets, run finished after 1384 ms. (steps per millisecond=72 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 918 resets, run finished after 1602 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 916 resets, run finished after 1598 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 947 resets, run finished after 1329 ms. (steps per millisecond=75 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 931 resets, run finished after 1381 ms. (steps per millisecond=72 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 914 resets, run finished after 1425 ms. (steps per millisecond=70 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 910 resets, run finished after 1383 ms. (steps per millisecond=72 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 959 resets, run finished after 1279 ms. (steps per millisecond=78 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 942 resets, run finished after 1602 ms. (steps per millisecond=62 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 912 resets, run finished after 1537 ms. (steps per millisecond=65 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 916 resets, run finished after 1550 ms. (steps per millisecond=64 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 904 resets, run finished after 1345 ms. (steps per millisecond=74 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 887 resets, run finished after 1450 ms. (steps per millisecond=68 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100000 steps, including 936 resets, run finished after 1516 ms. (steps per millisecond=65 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
// Phase 1: matrix 565 rows 365 cols
[2023-03-16 20:23:12] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-16 20:23:12] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-16 20:23:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-03-16 20:23:13] [INFO ] [Nat]Absence check using 17 positive and 43 generalized place invariants in 21 ms returned sat
[2023-03-16 20:23:14] [INFO ] After 1089ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :31
[2023-03-16 20:23:16] [INFO ] After 2883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :31
Attempting to minimize the solution found.
Minimization took 951 ms.
[2023-03-16 20:23:17] [INFO ] After 4640ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :31
Fused 31 Parikh solutions to 28 different solutions.
Parikh walk visited 0 properties in 1247 ms.
Support contains 31 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 565/565 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 365 transition count 546
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 346 transition count 546
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 38 place count 346 transition count 534
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 62 place count 334 transition count 534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 333 transition count 533
Applied a total of 64 rules in 27 ms. Remains 333 /365 variables (removed 32) and now considering 533/565 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 333/365 places, 533/565 transitions.
Interrupted random walk after 940008 steps, including 19983 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 16
Incomplete Best-First random walk after 100001 steps, including 952 resets, run finished after 1362 ms. (steps per millisecond=73 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 913 resets, run finished after 1033 ms. (steps per millisecond=96 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 953 resets, run finished after 856 ms. (steps per millisecond=116 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 957 resets, run finished after 1236 ms. (steps per millisecond=80 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 930 resets, run finished after 1422 ms. (steps per millisecond=70 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 931 resets, run finished after 1279 ms. (steps per millisecond=78 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 903 resets, run finished after 1272 ms. (steps per millisecond=78 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 918 resets, run finished after 1671 ms. (steps per millisecond=59 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 933 resets, run finished after 1292 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 889 resets, run finished after 1361 ms. (steps per millisecond=73 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 939 resets, run finished after 1200 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 924 resets, run finished after 1294 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 919 resets, run finished after 1613 ms. (steps per millisecond=61 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 882 resets, run finished after 1299 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100000 steps, including 884 resets, run finished after 1238 ms. (steps per millisecond=80 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 533 rows 333 cols
[2023-03-16 20:24:07] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-16 20:24:08] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-16 20:24:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 20:24:08] [INFO ] [Nat]Absence check using 18 positive and 42 generalized place invariants in 14 ms returned sat
[2023-03-16 20:24:09] [INFO ] After 1189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-16 20:24:09] [INFO ] After 1651ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 492 ms.
[2023-03-16 20:24:10] [INFO ] After 2422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 7725 ms.
Support contains 15 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 533/533 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 333 transition count 532
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 332 transition count 532
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 332 transition count 528
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 11 place count 327 transition count 528
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 327 transition count 527
Reduce places removed 1 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 15 place count 325 transition count 526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 16 place count 324 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 21 place count 321 transition count 524
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 21 place count 321 transition count 522
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 25 place count 319 transition count 522
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 26 place count 318 transition count 522
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 26 place count 318 transition count 521
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 28 place count 317 transition count 521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 30 place count 316 transition count 520
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 31 place count 316 transition count 520
Applied a total of 31 rules in 56 ms. Remains 316 /333 variables (removed 17) and now considering 520/533 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 316/333 places, 520/533 transitions.
Incomplete random walk after 1000000 steps, including 21231 resets, run finished after 9740 ms. (steps per millisecond=102 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 9315 resets, run finished after 3292 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9169 resets, run finished after 3836 ms. (steps per millisecond=260 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 520 rows 316 cols
[2023-03-16 20:24:35] [INFO ] Computed 56 place invariants in 10 ms
[2023-03-16 20:24:35] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 20:24:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-16 20:24:35] [INFO ] [Nat]Absence check using 16 positive and 40 generalized place invariants in 57 ms returned sat
[2023-03-16 20:24:35] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 20:24:35] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-16 20:24:35] [INFO ] After 596ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 242 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 520/520 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 316 transition count 518
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 314 transition count 518
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 314 transition count 515
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 311 transition count 515
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 307 transition count 511
Applied a total of 18 rules in 24 ms. Remains 307 /316 variables (removed 9) and now considering 511/520 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 307/316 places, 511/520 transitions.
Incomplete random walk after 1000000 steps, including 21156 resets, run finished after 8803 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9283 resets, run finished after 3786 ms. (steps per millisecond=264 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9202 resets, run finished after 3298 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 716579 steps, run visited all 2 properties in 3758 ms. (steps per millisecond=190 )
Probabilistic random walk after 716579 steps, saw 220603 distinct states, run finished after 3758 ms. (steps per millisecond=190 ) properties seen :2
Able to resolve query StableMarking after proving 751 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 234974 ms.
ITS solved all properties within timeout

BK_STOP 1678998296026

--------------------
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="ASLink-PT-01b"
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 ASLink-PT-01b, 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 r024-oct2-167813610700013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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