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.r389-oct2-167903713600510.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 ShieldPPPs-PT-050B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713600510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 888K Mar 5 18:23 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 ShieldPPPs-PT-050B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679209639546

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=ShieldPPPs-PT-050B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 07:07:22] [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-19 07:07:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:07:22] [INFO ] Load time of PNML (sax parser for PT used): 195 ms
[2023-03-19 07:07:23] [INFO ] Transformed 3403 places.
[2023-03-19 07:07:23] [INFO ] Transformed 3153 transitions.
[2023-03-19 07:07:23] [INFO ] Found NUPN structural information;
[2023-03-19 07:07:23] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 786 ms. (steps per millisecond=12 ) properties (out of 14) seen :6
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-19 07:07:24] [INFO ] Flatten gal took : 394 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
[2023-03-19 07:07:24] [INFO ] Flatten gal took : 162 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
[2023-03-19 07:07:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12633388355102644441.gal : 106 ms
[2023-03-19 07:07:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4935898062460830116.prop : 1 ms
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
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/ReachabilityCardinality12633388355102644441.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4935898062460830116.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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-19 07:07:24] [INFO ] Computed 551 place invariants in 40 ms
Loading property file /tmp/ReachabilityCardinality4935898062460830116.prop.
[2023-03-19 07:07:25] [INFO ] After 1116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 07:07:28] [INFO ] [Nat]Absence check using 551 positive place invariants in 664 ms returned sat
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :36 after 82
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :82 after 432
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :432 after 616
Invariant property ShieldPPPs-PT-050B-ReachabilityCardinality-09 does not hold.
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :616 after 1.09756e+08
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :1.09756e+08 after 1.0281e+11
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :1.0281e+11 after 1.86416e+19
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :1.86416e+19 after 2.19414e+38
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :2.19414e+38 after 2.12232e+74
[2023-03-19 07:07:39] [INFO ] After 10680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 07:07:44] [INFO ] Deduced a trap composed of 27 places in 1679 ms of which 21 ms to minimize.
[2023-03-19 07:07:45] [INFO ] Deduced a trap composed of 14 places in 1314 ms of which 4 ms to minimize.
[2023-03-19 07:07:47] [INFO ] Deduced a trap composed of 23 places in 1300 ms of which 26 ms to minimize.
[2023-03-19 07:07:48] [INFO ] Deduced a trap composed of 23 places in 1379 ms of which 12 ms to minimize.
[2023-03-19 07:07:50] [INFO ] Deduced a trap composed of 26 places in 1308 ms of which 3 ms to minimize.
[2023-03-19 07:07:51] [INFO ] Deduced a trap composed of 31 places in 1212 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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-19 07:07:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:07:51] [INFO ] After 25675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1399 ms.
Support contains 86 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 323 transitions
Trivial Post-agglo rules discarded 323 transitions
Performed 323 trivial Post agglomeration. Transition count delta: 323
Iterating post reduction 0 with 323 rules applied. Total rules applied 323 place count 3403 transition count 2830
Reduce places removed 323 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 335 rules applied. Total rules applied 658 place count 3080 transition count 2818
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 670 place count 3068 transition count 2818
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 670 place count 3068 transition count 2569
Deduced a syphon composed of 249 places in 7 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 1168 place count 2819 transition count 2569
Discarding 324 places :
Symmetric choice reduction at 3 with 324 rule applications. Total rules 1492 place count 2495 transition count 2245
Iterating global reduction 3 with 324 rules applied. Total rules applied 1816 place count 2495 transition count 2245
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 132 Pre rules applied. Total rules applied 1816 place count 2495 transition count 2113
Deduced a syphon composed of 132 places in 15 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 2080 place count 2363 transition count 2113
Performed 711 Post agglomeration using F-continuation condition.Transition count delta: 711
Deduced a syphon composed of 711 places in 6 ms
Reduce places removed 711 places and 0 transitions.
Iterating global reduction 3 with 1422 rules applied. Total rules applied 3502 place count 1652 transition count 1402
Partial Free-agglomeration rule applied 418 times.
Drop transitions removed 418 transitions
Iterating global reduction 3 with 418 rules applied. Total rules applied 3920 place count 1652 transition count 1402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3921 place count 1651 transition count 1401
Applied a total of 3921 rules in 1109 ms. Remains 1651 /3403 variables (removed 1752) and now considering 1401/3153 (removed 1752) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1111 ms. Remains : 1651/3403 places, 1401/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=27 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 75541 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75541 steps, saw 69627 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1401 rows 1651 cols
[2023-03-19 07:07:57] [INFO ] Computed 551 place invariants in 60 ms
[2023-03-19 07:07:58] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 07:07:58] [INFO ] [Nat]Absence check using 525 positive place invariants in 251 ms returned sat
[2023-03-19 07:07:58] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 8 ms returned sat
[2023-03-19 07:08:01] [INFO ] After 2389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 07:08:03] [INFO ] Deduced a trap composed of 5 places in 390 ms of which 1 ms to minimize.
[2023-03-19 07:08:03] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 0 ms to minimize.
[2023-03-19 07:08:04] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 3 ms to minimize.
[2023-03-19 07:08:04] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 2 ms to minimize.
[2023-03-19 07:08:05] [INFO ] Deduced a trap composed of 8 places in 353 ms of which 1 ms to minimize.
[2023-03-19 07:08:05] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 1 ms to minimize.
[2023-03-19 07:08:05] [INFO ] Deduced a trap composed of 7 places in 254 ms of which 1 ms to minimize.
[2023-03-19 07:08:06] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 0 ms to minimize.
[2023-03-19 07:08:06] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 1 ms to minimize.
[2023-03-19 07:08:06] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 1 ms to minimize.
[2023-03-19 07:08:07] [INFO ] Deduced a trap composed of 9 places in 433 ms of which 1 ms to minimize.
[2023-03-19 07:08:07] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 0 ms to minimize.
[2023-03-19 07:08:08] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-19 07:08:08] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 1 ms to minimize.
[2023-03-19 07:08:08] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-19 07:08:09] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 0 ms to minimize.
[2023-03-19 07:08:09] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2023-03-19 07:08:09] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2023-03-19 07:08:10] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 0 ms to minimize.
[2023-03-19 07:08:10] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-19 07:08:10] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 1 ms to minimize.
[2023-03-19 07:08:12] [INFO ] Deduced a trap composed of 9 places in 1253 ms of which 1 ms to minimize.
[2023-03-19 07:08:15] [INFO ] Deduced a trap composed of 6 places in 2789 ms of which 27 ms to minimize.
[2023-03-19 07:08:15] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 20 ms to minimize.
[2023-03-19 07:08:15] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 1 ms to minimize.
[2023-03-19 07:08:16] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 0 ms to minimize.
[2023-03-19 07:08:16] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 1 ms to minimize.
[2023-03-19 07:08:16] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 3 ms to minimize.
[2023-03-19 07:08:17] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 1 ms to minimize.
[2023-03-19 07:08:18] [INFO ] Deduced a trap composed of 13 places in 782 ms of which 0 ms to minimize.
[2023-03-19 07:08:18] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 1 ms to minimize.
[2023-03-19 07:08:18] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-19 07:08:18] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 1 ms to minimize.
[2023-03-19 07:08:19] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 2 ms to minimize.
[2023-03-19 07:08:19] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 0 ms to minimize.
[2023-03-19 07:08:19] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2023-03-19 07:08:19] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 16866 ms
[2023-03-19 07:08:20] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 1 ms to minimize.
[2023-03-19 07:08:20] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2023-03-19 07:08:21] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 0 ms to minimize.
[2023-03-19 07:08:21] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 0 ms to minimize.
[2023-03-19 07:08:21] [INFO ] Deduced a trap composed of 10 places in 377 ms of which 13 ms to minimize.
[2023-03-19 07:08:22] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 1 ms to minimize.
[2023-03-19 07:08:22] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2023-03-19 07:08:23] [INFO ] Deduced a trap composed of 12 places in 582 ms of which 1 ms to minimize.
[2023-03-19 07:08:24] [INFO ] Deduced a trap composed of 19 places in 1018 ms of which 23 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-19 07:08:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:08:24] [INFO ] After 26038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 395 ms.
Support contains 86 out of 1651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 transitions.
Applied a total of 0 rules in 188 ms. Remains 1651 /1651 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1651/1651 places, 1401/1401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1651/1651 places, 1401/1401 transitions.
Applied a total of 0 rules in 80 ms. Remains 1651 /1651 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
[2023-03-19 07:08:24] [INFO ] Invariant cache hit.
[2023-03-19 07:08:26] [INFO ] Implicit Places using invariants in 1737 ms returned []
[2023-03-19 07:08:26] [INFO ] Invariant cache hit.
[2023-03-19 07:08:30] [INFO ] Implicit Places using invariants and state equation in 3929 ms returned []
Implicit Place search using SMT with State Equation took 5669 ms to find 0 implicit places.
[2023-03-19 07:08:30] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-19 07:08:30] [INFO ] Invariant cache hit.
[2023-03-19 07:08:31] [INFO ] Dead Transitions using invariants and state equation in 1284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7139 ms. Remains : 1651/1651 places, 1401/1401 transitions.
Applied a total of 0 rules in 137 ms. Remains 1651 /1651 variables (removed 0) and now considering 1401/1401 (removed 0) transitions.
Running SMT prover for 5 properties.
[2023-03-19 07:08:32] [INFO ] Invariant cache hit.
[2023-03-19 07:08:32] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 07:08:33] [INFO ] [Nat]Absence check using 525 positive place invariants in 148 ms returned sat
[2023-03-19 07:08:33] [INFO ] [Nat]Absence check using 525 positive and 26 generalized place invariants in 27 ms returned sat
[2023-03-19 07:08:36] [INFO ] After 2862ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 07:08:37] [INFO ] Deduced a trap composed of 6 places in 245 ms of which 0 ms to minimize.
[2023-03-19 07:08:38] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2023-03-19 07:08:38] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 1 ms to minimize.
[2023-03-19 07:08:38] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-19 07:08:39] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 10 ms to minimize.
[2023-03-19 07:08:39] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2023-03-19 07:08:40] [INFO ] Deduced a trap composed of 7 places in 391 ms of which 1 ms to minimize.
[2023-03-19 07:08:40] [INFO ] Deduced a trap composed of 8 places in 331 ms of which 0 ms to minimize.
[2023-03-19 07:08:40] [INFO ] Deduced a trap composed of 8 places in 305 ms of which 1 ms to minimize.
[2023-03-19 07:08:42] [INFO ] Deduced a trap composed of 8 places in 1184 ms of which 1 ms to minimize.
[2023-03-19 07:08:42] [INFO ] Deduced a trap composed of 8 places in 695 ms of which 1 ms to minimize.
[2023-03-19 07:08:43] [INFO ] Deduced a trap composed of 14 places in 431 ms of which 1 ms to minimize.
[2023-03-19 07:08:43] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 1 ms to minimize.
[2023-03-19 07:08:44] [INFO ] Deduced a trap composed of 6 places in 321 ms of which 14 ms to minimize.
[2023-03-19 07:08:44] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 1 ms to minimize.
[2023-03-19 07:08:45] [INFO ] Deduced a trap composed of 9 places in 498 ms of which 0 ms to minimize.
[2023-03-19 07:08:45] [INFO ] Deduced a trap composed of 16 places in 317 ms of which 14 ms to minimize.
[2023-03-19 07:08:46] [INFO ] Deduced a trap composed of 16 places in 497 ms of which 24 ms to minimize.
[2023-03-19 07:08:46] [INFO ] Deduced a trap composed of 7 places in 244 ms of which 20 ms to minimize.
[2023-03-19 07:08:46] [INFO ] Deduced a trap composed of 19 places in 262 ms of which 1 ms to minimize.
[2023-03-19 07:08:47] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2023-03-19 07:08:47] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-19 07:08:47] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 0 ms to minimize.
[2023-03-19 07:08:48] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 1 ms to minimize.
[2023-03-19 07:08:48] [INFO ] Deduced a trap composed of 10 places in 699 ms of which 1 ms to minimize.
[2023-03-19 07:08:49] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2023-03-19 07:08:49] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 0 ms to minimize.
[2023-03-19 07:08:50] [INFO ] Deduced a trap composed of 14 places in 357 ms of which 1 ms to minimize.
[2023-03-19 07:08:50] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2023-03-19 07:08:50] [INFO ] Deduced a trap composed of 25 places in 301 ms of which 1 ms to minimize.
[2023-03-19 07:08:51] [INFO ] Deduced a trap composed of 11 places in 355 ms of which 0 ms to minimize.
[2023-03-19 07:08:51] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 1 ms to minimize.
[2023-03-19 07:08:52] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 0 ms to minimize.
[2023-03-19 07:08:52] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 0 ms to minimize.
[2023-03-19 07:08:52] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-19 07:08:53] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 0 ms to minimize.
[2023-03-19 07:08:53] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 0 ms to minimize.
[2023-03-19 07:08:53] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2023-03-19 07:08:54] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 0 ms to minimize.
[2023-03-19 07:08:54] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 1 ms to minimize.
[2023-03-19 07:08:54] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 0 ms to minimize.
[2023-03-19 07:08:55] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 1 ms to minimize.
[2023-03-19 07:08:55] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 1 ms to minimize.
[2023-03-19 07:08:55] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 17844 ms
[2023-03-19 07:08:55] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2023-03-19 07:08:56] [INFO ] Deduced a trap composed of 12 places in 204 ms of which 0 ms to minimize.
[2023-03-19 07:08:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 686 ms
[2023-03-19 07:08:56] [INFO ] Deduced a trap composed of 7 places in 364 ms of which 1 ms to minimize.
[2023-03-19 07:08:57] [INFO ] Deduced a trap composed of 7 places in 537 ms of which 0 ms to minimize.
[2023-03-19 07:08:57] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 1 ms to minimize.
[2023-03-19 07:08:58] [INFO ] Deduced a trap composed of 7 places in 271 ms of which 0 ms to minimize.
[2023-03-19 07:08:58] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 1 ms to minimize.
[2023-03-19 07:08:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 2116 ms
[2023-03-19 07:08:58] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 0 ms to minimize.
[2023-03-19 07:08:59] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2023-03-19 07:08:59] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-19 07:09:00] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 0 ms to minimize.
[2023-03-19 07:09:00] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2023-03-19 07:09:00] [INFO ] Deduced a trap composed of 9 places in 435 ms of which 1 ms to minimize.
[2023-03-19 07:09:01] [INFO ] Deduced a trap composed of 8 places in 272 ms of which 1 ms to minimize.
[2023-03-19 07:09:01] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2023-03-19 07:09:02] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 1 ms to minimize.
[2023-03-19 07:09:02] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 0 ms to minimize.
[2023-03-19 07:09:02] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-19 07:09:03] [INFO ] Deduced a trap composed of 7 places in 411 ms of which 1 ms to minimize.
[2023-03-19 07:09:03] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 1 ms to minimize.
[2023-03-19 07:09:03] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 0 ms to minimize.
[2023-03-19 07:09:04] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2023-03-19 07:09:04] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-19 07:09:05] [INFO ] Deduced a trap composed of 11 places in 556 ms of which 1 ms to minimize.
[2023-03-19 07:09:05] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 1 ms to minimize.
[2023-03-19 07:09:05] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2023-03-19 07:09:06] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-19 07:09:06] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-19 07:09:06] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2023-03-19 07:09:07] [INFO ] Deduced a trap composed of 8 places in 301 ms of which 2 ms to minimize.
[2023-03-19 07:09:07] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 0 ms to minimize.
[2023-03-19 07:09:07] [INFO ] Deduced a trap composed of 8 places in 282 ms of which 1 ms to minimize.
[2023-03-19 07:09:08] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 0 ms to minimize.
[2023-03-19 07:09:08] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2023-03-19 07:09:08] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 1 ms to minimize.
[2023-03-19 07:09:08] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9954 ms
[2023-03-19 07:09:09] [INFO ] Deduced a trap composed of 6 places in 393 ms of which 0 ms to minimize.
[2023-03-19 07:09:09] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2023-03-19 07:09:10] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2023-03-19 07:09:10] [INFO ] Deduced a trap composed of 8 places in 375 ms of which 1 ms to minimize.
[2023-03-19 07:09:11] [INFO ] Deduced a trap composed of 7 places in 327 ms of which 1 ms to minimize.
[2023-03-19 07:09:11] [INFO ] Deduced a trap composed of 11 places in 333 ms of which 0 ms to minimize.
[2023-03-19 07:09:11] [INFO ] Deduced a trap composed of 8 places in 234 ms of which 1 ms to minimize.
[2023-03-19 07:09:12] [INFO ] Deduced a trap composed of 9 places in 769 ms of which 0 ms to minimize.
[2023-03-19 07:09:13] [INFO ] Deduced a trap composed of 7 places in 306 ms of which 0 ms to minimize.
[2023-03-19 07:09:13] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 1 ms to minimize.
[2023-03-19 07:09:14] [INFO ] Deduced a trap composed of 7 places in 277 ms of which 1 ms to minimize.
[2023-03-19 07:09:15] [INFO ] Deduced a trap composed of 8 places in 1387 ms of which 1 ms to minimize.
[2023-03-19 07:09:16] [INFO ] Deduced a trap composed of 6 places in 439 ms of which 4 ms to minimize.
[2023-03-19 07:09:16] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 1 ms to minimize.
[2023-03-19 07:09:17] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 0 ms to minimize.
[2023-03-19 07:09:17] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2023-03-19 07:09:17] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 1 ms to minimize.
[2023-03-19 07:09:18] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 2 ms to minimize.
[2023-03-19 07:09:18] [INFO ] Deduced a trap composed of 7 places in 267 ms of which 0 ms to minimize.
[2023-03-19 07:09:18] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
[2023-03-19 07:09:19] [INFO ] Deduced a trap composed of 9 places in 906 ms of which 1 ms to minimize.
[2023-03-19 07:09:20] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-19 07:09:20] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 1 ms to minimize.
[2023-03-19 07:09:20] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 0 ms to minimize.
[2023-03-19 07:09:21] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 0 ms to minimize.
[2023-03-19 07:09:21] [INFO ] Deduced a trap composed of 13 places in 304 ms of which 1 ms to minimize.
[2023-03-19 07:09:22] [INFO ] Deduced a trap composed of 9 places in 471 ms of which 1 ms to minimize.
[2023-03-19 07:09:22] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2023-03-19 07:09:22] [INFO ] Deduced a trap composed of 10 places in 424 ms of which 0 ms to minimize.
[2023-03-19 07:09:23] [INFO ] Deduced a trap composed of 15 places in 408 ms of which 1 ms to minimize.
[2023-03-19 07:09:23] [INFO ] Deduced a trap composed of 10 places in 321 ms of which 1 ms to minimize.
[2023-03-19 07:09:23] [INFO ] Deduced a trap composed of 11 places in 210 ms of which 1 ms to minimize.
[2023-03-19 07:09:24] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 1 ms to minimize.
[2023-03-19 07:09:24] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2023-03-19 07:09:25] [INFO ] Deduced a trap composed of 11 places in 605 ms of which 1 ms to minimize.
[2023-03-19 07:09:25] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 1 ms to minimize.
[2023-03-19 07:09:26] [INFO ] Deduced a trap composed of 13 places in 293 ms of which 0 ms to minimize.
[2023-03-19 07:09:26] [INFO ] Deduced a trap composed of 10 places in 315 ms of which 2 ms to minimize.
[2023-03-19 07:09:27] [INFO ] Deduced a trap composed of 8 places in 536 ms of which 1 ms to minimize.
[2023-03-19 07:09:27] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 0 ms to minimize.
[2023-03-19 07:09:27] [INFO ] Deduced a trap composed of 15 places in 216 ms of which 1 ms to minimize.
[2023-03-19 07:09:28] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2023-03-19 07:09:28] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2023-03-19 07:09:28] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 0 ms to minimize.
[2023-03-19 07:09:29] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 0 ms to minimize.
[2023-03-19 07:09:29] [INFO ] Deduced a trap composed of 15 places in 606 ms of which 2 ms to minimize.
[2023-03-19 07:09:30] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2023-03-19 07:09:30] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 1 ms to minimize.
[2023-03-19 07:09:31] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 0 ms to minimize.
[2023-03-19 07:09:31] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 0 ms to minimize.
[2023-03-19 07:09:31] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2023-03-19 07:09:32] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 1 ms to minimize.
[2023-03-19 07:09:32] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 0 ms to minimize.
[2023-03-19 07:09:32] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 23445 ms
[2023-03-19 07:09:32] [INFO ] After 59247ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 4648 ms.
[2023-03-19 07:09:37] [INFO ] After 64682ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2023-03-19 07:09:37] [INFO ] Flatten gal took : 95 ms
[2023-03-19 07:09:37] [INFO ] Flatten gal took : 71 ms
[2023-03-19 07:09:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17558738518663222649.gal : 13 ms
[2023-03-19 07:09:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16721206020005539477.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/ReachabilityCardinality17558738518663222649.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16721206020005539477.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 ...330
Loading property file /tmp/ReachabilityCardinality16721206020005539477.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 52
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :52 after 424
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :424 after 1684
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1684 after 544324
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :544324 after 5.95214e+10
Detected timeout of ITS tools.
[2023-03-19 07:09:52] [INFO ] Flatten gal took : 64 ms
[2023-03-19 07:09:52] [INFO ] Applying decomposition
[2023-03-19 07:09:52] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15490268369082460349.txt' '-o' '/tmp/graph15490268369082460349.bin' '-w' '/tmp/graph15490268369082460349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15490268369082460349.bin' '-l' '-1' '-v' '-w' '/tmp/graph15490268369082460349.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:09:53] [INFO ] Decomposing Gal with order
[2023-03-19 07:09:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:09:53] [INFO ] Removed a total of 718 redundant transitions.
[2023-03-19 07:09:53] [INFO ] Flatten gal took : 186 ms
[2023-03-19 07:09:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1114 labels/synchronizations in 345 ms.
[2023-03-19 07:09:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3244284605448977367.gal : 36 ms
[2023-03-19 07:09:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17632130735174565284.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/ReachabilityCardinality3244284605448977367.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17632130735174565284.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality17632130735174565284.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 13
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :13 after 672
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :672 after 1680
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1680 after 7224
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :7224 after 424536
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :424536 after 3.99984e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3951932394032063933
[2023-03-19 07:10:09] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3951932394032063933
Running compilation step : cd /tmp/ltsmin3951932394032063933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3951932394032063933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3951932394032063933;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
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)
[2023-03-19 07:10:14] [INFO ] Flatten gal took : 141 ms
[2023-03-19 07:10:14] [INFO ] Applying decomposition
[2023-03-19 07:10:14] [INFO ] Flatten gal took : 113 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15592468534162350313.txt' '-o' '/tmp/graph15592468534162350313.bin' '-w' '/tmp/graph15592468534162350313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15592468534162350313.bin' '-l' '-1' '-v' '-w' '/tmp/graph15592468534162350313.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:10:14] [INFO ] Decomposing Gal with order
[2023-03-19 07:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:10:15] [INFO ] Removed a total of 450 redundant transitions.
[2023-03-19 07:10:15] [INFO ] Flatten gal took : 206 ms
[2023-03-19 07:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-19 07:10:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14559676930428117795.gal : 32 ms
[2023-03-19 07:10:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6599398785195827354.prop : 0 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/ReachabilityCardinality14559676930428117795.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6599398785195827354.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality6599398785195827354.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 3.63285e+08
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :3.63285e+08 after 5.29868e+65
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :5.29868e+65 after 1.12481e+139
Invariant property ShieldPPPs-PT-050B-ReachabilityCardinality-08 does not hold.
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPs-PT-050B-ReachabilityCardinality-06 is true.
FORMULA ShieldPPPs-PT-050B-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1.12481e+139 after 1.22215e+140
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1.22215e+140 after 1.22623e+140
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.22623e+140 after 1.23699e+140
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.23699e+140 after 1.25116e+140
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.25116e+140 after 1.25116e+140
Detected timeout of ITS tools.
Detected timeout of ITS tools.
[2023-03-19 07:40:16] [INFO ] Flatten gal took : 106 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11997801255667701861
[2023-03-19 07:40:16] [INFO ] Computing symmetric may disable matrix : 1401 transitions.
[2023-03-19 07:40:16] [INFO ] Applying decomposition
[2023-03-19 07:40:16] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:40:16] [INFO ] Computing symmetric may enable matrix : 1401 transitions.
[2023-03-19 07:40:16] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:40:16] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6072884868839144208.txt' '-o' '/tmp/graph6072884868839144208.bin' '-w' '/tmp/graph6072884868839144208.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6072884868839144208.bin' '-l' '-1' '-v' '-w' '/tmp/graph6072884868839144208.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:40:16] [INFO ] Decomposing Gal with order
[2023-03-19 07:40:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:40:16] [INFO ] Removed a total of 709 redundant transitions.
[2023-03-19 07:40:16] [INFO ] Computing Do-Not-Accords matrix : 1401 transitions.
[2023-03-19 07:40:16] [INFO ] Flatten gal took : 110 ms
[2023-03-19 07:40:16] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 07:40:16] [INFO ] Built C files in 487ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11997801255667701861
Running compilation step : cd /tmp/ltsmin11997801255667701861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 07:40:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 1017 labels/synchronizations in 270 ms.
[2023-03-19 07:40:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7473309667290184990.gal : 27 ms
[2023-03-19 07:40:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17623351595475359083.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/ReachabilityCardinality7473309667290184990.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17623351595475359083.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality17623351595475359083.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 916
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :916 after 1451
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1451 after 3663
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3663 after 66755
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :66755 after 5.62516e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.62516e+06 after 5.95377e+38
Compilation finished in 6778 ms.
Running link step : cd /tmp/ltsmin11997801255667701861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 150 ms.
Running LTSmin : cd /tmp/ltsmin11997801255667701861;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldPPPsPT050BReachabilityCardinality14==true'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 135040 kB
After kill :
MemTotal: 16393220 kB
MemFree: 9943852 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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="ShieldPPPs-PT-050B"
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 ShieldPPPs-PT-050B, 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 r389-oct2-167903713600510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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