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.r019-oct2-167813607500288.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-06b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r019-oct2-167813607500288
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 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 134K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678896185601

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutoFlight-PT-06b
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202303021504
[2023-03-15 16:03:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 16:03:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:03:08] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-15 16:03:08] [INFO ] Transformed 574 places.
[2023-03-15 16:03:08] [INFO ] Transformed 572 transitions.
[2023-03-15 16:03:08] [INFO ] Found NUPN structural information;
[2023-03-15 16:03:08] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 207 ms.
Structural test allowed to assert that 341 places are NOT stable. Took 22 ms.
[2023-03-15 16:03:09] [INFO ] Flatten gal took : 96 ms
[2023-03-15 16:03:09] [INFO ] Flatten gal took : 40 ms
[2023-03-15 16:03:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16480565916665434929.gal : 16 ms
[2023-03-15 16:03:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1620339001670452204.prop : 1 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/ReachabilityCardinality16480565916665434929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1620339001670452204.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1620339001670452204.prop.
Incomplete random walk after 10000 steps, including 35 resets, run finished after 765 ms. (steps per millisecond=13 ) properties (out of 233) seen :76
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
SDD proceeding with computation,233 properties remain. new max is 4
SDD size :1 after 3
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
SDD proceeding with computation,233 properties remain. new max is 8
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
SDD size :3 after 8
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=100 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 157) seen :0
Running SMT prover for 157 properties.
// Phase 1: matrix 572 rows 574 cols
SDD proceeding with computation,233 properties remain. new max is 16
SDD size :8 after 17
[2023-03-15 16:03:09] [INFO ] Computed 40 place invariants in 35 ms
SDD proceeding with computation,233 properties remain. new max is 32
SDD size :17 after 34
SDD proceeding with computation,233 properties remain. new max is 64
SDD size :34 after 81
SDD proceeding with computation,233 properties remain. new max is 128
SDD size :81 after 22135
SDD proceeding with computation,233 properties remain. new max is 256
SDD size :22135 after 4.29942e+09
SDD proceeding with computation,233 properties remain. new max is 512
SDD size :4.29942e+09 after 5.60913e+20
SDD proceeding with computation,233 properties remain. new max is 1024
SDD size :5.60913e+20 after 8.03157e+31
[2023-03-15 16:03:13] [INFO ] After 3374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:157
[2023-03-15 16:03:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 48 ms returned sat
[2023-03-15 16:03:15] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-15 16:03:25] [INFO ] After 6635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :157
[2023-03-15 16:03:25] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 8 ms to minimize.
[2023-03-15 16:03:26] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 1 ms to minimize.
[2023-03-15 16:03:26] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2023-03-15 16:03:26] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 0 ms to minimize.
[2023-03-15 16:03:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 739 ms
[2023-03-15 16:03:26] [INFO ] Deduced a trap composed of 64 places in 144 ms of which 1 ms to minimize.
[2023-03-15 16:03:26] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 0 ms to minimize.
[2023-03-15 16:03:26] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 0 ms to minimize.
[2023-03-15 16:03:26] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 1 ms to minimize.
[2023-03-15 16:03:27] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 0 ms to minimize.
[2023-03-15 16:03:27] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
[2023-03-15 16:03:27] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 0 ms to minimize.
[2023-03-15 16:03:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 979 ms
[2023-03-15 16:03:27] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2023-03-15 16:03:27] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 1 ms to minimize.
[2023-03-15 16:03:27] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 1 ms to minimize.
[2023-03-15 16:03:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 418 ms
[2023-03-15 16:03:28] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 1 ms to minimize.
[2023-03-15 16:03:28] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 0 ms to minimize.
[2023-03-15 16:03:28] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 0 ms to minimize.
[2023-03-15 16:03:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 372 ms
[2023-03-15 16:03:28] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2023-03-15 16:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-15 16:03:29] [INFO ] Deduced a trap composed of 95 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:03:29] [INFO ] Deduced a trap composed of 88 places in 149 ms of which 1 ms to minimize.
[2023-03-15 16:03:29] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 0 ms to minimize.
[2023-03-15 16:03:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 595 ms
[2023-03-15 16:03:29] [INFO ] Deduced a trap composed of 96 places in 192 ms of which 1 ms to minimize.
[2023-03-15 16:03:30] [INFO ] Deduced a trap composed of 81 places in 173 ms of which 1 ms to minimize.
[2023-03-15 16:03:30] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 1 ms to minimize.
[2023-03-15 16:03:30] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 0 ms to minimize.
[2023-03-15 16:03:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 824 ms
[2023-03-15 16:03:30] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 1 ms to minimize.
[2023-03-15 16:03:30] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 0 ms to minimize.
[2023-03-15 16:03:31] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 0 ms to minimize.
[2023-03-15 16:03:31] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 1 ms to minimize.
[2023-03-15 16:03:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 760 ms
[2023-03-15 16:03:31] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 1 ms to minimize.
[2023-03-15 16:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-15 16:03:33] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 1 ms to minimize.
[2023-03-15 16:03:33] [INFO ] Deduced a trap composed of 84 places in 160 ms of which 0 ms to minimize.
[2023-03-15 16:03:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2023-03-15 16:03:34] [INFO ] Deduced a trap composed of 87 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:03:34] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 1 ms to minimize.
[2023-03-15 16:03:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 447 ms
[2023-03-15 16:03:35] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:03:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-15 16:03:36] [INFO ] Deduced a trap composed of 84 places in 241 ms of which 0 ms to minimize.
[2023-03-15 16:03:36] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 0 ms to minimize.
[2023-03-15 16:03:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-03-15 16:03:36] [INFO ] Deduced a trap composed of 124 places in 184 ms of which 1 ms to minimize.
[2023-03-15 16:03:36] [INFO ] Deduced a trap composed of 80 places in 244 ms of which 2 ms to minimize.
[2023-03-15 16:03:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 546 ms
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.refineResultsWithTraps(DeadlockTester.java:722)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 16:03:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:03:38] [INFO ] After 25037ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:157
Fused 157 Parikh solutions to 155 different solutions.
Parikh walk visited 156 properties in 30046 ms.
Support contains 1 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 574 transition count 346
Reduce places removed 226 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 268 rules applied. Total rules applied 494 place count 348 transition count 304
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 506 place count 336 transition count 304
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 506 place count 336 transition count 226
Deduced a syphon composed of 78 places in 2 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 662 place count 258 transition count 226
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 717 place count 203 transition count 171
Iterating global reduction 3 with 55 rules applied. Total rules applied 772 place count 203 transition count 171
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 772 place count 203 transition count 153
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 808 place count 185 transition count 153
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 898 place count 140 transition count 108
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 922 place count 140 transition count 84
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 946 place count 116 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 947 place count 115 transition count 83
Reduce places removed 24 places and 0 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 64 rules applied. Total rules applied 1011 place count 91 transition count 43
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 1051 place count 51 transition count 43
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 1051 place count 51 transition count 29
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 1079 place count 37 transition count 29
Applied a total of 1079 rules in 116 ms. Remains 37 /574 variables (removed 537) and now considering 29/572 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 37/574 places, 29/572 transitions.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
Able to resolve query StableMarking after proving 234 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 60094 ms.

BK_STOP 1678896249247

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-06b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is AutoFlight-PT-06b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r019-oct2-167813607500288"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;