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.r005-oct2-167813593200478.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 itstools
Input is AutoFlight-PT-12b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593200478
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.6K Feb 25 18:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 18:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 18:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 18:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 18:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 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 266K 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 AutoFlight-PT-12b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-12b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678515583577

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-12b
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-11 06:19:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 06:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 06:19:46] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2023-03-11 06:19:46] [INFO ] Transformed 1126 places.
[2023-03-11 06:19:46] [INFO ] Transformed 1124 transitions.
[2023-03-11 06:19:46] [INFO ] Found NUPN structural information;
[2023-03-11 06:19:46] [INFO ] Parsed PT model containing 1126 places and 1124 transitions and 2618 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 06:19:47] [INFO ] Flatten gal took : 192 ms
[2023-03-11 06:19:47] [INFO ] Flatten gal took : 103 ms
[2023-03-11 06:19:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14597804522104015855.gal : 30 ms
[2023-03-11 06:19:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5562465640674672571.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14597804522104015855.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5562465640674672571.prop' '--nowitness' '--gen-order' 'FOLLOW'
Incomplete random walk after 10000 steps, including 18 resets, run finished after 716 ms. (steps per millisecond=13 ) properties (out of 16) seen :4
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Loading property file /tmp/ReachabilityCardinality5562465640674672571.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1124 rows 1126 cols
[2023-03-11 06:19:48] [INFO ] Computed 76 place invariants in 27 ms
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :3 after 8
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :8 after 17
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :34 after 68
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :68 after 511
[2023-03-11 06:19:48] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :511 after 8.77433e+07
[2023-03-11 06:19:49] [INFO ] [Nat]Absence check using 75 positive place invariants in 30 ms returned sat
[2023-03-11 06:19:49] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-11 06:19:50] [INFO ] After 1409ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-11 06:19:51] [INFO ] Deduced a trap composed of 38 places in 414 ms of which 7 ms to minimize.
[2023-03-11 06:19:51] [INFO ] Deduced a trap composed of 65 places in 309 ms of which 14 ms to minimize.
[2023-03-11 06:19:52] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2023-03-11 06:19:52] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 1 ms to minimize.
[2023-03-11 06:19:52] [INFO ] Deduced a trap composed of 15 places in 248 ms of which 1 ms to minimize.
[2023-03-11 06:19:52] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2023-03-11 06:19:53] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 1 ms to minimize.
[2023-03-11 06:19:53] [INFO ] Deduced a trap composed of 77 places in 206 ms of which 1 ms to minimize.
[2023-03-11 06:19:53] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 1 ms to minimize.
[2023-03-11 06:19:53] [INFO ] Deduced a trap composed of 126 places in 226 ms of which 6 ms to minimize.
[2023-03-11 06:19:54] [INFO ] Deduced a trap composed of 60 places in 249 ms of which 1 ms to minimize.
[2023-03-11 06:19:54] [INFO ] Deduced a trap composed of 61 places in 229 ms of which 0 ms to minimize.
[2023-03-11 06:19:54] [INFO ] Deduced a trap composed of 62 places in 299 ms of which 4 ms to minimize.
[2023-03-11 06:19:55] [INFO ] Deduced a trap composed of 122 places in 308 ms of which 3 ms to minimize.
[2023-03-11 06:19:55] [INFO ] Deduced a trap composed of 79 places in 326 ms of which 3 ms to minimize.
[2023-03-11 06:19:55] [INFO ] Deduced a trap composed of 85 places in 345 ms of which 1 ms to minimize.
[2023-03-11 06:19:56] [INFO ] Deduced a trap composed of 94 places in 397 ms of which 0 ms to minimize.
[2023-03-11 06:19:56] [INFO ] Deduced a trap composed of 75 places in 337 ms of which 0 ms to minimize.
[2023-03-11 06:19:56] [INFO ] Deduced a trap composed of 131 places in 256 ms of which 1 ms to minimize.
[2023-03-11 06:19:57] [INFO ] Deduced a trap composed of 136 places in 270 ms of which 0 ms to minimize.
[2023-03-11 06:19:57] [INFO ] Deduced a trap composed of 83 places in 363 ms of which 0 ms to minimize.
[2023-03-11 06:19:58] [INFO ] Deduced a trap composed of 77 places in 333 ms of which 14 ms to minimize.
[2023-03-11 06:19:58] [INFO ] Deduced a trap composed of 32 places in 424 ms of which 1 ms to minimize.
[2023-03-11 06:19:58] [INFO ] Deduced a trap composed of 92 places in 244 ms of which 1 ms to minimize.
[2023-03-11 06:19:59] [INFO ] Deduced a trap composed of 107 places in 254 ms of which 0 ms to minimize.
[2023-03-11 06:19:59] [INFO ] Deduced a trap composed of 68 places in 326 ms of which 0 ms to minimize.
[2023-03-11 06:19:59] [INFO ] Deduced a trap composed of 81 places in 392 ms of which 2 ms to minimize.
[2023-03-11 06:20:00] [INFO ] Deduced a trap composed of 132 places in 313 ms of which 1 ms to minimize.
[2023-03-11 06:20:00] [INFO ] Deduced a trap composed of 108 places in 259 ms of which 1 ms to minimize.
[2023-03-11 06:20:00] [INFO ] Deduced a trap composed of 89 places in 330 ms of which 1 ms to minimize.
[2023-03-11 06:20:01] [INFO ] Deduced a trap composed of 70 places in 282 ms of which 14 ms to minimize.
[2023-03-11 06:20:01] [INFO ] Deduced a trap composed of 95 places in 312 ms of which 1 ms to minimize.
[2023-03-11 06:20:01] [INFO ] Deduced a trap composed of 183 places in 251 ms of which 1 ms to minimize.
[2023-03-11 06:20:02] [INFO ] Deduced a trap composed of 90 places in 220 ms of which 10 ms to minimize.
[2023-03-11 06:20:02] [INFO ] Deduced a trap composed of 186 places in 203 ms of which 0 ms to minimize.
[2023-03-11 06:20:02] [INFO ] Deduced a trap composed of 114 places in 221 ms of which 0 ms to minimize.
[2023-03-11 06:20:03] [INFO ] Deduced a trap composed of 181 places in 256 ms of which 1 ms to minimize.
[2023-03-11 06:20:03] [INFO ] Deduced a trap composed of 117 places in 242 ms of which 0 ms to minimize.
[2023-03-11 06:20:03] [INFO ] Deduced a trap composed of 100 places in 287 ms of which 1 ms to minimize.
[2023-03-11 06:20:03] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 12861 ms
[2023-03-11 06:20:04] [INFO ] Deduced a trap composed of 68 places in 227 ms of which 1 ms to minimize.
[2023-03-11 06:20:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2023-03-11 06:20:04] [INFO ] Deduced a trap composed of 20 places in 410 ms of which 1 ms to minimize.
[2023-03-11 06:20:05] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 1 ms to minimize.
[2023-03-11 06:20:05] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 0 ms to minimize.
[2023-03-11 06:20:05] [INFO ] Deduced a trap composed of 30 places in 318 ms of which 0 ms to minimize.
[2023-03-11 06:20:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1419 ms
[2023-03-11 06:20:06] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 1 ms to minimize.
[2023-03-11 06:20:07] [INFO ] Deduced a trap composed of 71 places in 765 ms of which 1 ms to minimize.
[2023-03-11 06:20:07] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 2 ms to minimize.
[2023-03-11 06:20:07] [INFO ] Deduced a trap composed of 92 places in 228 ms of which 1 ms to minimize.
[2023-03-11 06:20:08] [INFO ] Deduced a trap composed of 77 places in 256 ms of which 0 ms to minimize.
[2023-03-11 06:20:08] [INFO ] Deduced a trap composed of 86 places in 434 ms of which 0 ms to minimize.
[2023-03-11 06:20:08] [INFO ] Deduced a trap composed of 62 places in 212 ms of which 1 ms to minimize.
[2023-03-11 06:20:09] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 1 ms to minimize.
[2023-03-11 06:20:09] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 0 ms to minimize.
[2023-03-11 06:20:09] [INFO ] Deduced a trap composed of 126 places in 241 ms of which 0 ms to minimize.
[2023-03-11 06:20:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3719 ms
[2023-03-11 06:20:10] [INFO ] Deduced a trap composed of 193 places in 248 ms of which 1 ms to minimize.
[2023-03-11 06:20:10] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 22 ms to minimize.
[2023-03-11 06:20:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 714 ms
[2023-03-11 06:20:10] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 0 ms to minimize.
[2023-03-11 06:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 277 ms
[2023-03-11 06:20:11] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 1 ms to minimize.
[2023-03-11 06:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 308 ms
[2023-03-11 06:20:11] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 0 ms to minimize.
[2023-03-11 06:20:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-11 06:20:11] [INFO ] Deduced a trap composed of 30 places in 322 ms of which 1 ms to minimize.
[2023-03-11 06:20:12] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 0 ms to minimize.
[2023-03-11 06:20:12] [INFO ] Deduced a trap composed of 61 places in 244 ms of which 1 ms to minimize.
[2023-03-11 06:20:12] [INFO ] Deduced a trap composed of 63 places in 254 ms of which 1 ms to minimize.
[2023-03-11 06:20:13] [INFO ] Deduced a trap composed of 122 places in 214 ms of which 14 ms to minimize.
[2023-03-11 06:20:13] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 1 ms to minimize.
[2023-03-11 06:20:13] [INFO ] Deduced a trap composed of 50 places in 248 ms of which 0 ms to minimize.
[2023-03-11 06:20:14] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 0 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-11 06:20:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 06:20:14] [INFO ] After 25225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 168 ms.
Support contains 46 out of 1126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1126/1126 places, 1124/1124 transitions.
Drop transitions removed 404 transitions
Trivial Post-agglo rules discarded 404 transitions
Performed 404 trivial Post agglomeration. Transition count delta: 404
Iterating post reduction 0 with 404 rules applied. Total rules applied 404 place count 1126 transition count 720
Reduce places removed 404 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 470 rules applied. Total rules applied 874 place count 722 transition count 654
Reduce places removed 17 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 30 rules applied. Total rules applied 904 place count 705 transition count 641
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 17 rules applied. Total rules applied 921 place count 692 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 922 place count 691 transition count 637
Performed 133 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 133 Pre rules applied. Total rules applied 922 place count 691 transition count 504
Deduced a syphon composed of 133 places in 2 ms
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 5 with 266 rules applied. Total rules applied 1188 place count 558 transition count 504
Discarding 98 places :
Symmetric choice reduction at 5 with 98 rule applications. Total rules 1286 place count 460 transition count 406
Iterating global reduction 5 with 98 rules applied. Total rules applied 1384 place count 460 transition count 406
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1387 place count 460 transition count 403
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 28 Pre rules applied. Total rules applied 1387 place count 460 transition count 375
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 1443 place count 432 transition count 375
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 196 rules applied. Total rules applied 1639 place count 334 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1641 place count 333 transition count 277
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1645 place count 333 transition count 273
Free-agglomeration rule applied 45 times.
Iterating global reduction 6 with 45 rules applied. Total rules applied 1690 place count 333 transition count 228
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 6 with 45 rules applied. Total rules applied 1735 place count 288 transition count 228
Applied a total of 1735 rules in 241 ms. Remains 288 /1126 variables (removed 838) and now considering 228/1124 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 288/1126 places, 228/1124 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 8) seen :5
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 228 rows 288 cols
[2023-03-11 06:20:14] [INFO ] Computed 76 place invariants in 10 ms
[2023-03-11 06:20:15] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 06:20:15] [INFO ] [Nat]Absence check using 74 positive place invariants in 30 ms returned sat
[2023-03-11 06:20:15] [INFO ] [Nat]Absence check using 74 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-11 06:20:15] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 06:20:15] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-11 06:20:15] [INFO ] After 44ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 06:20:15] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 2 ms to minimize.
[2023-03-11 06:20:15] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 25 ms to minimize.
[2023-03-11 06:20:15] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 19 ms to minimize.
[2023-03-11 06:20:15] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 11 ms to minimize.
[2023-03-11 06:20:15] [INFO ] Deduced a trap composed of 94 places in 72 ms of which 1 ms to minimize.
[2023-03-11 06:20:15] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-11 06:20:16] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 0 ms to minimize.
[2023-03-11 06:20:16] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 4 ms to minimize.
[2023-03-11 06:20:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 907 ms
[2023-03-11 06:20:16] [INFO ] After 972ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-11 06:20:16] [INFO ] After 1203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 228/228 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 21 place count 288 transition count 207
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 267 transition count 207
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 42 place count 267 transition count 195
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 66 place count 255 transition count 195
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 254 transition count 194
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 254 transition count 194
Performed 30 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 128 place count 224 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 224 transition count 162
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 224 transition count 156
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 141 place count 218 transition count 156
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 217 transition count 155
Reduce places removed 53 places and 0 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 4 with 142 rules applied. Total rules applied 284 place count 164 transition count 66
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 90 rules applied. Total rules applied 374 place count 75 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 375 place count 74 transition count 65
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 375 place count 74 transition count 44
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 417 place count 53 transition count 44
Applied a total of 417 rules in 108 ms. Remains 53 /288 variables (removed 235) and now considering 44/228 (removed 184) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 53/288 places, 44/228 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA AutoFlight-PT-12b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 29722 ms.

BK_STOP 1678515616953

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="AutoFlight-PT-12b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is AutoFlight-PT-12b, 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 r005-oct2-167813593200478"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-12b.tgz
mv AutoFlight-PT-12b 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;