About the Execution of Smart+red for FlexibleBarrier-PT-20b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1419.224 | 3600000.00 | 3651976.00 | 10770.90 | TFTFFTFFFFFTTTTF | normal |
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.r171-tall-167838858800582.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FlexibleBarrier-PT-20b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858800582
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 12:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 12:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Feb 25 12:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 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 1.5M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679483388177
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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 11:09:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 11:09:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:09:49] [INFO ] Load time of PNML (sax parser for PT used): 255 ms
[2023-03-22 11:09:49] [INFO ] Transformed 5372 places.
[2023-03-22 11:09:49] [INFO ] Transformed 6193 transitions.
[2023-03-22 11:09:49] [INFO ] Found NUPN structural information;
[2023-03-22 11:09:50] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 75 resets, run finished after 564 ms. (steps per millisecond=17 ) properties (out of 16) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 118328 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{4=1, 14=1}
Probabilistic random walk after 118328 steps, saw 69793 distinct states, run finished after 3002 ms. (steps per millisecond=39 ) properties seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 13 properties.
// Phase 1: matrix 6193 rows 5372 cols
[2023-03-22 11:09:54] [INFO ] Computed 22 place invariants in 191 ms
[2023-03-22 11:09:56] [INFO ] After 1912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 11:09:57] [INFO ] [Nat]Absence check using 22 positive place invariants in 50 ms returned sat
[2023-03-22 11:10:05] [INFO ] After 7149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-22 11:10:10] [INFO ] Deduced a trap composed of 2080 places in 4440 ms of which 23 ms to minimize.
[2023-03-22 11:10:15] [INFO ] Deduced a trap composed of 2059 places in 4208 ms of which 14 ms to minimize.
[2023-03-22 11:10:19] [INFO ] Deduced a trap composed of 2043 places in 3708 ms of which 4 ms to minimize.
[2023-03-22 11:10:23] [INFO ] Deduced a trap composed of 1949 places in 3820 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 11:10:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 11:10:23] [INFO ] After 26963ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:13
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 355 ms.
Support contains 192 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 4936 edges and 5372 vertex of which 74 / 5372 are part of one of the 12 SCC in 24 ms
Free SCC test removed 62 places
Drop transitions removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions removed 1210 transitions
Trivial Post-agglo rules discarded 1210 transitions
Performed 1210 trivial Post agglomeration. Transition count delta: 1210
Iterating post reduction 0 with 1210 rules applied. Total rules applied 1211 place count 5310 transition count 4908
Reduce places removed 1210 places and 0 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Iterating post reduction 1 with 1263 rules applied. Total rules applied 2474 place count 4100 transition count 4855
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 2527 place count 4047 transition count 4855
Performed 342 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 342 Pre rules applied. Total rules applied 2527 place count 4047 transition count 4513
Deduced a syphon composed of 342 places in 6 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 3211 place count 3705 transition count 4513
Discarding 2070 places :
Symmetric choice reduction at 3 with 2070 rule applications. Total rules 5281 place count 1635 transition count 2443
Iterating global reduction 3 with 2070 rules applied. Total rules applied 7351 place count 1635 transition count 2443
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 7351 place count 1635 transition count 2439
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 7359 place count 1631 transition count 2439
Discarding 269 places :
Symmetric choice reduction at 3 with 269 rule applications. Total rules 7628 place count 1362 transition count 2170
Iterating global reduction 3 with 269 rules applied. Total rules applied 7897 place count 1362 transition count 2170
Ensure Unique test removed 247 transitions
Reduce isomorphic transitions removed 247 transitions.
Iterating post reduction 3 with 247 rules applied. Total rules applied 8144 place count 1362 transition count 1923
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 2 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 8424 place count 1222 transition count 1783
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 8454 place count 1222 transition count 1753
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 8471 place count 1205 transition count 1736
Iterating global reduction 5 with 17 rules applied. Total rules applied 8488 place count 1205 transition count 1736
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 8500 place count 1199 transition count 1736
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 8513 place count 1199 transition count 1723
Free-agglomeration rule applied 771 times.
Iterating global reduction 5 with 771 rules applied. Total rules applied 9284 place count 1199 transition count 952
Reduce places removed 771 places and 0 transitions.
Drop transitions removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 5 with 871 rules applied. Total rules applied 10155 place count 428 transition count 852
Drop transitions removed 129 transitions
Redundant transition composition rules discarded 129 transitions
Iterating global reduction 6 with 129 rules applied. Total rules applied 10284 place count 428 transition count 723
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 10290 place count 428 transition count 723
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 10306 place count 428 transition count 707
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 10307 place count 427 transition count 706
Applied a total of 10307 rules in 1450 ms. Remains 427 /5372 variables (removed 4945) and now considering 706/6193 (removed 5487) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1451 ms. Remains : 427/5372 places, 706/6193 transitions.
Incomplete random walk after 10000 steps, including 118 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 10) seen :2
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 11:10:25] [INFO ] Flow matrix only has 700 transitions (discarded 6 similar events)
// Phase 1: matrix 700 rows 427 cols
[2023-03-22 11:10:25] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-22 11:10:25] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 11:10:25] [INFO ] [Nat]Absence check using 22 positive place invariants in 6 ms returned sat
[2023-03-22 11:10:26] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 11:10:26] [INFO ] State equation strengthened by 355 read => feed constraints.
[2023-03-22 11:10:26] [INFO ] After 300ms SMT Verify possible using 355 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-22 11:10:26] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
[2023-03-22 11:10:26] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 0 ms to minimize.
[2023-03-22 11:10:26] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 0 ms to minimize.
[2023-03-22 11:10:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 403 ms
[2023-03-22 11:10:26] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 1 ms to minimize.
[2023-03-22 11:10:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-22 11:10:27] [INFO ] After 1165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-22 11:10:27] [INFO ] After 1984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 47 ms.
Support contains 142 out of 427 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 427/427 places, 706/706 transitions.
Graph (trivial) has 122 edges and 427 vertex of which 7 / 427 are part of one of the 3 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 423 transition count 679
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 403 transition count 679
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 41 place count 403 transition count 677
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 401 transition count 677
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 61 place count 385 transition count 661
Iterating global reduction 2 with 16 rules applied. Total rules applied 77 place count 385 transition count 661
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 385 transition count 660
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 116 place count 366 transition count 641
Drop transitions removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 137 place count 366 transition count 620
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 162 place count 366 transition count 595
Free-agglomeration rule applied 53 times with reduction of 1 identical transitions.
Iterating global reduction 4 with 53 rules applied. Total rules applied 215 place count 366 transition count 541
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 296 place count 313 transition count 513
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 307 place count 313 transition count 502
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 308 place count 313 transition count 502
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 309 place count 312 transition count 501
Applied a total of 309 rules in 105 ms. Remains 312 /427 variables (removed 115) and now considering 501/706 (removed 205) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 312/427 places, 501/706 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-22 11:10:27] [INFO ] Flow matrix only has 498 transitions (discarded 3 similar events)
// Phase 1: matrix 498 rows 312 cols
[2023-03-22 11:10:27] [INFO ] Computed 22 place invariants in 4 ms
[2023-03-22 11:10:28] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 11:10:28] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-22 11:10:28] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 11:10:28] [INFO ] State equation strengthened by 278 read => feed constraints.
[2023-03-22 11:10:28] [INFO ] After 165ms SMT Verify possible using 278 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-22 11:10:28] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 0 ms to minimize.
[2023-03-22 11:10:28] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2023-03-22 11:10:28] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2023-03-22 11:10:28] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2023-03-22 11:10:28] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 63 places in 75 ms of which 1 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:10:29] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 0 ms to minimize.
[2023-03-22 11:10:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1505 ms
[2023-03-22 11:10:30] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2023-03-22 11:10:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-22 11:10:30] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-03-22 11:10:30] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 0 ms to minimize.
[2023-03-22 11:10:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-03-22 11:10:30] [INFO ] After 2102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 148 ms.
[2023-03-22 11:10:30] [INFO ] After 2560ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 13 ms.
Support contains 47 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 501/501 transitions.
Graph (trivial) has 124 edges and 312 vertex of which 12 / 312 are part of one of the 4 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 304 transition count 460
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 283 transition count 460
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 91 place count 235 transition count 412
Iterating global reduction 2 with 48 rules applied. Total rules applied 139 place count 235 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 141 place count 235 transition count 410
Performed 24 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 189 place count 211 transition count 385
Drop transitions removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 239 place count 211 transition count 335
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 243 place count 207 transition count 331
Iterating global reduction 4 with 4 rules applied. Total rules applied 247 place count 207 transition count 331
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 248 place count 207 transition count 330
Free-agglomeration rule applied 19 times.
Iterating global reduction 5 with 19 rules applied. Total rules applied 267 place count 207 transition count 311
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 14 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 301 place count 188 transition count 296
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 302 place count 188 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 303 place count 187 transition count 295
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 102 edges and 186 vertex of which 36 / 186 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 307 place count 168 transition count 293
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 345 place count 166 transition count 257
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 345 place count 166 transition count 239
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 36 rules applied. Total rules applied 381 place count 148 transition count 239
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 399 place count 148 transition count 221
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 50 rules applied. Total rules applied 449 place count 123 transition count 196
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 452 place count 123 transition count 193
Free-agglomeration rule applied 18 times.
Iterating global reduction 10 with 18 rules applied. Total rules applied 470 place count 123 transition count 175
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 37 rules applied. Total rules applied 507 place count 104 transition count 157
Applied a total of 507 rules in 52 ms. Remains 104 /312 variables (removed 208) and now considering 157/501 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 104/312 places, 157/501 transitions.
Incomplete random walk after 10000 steps, including 303 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 11:10:30] [INFO ] Flow matrix only has 148 transitions (discarded 9 similar events)
// Phase 1: matrix 148 rows 104 cols
[2023-03-22 11:10:30] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-22 11:10:30] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 11:10:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-22 11:10:30] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 11:10:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-22 11:10:30] [INFO ] After 17ms SMT Verify possible using 58 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 11:10:30] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 11:10:30] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 16 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 157/157 transitions.
Graph (trivial) has 61 edges and 104 vertex of which 2 / 104 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 0 with 8 rules applied. Total rules applied 9 place count 103 transition count 147
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 95 transition count 147
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 30 place count 82 transition count 134
Iterating global reduction 2 with 13 rules applied. Total rules applied 43 place count 82 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 82 transition count 133
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 66 place count 71 transition count 122
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 95 place count 71 transition count 93
Free-agglomeration rule applied 27 times.
Iterating global reduction 4 with 27 rules applied. Total rules applied 122 place count 71 transition count 66
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 89 edges and 44 vertex of which 39 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 53 rules applied. Total rules applied 175 place count 39 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 38 transition count 40
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 181 place count 33 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 182 place count 33 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 32 transition count 39
Applied a total of 183 rules in 14 ms. Remains 32 /104 variables (removed 72) and now considering 39/157 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 32/104 places, 39/157 transitions.
Finished random walk after 1377 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=459 )
FORMULA FlexibleBarrier-PT-20b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 41280 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 20b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart
GOT IT HERE. BS
Petri model created: 5372 places, 6193 transitions, 15575 arcs.
Final Score: 5826744.673
Took : 46 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-00 (reachable & potential(( ( (! ( (! ( (! ( ( ( 1 ) <= (tk(P3404)) ) & ( ( 1 ) <= (tk(P1766)) ) )) & ( ( 1 ) <= (tk(P5240)) ) )) & ( (tk(P1842)) <= ( 0 ) ) )) & ( ( 1 ) <= (tk(P3353)) ) ) & ( (tk(P1658)) <= ( 0 ) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-01 (reachable &!potential( (! ( ( ( (! ( ( ( ( 1 ) <= (tk(P5265)) ) | ( ( ( (tk(P2944)) <= (tk(P2862)) ) | ( (tk(P491)) <= ( 0 ) ) ) | ( ( (tk(P21)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1110)) ) ) ) ) | (! ( (tk(P5075)) <= (tk(P2833)) )) )) & ( ( ( ( (! ( (tk(P1152)) <= (tk(P818)) )) & ( ( 1 ) <= (tk(P771)) ) ) & ( ( (tk(P3535)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P1524)) ) | ( (tk(P1270)) <= (tk(P2853)) ) ) ) ) | ( (tk(P2576)) <= (tk(P2586)) ) ) & ( ( (! ( ( ( 1 ) <= (tk(P303)) ) & ( (tk(P4585)) <= (tk(P1459)) ) )) | ( (! ( (tk(P741)) <= ( 0 ) )) | ( ( 1 ) <= (tk(P1223)) ) ) ) & ( ( (tk(P4870)) <= ( 1 ) ) | ( ( ( ( 1 ) <= (tk(P1654)) ) | ( (tk(P1511)) <= ( 1 ) ) ) | ( ( (tk(P2441)) <= ( 1 ) ) | ( (tk(P1741)) <= ( 0 ) ) ) ) ) ) ) ) & ( (tk(P1366)) <= (tk(P4120)) ) ) & ( ( ( 1 ) <= (tk(P1548)) ) & ( (! ( ( ( ( ( ( 1 ) <= (tk(P1462)) ) | ( (tk(P2617)) <= (tk(P1654)) ) ) | ( (tk(P30)) <= (tk(P4852)) ) ) | ( (! ( (tk(P3212)) <= ( 1 ) )) | (! ( (tk(P1653)) <= (tk(P2504)) )) ) ) | ( ( ( (tk(P1084)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P2317)) ) ) & ( (! ( (tk(P32)) <= (tk(P4226)) )) & ( (tk(P3120)) <= (tk(P2459)) ) ) ) )) & ( (! ( (tk(P3229)) <= ( 0 ) )) | ( (! ( (tk(P5147)) <= ( 1 ) )) | ( ( ( 1 ) <= (tk(P3020)) ) | ( ( (tk(P2247)) <= (tk(P4681)) ) | ( ( ( 1 ) <= (tk(P4684)) ) | ( ( 1 ) <= (tk(P5146)) ) ) ) ) ) ) ) ) ))))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-02 (reachable & potential(( ( 1 ) <= (tk(P2592)) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-03 (reachable &!potential( ( ( (tk(P978)) <= (tk(P763)) ) | ( ( 1 ) <= (tk(P4670)) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-04 (reachable &!potential( ( ( (! ( ( 1 ) <= (tk(P2130)) )) | (! ( (tk(P3318)) <= (tk(P1611)) )) ) | ( (! ( ( (tk(P1085)) <= ( 0 ) ) | ( ( ( ( (! ( (tk(P5261)) <= (tk(P4302)) )) | ( ( (tk(P3439)) <= (tk(P1663)) ) & ( (tk(P380)) <= ( 0 ) ) ) ) | ( ( 1 ) <= (tk(P1145)) ) ) | ( ( (tk(P891)) <= (tk(P2308)) ) | (! ( ( ( 1 ) <= (tk(P642)) ) & ( ( 1 ) <= (tk(P3706)) ) )) ) ) & ( ( (tk(P341)) <= ( 1 ) ) & (! ( ( ( (tk(P1957)) <= (tk(P4145)) ) | ( (tk(P3811)) <= ( 0 ) ) ) | (! ( (tk(P278)) <= (tk(P2930)) )) )) ) ) )) & ( ( ( ( (tk(P2628)) <= ( 1 ) ) | ( (! ( ( ( (tk(P4605)) <= (tk(P2283)) ) | ( (tk(P3408)) <= (tk(P5118)) ) ) & ( (tk(P3704)) <= ( 0 ) ) )) | ( ( (tk(P1606)) <= (tk(P5299)) ) & ( ( ( (tk(P3495)) <= (tk(P3564)) ) & ( (tk(P853)) <= (tk(P1063)) ) ) | ( (tk(P2889)) <= ( 1 ) ) ) ) ) ) | ( (! ( ( ( (tk(P4022)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P5317)) ) ) & ( ( ( 1 ) <= (tk(P2813)) ) & ( (tk(P3351)) <= (tk(P1168)) ) ) )) | ( ( (tk(P3912)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P4864)) ) ) ) ) | ( ( (tk(P1732)) <= (tk(P2852)) ) & ( ( (tk(P3545)) <= (tk(P4017)) ) & ( ( (tk(P3511)) <= ( 0 ) ) & ( (tk(P2522)) <= (tk(P2410)) ) ) ) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-05 (reachable & potential(( ( ( 1 ) <= (tk(P1870)) ) & ( (! ( ( (tk(P4375)) <= ( 1 ) ) | ( ( ( 1 ) <= (tk(P879)) ) & (! ( ( (tk(P64)) <= (tk(P2023)) ) | ( ( 1 ) <= (tk(P2559)) ) )) ) )) | ( ( ( (! ( ( (tk(P4695)) <= ( 1 ) ) & ( ( (tk(P3187)) <= (tk(P4130)) ) & ( ( (tk(P1226)) <= (tk(P3)) ) | ( (tk(P605)) <= (tk(P949)) ) ) ) )) | ( (tk(P3532)) <= (tk(P1590)) ) ) | ( ( (tk(P3554)) <= ( 1 ) ) & ( ( (! ( (tk(P3599)) <= ( 0 ) )) | ( ( ( ( 1 ) <= (tk(P836)) ) & ( ( 1 ) <= (tk(P5099)) ) ) | ( ( ( 1 ) <= (tk(P476)) ) | ( ( 1 ) <= (tk(P2059)) ) ) ) ) | ( ( ( (tk(P912)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P2287)) )) ) & ( ( (tk(P2654)) <= (tk(P213)) ) & (! ( ( 1 ) <= (tk(P1827)) )) ) ) ) ) ) | ( ( (tk(P2348)) <= (tk(P5333)) ) | ( ( ( ( (tk(P868)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P3508)) ) ) & ( ( ( (tk(P2196)) <= (tk(P1698)) ) & ( (tk(P2437)) <= (tk(P4912)) ) ) | (! ( (tk(P89)) <= (tk(P1769)) )) ) ) | ( (! ( (tk(P4451)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P2615)) ) ) ) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-06 (reachable &!potential( ( ( ( 1 ) <= (tk(P877)) ) | ( ( ( ( ( (! ( ( ( 1 ) <= (tk(P3806)) ) & ( (tk(P3821)) <= ( 1 ) ) )) | ( ( (tk(P5188)) <= (tk(P4036)) ) | ( ( ( (tk(P2637)) <= ( 1 ) ) | ( (tk(P2336)) <= (tk(P2321)) ) ) | (! ( (tk(P3293)) <= (tk(P1465)) )) ) ) ) | ( ( ( (tk(P1522)) <= ( 1 ) ) & ( (tk(P2047)) <= ( 1 ) ) ) & ( (tk(P3594)) <= (tk(P5216)) ) ) ) & (! ( (! ( ( ( (tk(P5192)) <= ( 0 ) ) | ( (tk(P5180)) <= (tk(P3733)) ) ) | ( ( (tk(P320)) <= ( 0 ) ) | ( (tk(P2749)) <= ( 0 ) ) ) )) | ( (! ( ( 1 ) <= (tk(P3457)) )) | ( (tk(P398)) <= (tk(P4377)) ) ) )) ) | ( ( 1 ) <= (tk(P3405)) ) ) | ( ( (tk(P1503)) <= (tk(P3011)) ) & ( (tk(P2574)) <= ( 1 ) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-07 (reachable &!potential( (! ( ( (! ( ( ( (! ( ( 1 ) <= (tk(P4222)) )) | ( ( ( 1 ) <= (tk(P1582)) ) & ( (tk(P1992)) <= (tk(P3332)) ) ) ) | ( ( ( (tk(P1765)) <= (tk(P698)) ) & ( ( 1 ) <= (tk(P4651)) ) ) | ( (tk(P2453)) <= (tk(P4804)) ) ) ) | ( (tk(P1922)) <= (tk(P3100)) ) )) | ( (! ( (tk(P3878)) <= (tk(P3587)) )) & ( ( ( ( ( ( ( 1 ) <= (tk(P5249)) ) & ( ( 1 ) <= (tk(P4886)) ) ) | (! ( (tk(P4708)) <= (tk(P451)) )) ) & (! ( ( ( 1 ) <= (tk(P434)) ) | ( (tk(P3162)) <= (tk(P993)) ) )) ) | ( (! ( (tk(P1536)) <= ( 1 ) )) & ( ( ( (tk(P38)) <= (tk(P287)) ) | ( (tk(P4659)) <= (tk(P344)) ) ) & ( (tk(P1970)) <= (tk(P718)) ) ) ) ) | (! ( ( ( (tk(P1021)) <= ( 0 ) ) | ( ( (tk(P801)) <= (tk(P58)) ) & ( ( 1 ) <= (tk(P387)) ) ) ) | (! ( ( (tk(P5277)) <= ( 1 ) ) | ( (tk(P3222)) <= (tk(P609)) ) )) )) ) ) ) & (! ( ( 1 ) <= (tk(P3261)) )) ))))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-08 (reachable &!potential( ( ( ( (! ( ( (tk(P4106)) <= ( 0 ) ) & ( (tk(P3376)) <= (tk(P5026)) ) )) | (! ( ( (tk(P1343)) <= ( 0 ) ) | ( ( ( ( 1 ) <= (tk(P4108)) ) | ( ( (tk(P622)) <= ( 0 ) ) | ( (tk(P810)) <= ( 1 ) ) ) ) & (! ( ( 1 ) <= (tk(P2021)) )) ) )) ) & ( (! ( (! ( (tk(P5093)) <= ( 0 ) )) | ( (tk(P2461)) <= (tk(P535)) ) )) | ( ( ( (! ( ( ( (tk(P1584)) <= (tk(P5105)) ) | ( (tk(P3430)) <= ( 1 ) ) ) | ( ( (tk(P782)) <= ( 1 ) ) | ( (tk(P1540)) <= ( 0 ) ) ) )) & ( (! ( (tk(P1288)) <= (tk(P3543)) )) & ( (tk(P1220)) <= (tk(P3985)) ) ) ) | (! ( ( (tk(P3519)) <= ( 0 ) ) & ( (tk(P3484)) <= (tk(P4108)) ) )) ) & ( (! ( ( ( ( (tk(P2962)) <= ( 1 ) ) & ( (tk(P3353)) <= ( 0 ) ) ) & ( ( 1 ) <= (tk(P1453)) ) ) & ( (! ( (tk(P2739)) <= ( 1 ) )) | ( ( (tk(P4349)) <= (tk(P2484)) ) & ( (tk(P91)) <= ( 0 ) ) ) ) )) & (! ( (tk(P2166)) <= (tk(P4936)) )) ) ) ) ) | ( (tk(P5335)) <= (tk(P182)) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-09 (reachable &!potential( ( ( ( (tk(P3322)) <= (tk(P2179)) ) & ( (tk(P267)) <= ( 1 ) ) ) | ( ( ( (! ( (! ( (tk(P5070)) <= (tk(P3235)) )) & ( ( (tk(P843)) <= ( 1 ) ) | ( ( (tk(P5135)) <= (tk(P880)) ) & ( ( ( 1 ) <= (tk(P3066)) ) & ( (tk(P1373)) <= ( 0 ) ) ) ) ) )) | ( ( (tk(P4094)) <= (tk(P4287)) ) | (! ( ( (tk(P1051)) <= ( 0 ) ) & ( ( ( ( 1 ) <= (tk(P2603)) ) | ( (tk(P719)) <= ( 1 ) ) ) | ( (tk(P1578)) <= (tk(P1751)) ) ) )) ) ) & ( ( ( (! ( ( ( (tk(P4110)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1048)) ) ) & ( (tk(P4682)) <= ( 1 ) ) )) | (! ( ( (tk(P4917)) <= (tk(P2314)) ) & ( ( (tk(P172)) <= ( 0 ) ) & ( (tk(P2553)) <= ( 0 ) ) ) )) ) & ( (tk(P4593)) <= ( 0 ) ) ) | (! ( ( (tk(P3513)) <= ( 1 ) ) & ( (! ( (tk(P3495)) <= ( 1 ) )) | ( ( ( 1 ) <= (tk(P2138)) ) & (! ( (tk(P3920)) <= (tk(P728)) )) ) ) )) ) ) | ( ( ( ( ( (tk(P3741)) <= ( 1 ) ) & ( ( (! ( ( 1 ) <= (tk(P2446)) )) & ( ( (tk(P3793)) <= (tk(P3073)) ) & ( ( 1 ) <= (tk(P69)) ) ) ) & (! ( ( (tk(P2754)) <= ( 0 ) ) | ( (tk(P892)) <= ( 1 ) ) )) ) ) & ( (! ( (tk(P1241)) <= ( 0 ) )) | ( (tk(P1063)) <= (tk(P4920)) ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P2571)) ) & ( (tk(P1182)) <= (tk(P2600)) ) ) | (! ( ( 1 ) <= (tk(P2074)) )) ) & ( ( ( ( ( 1 ) <= (tk(P1731)) ) & ( (tk(P2567)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P4591)) ) ) | ( (tk(P389)) <= (tk(P1724)) ) ) ) & ( ( ( ( ( ( 1 ) <= (tk(P1636)) ) | ( (tk(P478)) <= (tk(P1452)) ) ) | ( (tk(P3004)) <= ( 1 ) ) ) | ( ( ( (tk(P1728)) <= ( 0 ) ) & ( (tk(P649)) <= ( 1 ) ) ) | (! ( (tk(P3102)) <= (tk(P5158)) )) ) ) | ( ( ( ( (tk(P4245)) <= (tk(P3874)) ) & ( (tk(P400)) <= ( 0 ) ) ) & ( (tk(P72)) <= (tk(P4435)) ) ) | (! ( ( ( 1 ) <= (tk(P1393)) ) | ( ( 1 ) <= (tk(P3614)) ) )) ) ) ) ) & ( ( ( ( ( 1 ) <= (tk(P1372)) ) & ( ( 1 ) <= (tk(P4507)) ) ) & ( (! ( (tk(P5192)) <= (tk(P26)) )) | (! ( (tk(P2842)) <= ( 0 ) )) ) ) | (! ( ( (! ( ( 1 ) <= (tk(P257)) )) | ( (tk(P3034)) <= (tk(P1993)) ) ) | ( ( (tk(P3671)) <= (tk(P1780)) ) & ( ( 1 ) <= (tk(P2135)) ) ) )) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-10 (reachable &!potential( ( ( (tk(P3217)) <= (tk(P2581)) ) & ( ( ( ( (tk(P662)) <= (tk(P113)) ) & (! ( ( 1 ) <= (tk(P4920)) )) ) | (! ( (! ( ( (tk(P5122)) <= ( 0 ) ) | ( (tk(P5068)) <= (tk(P2772)) ) )) | ( (! ( (tk(P1686)) <= (tk(P4461)) )) & ( ( (tk(P1201)) <= ( 0 ) ) & ( ( ( (tk(P4689)) <= (tk(P279)) ) | ( ( 1 ) <= (tk(P2538)) ) ) | ( ( ( 1 ) <= (tk(P1111)) ) | ( (tk(P1727)) <= (tk(P58)) ) ) ) ) ) )) ) & ( ( (tk(P714)) <= ( 0 ) ) | ( (! ( (tk(P4237)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P975)) )) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-11 (reachable & potential(( ( ( (! ( ( (tk(P926)) <= (tk(P5175)) ) & ( ( (tk(P1092)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P124)) ) ) )) & ( ( (! ( ( ( ( ( 1 ) <= (tk(P533)) ) & ( ( 1 ) <= (tk(P947)) ) ) | ( ( (tk(P4917)) <= ( 1 ) ) | ( (tk(P1878)) <= ( 0 ) ) ) ) | ( (! ( ( 1 ) <= (tk(P4112)) )) | ( ( (tk(P4235)) <= (tk(P4510)) ) & ( ( 1 ) <= (tk(P3013)) ) ) ) )) & ( (tk(P960)) <= (tk(P1395)) ) ) | (! ( ( 1 ) <= (tk(P2713)) )) ) ) | ( ( ( (tk(P3568)) <= (tk(P534)) ) & ( (! ( ( ( ( (tk(P4621)) <= (tk(P4776)) ) | ( ( 1 ) <= (tk(P1796)) ) ) | (! ( (tk(P537)) <= (tk(P3429)) )) ) & ( ( ( (tk(P3172)) <= ( 0 ) ) | ( (tk(P1467)) <= ( 0 ) ) ) | ( ( ( 1 ) <= (tk(P592)) ) & ( (tk(P4111)) <= ( 0 ) ) ) ) )) | ( (tk(P1464)) <= ( 0 ) ) ) ) & ( (! ( ( 1 ) <= (tk(P3548)) )) | (! ( (! ( ( ( (tk(P478)) <= ( 1 ) ) | ( (tk(P4979)) <= ( 0 ) ) ) | ( ( (tk(P165)) <= (tk(P2665)) ) | ( (tk(P1295)) <= ( 1 ) ) ) )) & ( ( ( ( (tk(P1716)) <= (tk(P516)) ) | ( (tk(P4303)) <= (tk(P5264)) ) ) | ( ( (tk(P3001)) <= ( 1 ) ) & ( (tk(P3800)) <= ( 1 ) ) ) ) & ( (tk(P5225)) <= ( 1 ) ) ) )) ) ) ) & ( ( 1 ) <= (tk(P5162)) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-12 (reachable & potential(( ( (! ( ( ( (! ( ( ( 1 ) <= (tk(P1194)) ) | ( ( 1 ) <= (tk(P2338)) ) )) | (! ( ( 1 ) <= (tk(P4924)) )) ) | (! ( ( ( (tk(P1934)) <= (tk(P5033)) ) & ( (tk(P337)) <= ( 1 ) ) ) | ( ( 1 ) <= (tk(P3114)) ) )) ) | ( ( (! ( (! ( ( 1 ) <= (tk(P5245)) )) & ( ( ( 1 ) <= (tk(P2806)) ) & ( ( 1 ) <= (tk(P5361)) ) ) )) & ( (! ( ( (tk(P2876)) <= (tk(P5211)) ) & ( (tk(P155)) <= ( 1 ) ) )) & ( ( ( (tk(P5366)) <= ( 1 ) ) | ( (tk(P5190)) <= (tk(P5023)) ) ) | ( ( 1 ) <= (tk(P3057)) ) ) ) ) & ( ( ( (tk(P2633)) <= ( 0 ) ) | ( (! ( (tk(P3470)) <= ( 1 ) )) | ( (tk(P3820)) <= ( 0 ) ) ) ) & (! ( ( 1 ) <= (tk(P712)) )) ) ) )) | ( (tk(P926)) <= ( 0 ) ) ) & ( ( (! ( ( (tk(P161)) <= ( 0 ) ) & ( ( (! ( (tk(P1938)) <= (tk(P4946)) )) | ( (! ( (tk(P2251)) <= ( 0 ) )) & ( ( 1 ) <= (tk(P566)) ) ) ) | (! ( ( ( ( 1 ) <= (tk(P385)) ) | ( ( 1 ) <= (tk(P1727)) ) ) & ( (tk(P341)) <= (tk(P5013)) ) )) ) )) | (! ( (tk(P2882)) <= (tk(P810)) )) ) & (! ( ( ( ( ( ( 1 ) <= (tk(P4630)) ) | (! ( (tk(P1170)) <= ( 1 ) )) ) & ( (tk(P3201)) <= ( 0 ) ) ) & ( ( ( ( (tk(P3455)) <= (tk(P4927)) ) & ( (tk(P3731)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P4009)) ) ) | ( ( ( ( 1 ) <= (tk(P4529)) ) & ( (tk(P1761)) <= (tk(P3090)) ) ) & ( ( (tk(P1678)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P1492)) ) ) ) ) ) | ( ( (tk(P3142)) <= (tk(P4239)) ) | (! ( ( (tk(P4006)) <= (tk(P2319)) ) & ( ( (tk(P3619)) <= ( 0 ) ) & ( (tk(P4811)) <= ( 0 ) ) ) )) ) )) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-13 (reachable & potential(( ( (! ( ( (tk(P2887)) <= (tk(P3376)) ) | ( ( (tk(P5262)) <= (tk(P2985)) ) & ( ( 1 ) <= (tk(P2586)) ) ) )) & ( ( 1 ) <= (tk(P5176)) ) ) & ( ( ( (! ( (! ( ( (tk(P597)) <= (tk(P2974)) ) & ( ( 1 ) <= (tk(P127)) ) )) & (! ( (tk(P3566)) <= (tk(P4352)) )) )) & ( (tk(P570)) <= (tk(P4249)) ) ) & ( ( ( 1 ) <= (tk(P1415)) ) | (! ( (tk(P1697)) <= (tk(P1966)) )) ) ) & (! ( ( ( ( (tk(P719)) <= (tk(P1983)) ) | (! ( ( (tk(P2591)) <= (tk(P2439)) ) & ( ( 1 ) <= (tk(P1546)) ) )) ) & ( (! ( ( ( (tk(P135)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P2682)) ) ) | ( (tk(P2428)) <= (tk(P4805)) ) )) & ( ( 1 ) <= (tk(P2304)) ) ) ) & ( ( 1 ) <= (tk(P2853)) ) )) ) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-14 (reachable & potential(( ( 1 ) <= (tk(P1212)) )))
PROPERTY: FlexibleBarrier-PT-20b-ReachabilityCardinality-15 (reachable &!potential( ( (tk(P1086)) <= ( 0 ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14730836 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101600 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.
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="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is FlexibleBarrier-PT-20b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r171-tall-167838858800582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;