Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100133.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 175K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-17-UpperBounds-00
FORMULA_NAME MedleyA-PT-17-UpperBounds-01
FORMULA_NAME MedleyA-PT-17-UpperBounds-02
FORMULA_NAME MedleyA-PT-17-UpperBounds-03
FORMULA_NAME MedleyA-PT-17-UpperBounds-04
FORMULA_NAME MedleyA-PT-17-UpperBounds-05
FORMULA_NAME MedleyA-PT-17-UpperBounds-06
FORMULA_NAME MedleyA-PT-17-UpperBounds-07
FORMULA_NAME MedleyA-PT-17-UpperBounds-08
FORMULA_NAME MedleyA-PT-17-UpperBounds-09
FORMULA_NAME MedleyA-PT-17-UpperBounds-10
FORMULA_NAME MedleyA-PT-17-UpperBounds-11
FORMULA_NAME MedleyA-PT-17-UpperBounds-12
FORMULA_NAME MedleyA-PT-17-UpperBounds-13
FORMULA_NAME MedleyA-PT-17-UpperBounds-14
FORMULA_NAME MedleyA-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717376128317

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-03 00:55:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 00:55:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:55:31] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2024-06-03 00:55:31] [INFO ] Transformed 248 places.
[2024-06-03 00:55:31] [INFO ] Transformed 591 transitions.
[2024-06-03 00:55:31] [INFO ] Found NUPN structural information;
[2024-06-03 00:55:31] [INFO ] Parsed PT model containing 248 places and 591 transitions and 2764 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 589 rows 248 cols
[2024-06-03 00:55:31] [INFO ] Computed 7 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (343 resets) in 77 ms. (128 steps per ms)
FORMULA MedleyA-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120008 steps (899 resets) in 246 ms. (485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 00:55:31] [INFO ] Invariant cache hit.
[2024-06-03 00:55:32] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2024-06-03 00:55:32] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2024-06-03 00:55:33] [INFO ] Deduced a trap composed of 41 places in 510 ms of which 36 ms to minimize.
[2024-06-03 00:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:55:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:55:34] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-06-03 00:55:34] [INFO ] Deduced a trap composed of 41 places in 408 ms of which 32 ms to minimize.
[2024-06-03 00:55:34] [INFO ] Deduced a trap composed of 29 places in 338 ms of which 4 ms to minimize.
[2024-06-03 00:55:35] [INFO ] Deduced a trap composed of 51 places in 411 ms of which 4 ms to minimize.
[2024-06-03 00:55:35] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 5 ms to minimize.
[2024-06-03 00:55:36] [INFO ] Deduced a trap composed of 45 places in 339 ms of which 4 ms to minimize.
[2024-06-03 00:55:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2139 ms
[2024-06-03 00:55:36] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 113 ms.
[2024-06-03 00:55:37] [INFO ] Added : 125 causal constraints over 25 iterations in 1727 ms. Result :sat
Minimization took 392 ms.
[2024-06-03 00:55:38] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:55:38] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-06-03 00:55:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:55:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:55:39] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2024-06-03 00:55:39] [INFO ] Deduced a trap composed of 35 places in 397 ms of which 4 ms to minimize.
[2024-06-03 00:55:40] [INFO ] Deduced a trap composed of 30 places in 355 ms of which 5 ms to minimize.
[2024-06-03 00:55:40] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 4 ms to minimize.
[2024-06-03 00:55:40] [INFO ] Deduced a trap composed of 104 places in 350 ms of which 4 ms to minimize.
[2024-06-03 00:55:41] [INFO ] Deduced a trap composed of 21 places in 338 ms of which 5 ms to minimize.
[2024-06-03 00:55:41] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-06-03 00:55:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2050 ms
[2024-06-03 00:55:41] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 72 ms.
[2024-06-03 00:55:43] [INFO ] Deduced a trap composed of 48 places in 350 ms of which 4 ms to minimize.
[2024-06-03 00:55:43] [INFO ] Deduced a trap composed of 27 places in 357 ms of which 4 ms to minimize.
[2024-06-03 00:55:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1026 ms
[2024-06-03 00:55:43] [INFO ] Added : 129 causal constraints over 26 iterations in 2521 ms. Result :unknown
[2024-06-03 00:55:43] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:55:44] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2024-06-03 00:55:44] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 4 ms to minimize.
[2024-06-03 00:55:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:55:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:55:45] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-06-03 00:55:45] [INFO ] Deduced a trap composed of 36 places in 361 ms of which 4 ms to minimize.
[2024-06-03 00:55:45] [INFO ] Deduced a trap composed of 26 places in 348 ms of which 4 ms to minimize.
[2024-06-03 00:55:46] [INFO ] Deduced a trap composed of 36 places in 328 ms of which 3 ms to minimize.
[2024-06-03 00:55:46] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 4 ms to minimize.
[2024-06-03 00:55:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1533 ms
[2024-06-03 00:55:46] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 79 ms.
[2024-06-03 00:55:48] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 4 ms to minimize.
[2024-06-03 00:55:48] [INFO ] Deduced a trap composed of 51 places in 341 ms of which 5 ms to minimize.
[2024-06-03 00:55:49] [INFO ] Deduced a trap composed of 48 places in 342 ms of which 4 ms to minimize.
[2024-06-03 00:55:49] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2024-06-03 00:55:49] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 2 ms to minimize.
[2024-06-03 00:55:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1644 ms
[2024-06-03 00:55:49] [INFO ] Added : 108 causal constraints over 22 iterations in 2944 ms. Result :sat
Minimization took 112 ms.
[2024-06-03 00:55:49] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:55:50] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2024-06-03 00:55:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:55:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2024-06-03 00:55:50] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2024-06-03 00:55:50] [INFO ] Deduced a trap composed of 27 places in 336 ms of which 4 ms to minimize.
[2024-06-03 00:55:51] [INFO ] Deduced a trap composed of 30 places in 316 ms of which 4 ms to minimize.
[2024-06-03 00:55:51] [INFO ] Deduced a trap composed of 28 places in 312 ms of which 4 ms to minimize.
[2024-06-03 00:55:52] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 4 ms to minimize.
[2024-06-03 00:55:52] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 3 ms to minimize.
[2024-06-03 00:55:52] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 3 ms to minimize.
[2024-06-03 00:55:52] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 2 ms to minimize.
[2024-06-03 00:55:52] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2350 ms
[2024-06-03 00:55:53] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 74 ms.
[2024-06-03 00:55:55] [INFO ] Deduced a trap composed of 23 places in 424 ms of which 4 ms to minimize.
[2024-06-03 00:55:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-03 00:55:55] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:55:55] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2024-06-03 00:55:56] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 3 ms to minimize.
[2024-06-03 00:55:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:55:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:55:56] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2024-06-03 00:55:56] [INFO ] Deduced a trap composed of 27 places in 327 ms of which 4 ms to minimize.
[2024-06-03 00:55:57] [INFO ] Deduced a trap composed of 34 places in 334 ms of which 4 ms to minimize.
[2024-06-03 00:55:57] [INFO ] Deduced a trap composed of 48 places in 325 ms of which 4 ms to minimize.
[2024-06-03 00:55:58] [INFO ] Deduced a trap composed of 36 places in 329 ms of which 4 ms to minimize.
[2024-06-03 00:55:58] [INFO ] Deduced a trap composed of 51 places in 306 ms of which 4 ms to minimize.
[2024-06-03 00:55:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1785 ms
[2024-06-03 00:55:58] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 68 ms.
[2024-06-03 00:56:00] [INFO ] Added : 137 causal constraints over 28 iterations in 1737 ms. Result :sat
Minimization took 375 ms.
[2024-06-03 00:56:00] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-03 00:56:00] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-06-03 00:56:01] [INFO ] Deduced a trap composed of 35 places in 335 ms of which 4 ms to minimize.
[2024-06-03 00:56:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:56:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:56:01] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 35 places in 336 ms of which 4 ms to minimize.
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 3 ms to minimize.
[2024-06-03 00:56:02] [INFO ] Deduced a trap composed of 30 places in 308 ms of which 4 ms to minimize.
[2024-06-03 00:56:03] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 4 ms to minimize.
[2024-06-03 00:56:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1478 ms
[2024-06-03 00:56:03] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 74 ms.
[2024-06-03 00:56:05] [INFO ] Deduced a trap composed of 21 places in 349 ms of which 4 ms to minimize.
[2024-06-03 00:56:05] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 4 ms to minimize.
[2024-06-03 00:56:06] [INFO ] Deduced a trap composed of 51 places in 331 ms of which 4 ms to minimize.
[2024-06-03 00:56:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1223 ms
[2024-06-03 00:56:06] [INFO ] Added : 144 causal constraints over 29 iterations in 3065 ms. Result :sat
Minimization took 51 ms.
[2024-06-03 00:56:06] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:56:06] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-06-03 00:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:56:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:56:07] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2024-06-03 00:56:07] [INFO ] Deduced a trap composed of 29 places in 331 ms of which 4 ms to minimize.
[2024-06-03 00:56:08] [INFO ] Deduced a trap composed of 34 places in 359 ms of which 4 ms to minimize.
[2024-06-03 00:56:08] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 4 ms to minimize.
[2024-06-03 00:56:08] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 3 ms to minimize.
[2024-06-03 00:56:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1406 ms
[2024-06-03 00:56:08] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 69 ms.
[2024-06-03 00:56:10] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 4 ms to minimize.
[2024-06-03 00:56:10] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 4 ms to minimize.
[2024-06-03 00:56:11] [INFO ] Deduced a trap composed of 51 places in 265 ms of which 4 ms to minimize.
[2024-06-03 00:56:11] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1545 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-03 00:56:11] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:56:12] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-06-03 00:56:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:56:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 18 ms returned sat
[2024-06-03 00:56:12] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2024-06-03 00:56:13] [INFO ] Deduced a trap composed of 48 places in 329 ms of which 4 ms to minimize.
[2024-06-03 00:56:13] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 2 ms to minimize.
[2024-06-03 00:56:13] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 2 ms to minimize.
[2024-06-03 00:56:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 932 ms
[2024-06-03 00:56:13] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 72 ms.
[2024-06-03 00:56:15] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 4 ms to minimize.
[2024-06-03 00:56:16] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 4 ms to minimize.
[2024-06-03 00:56:16] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 4 ms to minimize.
[2024-06-03 00:56:16] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-06-03 00:56:17] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 4 ms to minimize.
[2024-06-03 00:56:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1975 ms
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-03 00:56:17] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:56:17] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-06-03 00:56:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:56:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:56:18] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-06-03 00:56:18] [INFO ] Deduced a trap composed of 52 places in 332 ms of which 4 ms to minimize.
[2024-06-03 00:56:18] [INFO ] Deduced a trap composed of 19 places in 343 ms of which 4 ms to minimize.
[2024-06-03 00:56:19] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 3 ms to minimize.
[2024-06-03 00:56:19] [INFO ] Deduced a trap composed of 33 places in 316 ms of which 4 ms to minimize.
[2024-06-03 00:56:20] [INFO ] Deduced a trap composed of 26 places in 351 ms of which 5 ms to minimize.
[2024-06-03 00:56:20] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:56:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2143 ms
[2024-06-03 00:56:20] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 72 ms.
[2024-06-03 00:56:22] [INFO ] Added : 160 causal constraints over 32 iterations in 1835 ms. Result :sat
Minimization took 408 ms.
[2024-06-03 00:56:22] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-03 00:56:23] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2024-06-03 00:56:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:56:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:56:23] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2024-06-03 00:56:23] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 3 ms to minimize.
[2024-06-03 00:56:24] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 3 ms to minimize.
[2024-06-03 00:56:24] [INFO ] Deduced a trap composed of 27 places in 305 ms of which 4 ms to minimize.
[2024-06-03 00:56:24] [INFO ] Deduced a trap composed of 21 places in 319 ms of which 4 ms to minimize.
[2024-06-03 00:56:25] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 3 ms to minimize.
[2024-06-03 00:56:25] [INFO ] Deduced a trap composed of 39 places in 304 ms of which 3 ms to minimize.
[2024-06-03 00:56:25] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 4 ms to minimize.
[2024-06-03 00:56:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2239 ms
[2024-06-03 00:56:25] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 69 ms.
[2024-06-03 00:56:27] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 3 ms to minimize.
[2024-06-03 00:56:28] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 3 ms to minimize.
[2024-06-03 00:56:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-03 00:56:28] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2024-06-03 00:56:28] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2024-06-03 00:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:56:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2024-06-03 00:56:28] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2024-06-03 00:56:29] [INFO ] Deduced a trap composed of 35 places in 344 ms of which 3 ms to minimize.
[2024-06-03 00:56:29] [INFO ] Deduced a trap composed of 28 places in 328 ms of which 4 ms to minimize.
[2024-06-03 00:56:30] [INFO ] Deduced a trap composed of 54 places in 320 ms of which 4 ms to minimize.
[2024-06-03 00:56:30] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 3 ms to minimize.
[2024-06-03 00:56:30] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 4 ms to minimize.
[2024-06-03 00:56:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1805 ms
[2024-06-03 00:56:30] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 71 ms.
[2024-06-03 00:56:32] [INFO ] Added : 126 causal constraints over 26 iterations in 1545 ms. Result :sat
Minimization took 482 ms.
[2024-06-03 00:56:33] [INFO ] [Real]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:56:33] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2024-06-03 00:56:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-03 00:56:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 13 ms returned sat
[2024-06-03 00:56:33] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2024-06-03 00:56:34] [INFO ] Deduced a trap composed of 28 places in 277 ms of which 3 ms to minimize.
[2024-06-03 00:56:34] [INFO ] Deduced a trap composed of 51 places in 351 ms of which 4 ms to minimize.
[2024-06-03 00:56:34] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 4 ms to minimize.
[2024-06-03 00:56:35] [INFO ] Deduced a trap composed of 47 places in 267 ms of which 3 ms to minimize.
[2024-06-03 00:56:35] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 4 ms to minimize.
[2024-06-03 00:56:35] [INFO ] Deduced a trap composed of 26 places in 310 ms of which 4 ms to minimize.
[2024-06-03 00:56:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2035 ms
[2024-06-03 00:56:35] [INFO ] Computed and/alt/rep : 385/1143/385 causal constraints (skipped 203 transitions) in 73 ms.
[2024-06-03 00:56:37] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 3 ms to minimize.
[2024-06-03 00:56:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2024-06-03 00:56:37] [INFO ] Added : 131 causal constraints over 27 iterations in 1762 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 248 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 248/248 places, 589/589 transitions.
Graph (trivial) has 262 edges and 248 vertex of which 9 / 248 are part of one of the 3 SCC in 12 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 242 transition count 548
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 210 transition count 546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 208 transition count 546
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 69 place count 208 transition count 532
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 97 place count 194 transition count 532
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 141 place count 150 transition count 455
Iterating global reduction 3 with 44 rules applied. Total rules applied 185 place count 150 transition count 455
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 3 with 32 rules applied. Total rules applied 217 place count 150 transition count 423
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 217 place count 150 transition count 417
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 229 place count 144 transition count 417
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 143 transition count 401
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 143 transition count 401
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 259 place count 129 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 261 place count 129 transition count 385
Performed 22 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 305 place count 107 transition count 471
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 310 place count 107 transition count 466
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 311 place count 106 transition count 458
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 106 transition count 458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 316 place count 106 transition count 454
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 318 place count 105 transition count 473
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 334 place count 105 transition count 457
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 342 place count 101 transition count 453
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 373 place count 101 transition count 422
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 34 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 7 with 69 rules applied. Total rules applied 442 place count 70 transition count 384
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 458 place count 70 transition count 368
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 460 place count 70 transition count 396
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 462 place count 68 transition count 396
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 463 place count 67 transition count 395
Applied a total of 463 rules in 512 ms. Remains 67 /248 variables (removed 181) and now considering 395/589 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 67/248 places, 395/589 transitions.
[2024-06-03 00:56:39] [INFO ] Flow matrix only has 319 transitions (discarded 76 similar events)
// Phase 1: matrix 319 rows 67 cols
[2024-06-03 00:56:39] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (76434 resets) in 3486 ms. (286 steps per ms)
FORMULA MedleyA-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (18177 resets) in 1137 ms. (878 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-06-03 00:56:44] [INFO ] Flatten gal took : 156 ms
[2024-06-03 00:56:44] [INFO ] Flatten gal took : 71 ms
[2024-06-03 00:56:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12330637878087745050.gal : 40 ms
[2024-06-03 00:56:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7755811911764334565.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12330637878087745050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7755811911764334565.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 74019 ms.

BK_STOP 1717376204843

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="MedleyA-PT-17"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-17, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r576-smll-171734920100133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-17.tgz
mv MedleyA-PT-17 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;