Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r251-tall-174915604900022.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is Szymanski-PT-b12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-tall-174915604900022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 3.7M May 29 14: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

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

=== Now, execution of the tool begins

BK_START 1749196471174

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-06 07:54:32] [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]
[2025-06-06 07:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:54:32] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2025-06-06 07:54:32] [INFO ] Transformed 568 places.
[2025-06-06 07:54:32] [INFO ] Transformed 8320 transitions.
[2025-06-06 07:54:32] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-06 07:54:33] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2025-06-06 07:54:33] [INFO ] Computed 3 invariants in 56 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 1, 1]
RANDOM walk for 10008 steps (2 resets) in 61 ms. (161 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (20 resets) in 170 ms. (350 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 6, 0] Max Struct:[1, 1, 1, 1, 25, 1]
[2025-06-06 07:54:33] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2025-06-06 07:54:33] [INFO ] Invariant cache hit.
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-06-06 07:54:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2025-06-06 07:54:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:54:34] [INFO ] [Real]Added 147 Read/Feed constraints in 210 ms returned sat
[2025-06-06 07:54:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-06-06 07:54:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2025-06-06 07:54:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 499 ms returned sat
[2025-06-06 07:54:36] [INFO ] Deduced a trap composed of 135 places in 619 ms of which 23 ms to minimize.
[2025-06-06 07:54:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 799 ms
[2025-06-06 07:54:37] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 618 ms.
[2025-06-06 07:54:37] [INFO ] Added : 0 causal constraints over 0 iterations in 808 ms. Result :sat
Minimization took 589 ms.
[2025-06-06 07:54:37] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:37] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:38] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2025-06-06 07:54:38] [INFO ] [Real]Added 147 Read/Feed constraints in 65 ms returned sat
[2025-06-06 07:54:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:38] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:38] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2025-06-06 07:54:39] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 607 ms returned sat
[2025-06-06 07:54:40] [INFO ] Deduced a trap composed of 138 places in 541 ms of which 4 ms to minimize.
[2025-06-06 07:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 669 ms
[2025-06-06 07:54:41] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 859 ms.
[2025-06-06 07:54:41] [INFO ] Added : 0 causal constraints over 0 iterations in 1048 ms. Result :sat
Minimization took 586 ms.
[2025-06-06 07:54:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:41] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:42] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2025-06-06 07:54:42] [INFO ] [Real]Added 147 Read/Feed constraints in 414 ms returned sat
[2025-06-06 07:54:42] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:42] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:43] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2025-06-06 07:54:43] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:44] [INFO ] [Nat]Added 147 Read/Feed constraints in 1055 ms returned unknown
[2025-06-06 07:54:44] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:44] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:44] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2025-06-06 07:54:45] [INFO ] [Real]Added 147 Read/Feed constraints in 71 ms returned sat
[2025-06-06 07:54:45] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:45] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:45] [INFO ] [Nat]Absence check using state equation in 373 ms returned sat
[2025-06-06 07:54:46] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 967 ms returned sat
[2025-06-06 07:54:47] [INFO ] Deduced a trap composed of 82 places in 575 ms of which 21 ms to minimize.
[2025-06-06 07:54:47] [INFO ] Deduced a trap composed of 87 places in 530 ms of which 4 ms to minimize.
[2025-06-06 07:54:48] [INFO ] Deduced a trap composed of 137 places in 559 ms of which 7 ms to minimize.
[2025-06-06 07:54:48] [INFO ] Deduced a trap composed of 135 places in 522 ms of which 2 ms to minimize.
[2025-06-06 07:54:49] [INFO ] Deduced a trap composed of 132 places in 535 ms of which 3 ms to minimize.
[2025-06-06 07:54:50] [INFO ] Deduced a trap composed of 133 places in 525 ms of which 2 ms to minimize.
[2025-06-06 07:54:50] [INFO ] Deduced a trap composed of 79 places in 452 ms of which 2 ms to minimize.
[2025-06-06 07:54:50] [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.verifyPossible(DeadlockTester.java:868)
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)
[2025-06-06 07:54:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:50] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:50] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2025-06-06 07:54:51] [INFO ] [Real]Added 147 Read/Feed constraints in 82 ms returned sat
[2025-06-06 07:54:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:51] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:51] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2025-06-06 07:54:52] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:52] [INFO ] [Nat]Added 147 Read/Feed constraints in 1032 ms returned unknown
[2025-06-06 07:54:52] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-06-06 07:54:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-06 07:54:53] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2025-06-06 07:54:53] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:53] [INFO ] [Real]Added 147 Read/Feed constraints in 881 ms returned sat
[2025-06-06 07:54:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:54:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-06-06 07:54:54] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-06 07:54:54] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2025-06-06 07:54:55] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 07:54:55] [INFO ] [Nat]Added 147 Read/Feed constraints in 1132 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 6, 0] Max Struct:[1, 1, 1, 1, 25, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 6, 0] Max Struct:[1, 1, 1, 1, 25, 1]
Support contains 6 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 484 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 305/308 places, 7808/8064 transitions.
[2025-06-06 07:54:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2025-06-06 07:54:56] [INFO ] Computed 3 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 6, 0] Max Struct:[1, 1, 1, 1, 12, 1]
RANDOM walk for 1000003 steps (2 resets) in 812 ms. (1230 steps per ms)
FORMULA Szymanski-PT-b12-UpperBounds-08 12 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 5000005 steps (10 resets) in 3743 ms. (1335 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 07:55:00] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:00] [INFO ] Invariant cache hit.
[2025-06-06 07:55:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:01] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2025-06-06 07:55:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:55:01] [INFO ] [Real]Added 147 Read/Feed constraints in 96 ms returned sat
[2025-06-06 07:55:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:01] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2025-06-06 07:55:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 228 ms returned sat
[2025-06-06 07:55:02] [INFO ] Deduced a trap composed of 53 places in 513 ms of which 2 ms to minimize.
[2025-06-06 07:55:03] [INFO ] Deduced a trap composed of 129 places in 552 ms of which 2 ms to minimize.
[2025-06-06 07:55:03] [INFO ] Deduced a trap composed of 129 places in 514 ms of which 2 ms to minimize.
[2025-06-06 07:55:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1847 ms
[2025-06-06 07:55:04] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 321 ms.
[2025-06-06 07:55:04] [INFO ] Added : 0 causal constraints over 0 iterations in 469 ms. Result :sat
Minimization took 4897 ms.
[2025-06-06 07:55:09] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:09] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-06-06 07:55:09] [INFO ] [Real]Added 147 Read/Feed constraints in 98 ms returned sat
[2025-06-06 07:55:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:10] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2025-06-06 07:55:10] [INFO ] [Nat]Added 147 Read/Feed constraints in 597 ms returned sat
[2025-06-06 07:55:11] [INFO ] Deduced a trap composed of 37 places in 522 ms of which 2 ms to minimize.
[2025-06-06 07:55:11] [INFO ] Deduced a trap composed of 129 places in 519 ms of which 4 ms to minimize.
[2025-06-06 07:55:12] [INFO ] Deduced a trap composed of 129 places in 538 ms of which 2 ms to minimize.
[2025-06-06 07:55:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1827 ms
[2025-06-06 07:55:12] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 306 ms.
[2025-06-06 07:55:13] [INFO ] Added : 0 causal constraints over 0 iterations in 464 ms. Result :sat
Minimization took 4891 ms.
[2025-06-06 07:55:18] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:18] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2025-06-06 07:55:18] [INFO ] [Real]Added 147 Read/Feed constraints in 109 ms returned sat
[2025-06-06 07:55:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:19] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2025-06-06 07:55:21] [INFO ] [Nat]Added 147 Read/Feed constraints in 2852 ms returned sat
[2025-06-06 07:55:22] [INFO ] Deduced a trap composed of 52 places in 523 ms of which 3 ms to minimize.
[2025-06-06 07:55:22] [INFO ] Deduced a trap composed of 37 places in 520 ms of which 2 ms to minimize.
[2025-06-06 07:55:23] [INFO ] Deduced a trap composed of 140 places in 488 ms of which 2 ms to minimize.
[2025-06-06 07:55:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1742 ms
[2025-06-06 07:55:23] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 306 ms.
[2025-06-06 07:55:24] [INFO ] Added : 0 causal constraints over 0 iterations in 458 ms. Result :sat
Minimization took 4894 ms.
[2025-06-06 07:55:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:29] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2025-06-06 07:55:29] [INFO ] [Real]Added 147 Read/Feed constraints in 88 ms returned sat
[2025-06-06 07:55:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:29] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-06-06 07:55:32] [INFO ] [Nat]Added 147 Read/Feed constraints in 2281 ms returned sat
[2025-06-06 07:55:32] [INFO ] Deduced a trap composed of 137 places in 541 ms of which 2 ms to minimize.
[2025-06-06 07:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 660 ms
[2025-06-06 07:55:33] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 309 ms.
[2025-06-06 07:55:33] [INFO ] Added : 0 causal constraints over 0 iterations in 477 ms. Result :sat
Minimization took 4891 ms.
[2025-06-06 07:55:38] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:38] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-06-06 07:55:38] [INFO ] [Real]Added 147 Read/Feed constraints in 86 ms returned sat
[2025-06-06 07:55:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:39] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2025-06-06 07:55:40] [INFO ] [Nat]Added 147 Read/Feed constraints in 925 ms returned sat
[2025-06-06 07:55:40] [INFO ] Deduced a trap composed of 133 places in 549 ms of which 2 ms to minimize.
[2025-06-06 07:55:41] [INFO ] Deduced a trap composed of 78 places in 538 ms of which 2 ms to minimize.
[2025-06-06 07:55:41] [INFO ] Deduced a trap composed of 129 places in 502 ms of which 3 ms to minimize.
[2025-06-06 07:55:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1817 ms
[2025-06-06 07:55:42] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 320 ms.
[2025-06-06 07:55:42] [INFO ] Added : 0 causal constraints over 0 iterations in 479 ms. Result :sat
Minimization took 4903 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 231 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 305/305 places, 7808/7808 transitions.
[2025-06-06 07:55:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000009 steps (2 resets) in 650 ms. (1536 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 3528 ms. (1416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-06 07:55:51] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:55:51] [INFO ] Invariant cache hit.
[2025-06-06 07:55:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:55:52] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2025-06-06 07:55:52] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:55:52] [INFO ] [Real]Added 147 Read/Feed constraints in 98 ms returned sat
[2025-06-06 07:55:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:55:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-06 07:55:52] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2025-06-06 07:55:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 219 ms returned sat
[2025-06-06 07:55:53] [INFO ] Deduced a trap composed of 53 places in 559 ms of which 2 ms to minimize.
[2025-06-06 07:55:54] [INFO ] Deduced a trap composed of 129 places in 548 ms of which 2 ms to minimize.
[2025-06-06 07:55:54] [INFO ] Deduced a trap composed of 129 places in 507 ms of which 2 ms to minimize.
[2025-06-06 07:55:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1866 ms
[2025-06-06 07:55:55] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 313 ms.
[2025-06-06 07:55:55] [INFO ] Added : 0 causal constraints over 0 iterations in 471 ms. Result :sat
Minimization took 4892 ms.
[2025-06-06 07:56:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:56:00] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2025-06-06 07:56:00] [INFO ] [Real]Added 147 Read/Feed constraints in 96 ms returned sat
[2025-06-06 07:56:00] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:56:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:56:01] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2025-06-06 07:56:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 565 ms returned sat
[2025-06-06 07:56:02] [INFO ] Deduced a trap composed of 37 places in 555 ms of which 2 ms to minimize.
[2025-06-06 07:56:03] [INFO ] Deduced a trap composed of 129 places in 528 ms of which 4 ms to minimize.
[2025-06-06 07:56:03] [INFO ] Deduced a trap composed of 129 places in 537 ms of which 2 ms to minimize.
[2025-06-06 07:56:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1848 ms
[2025-06-06 07:56:04] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 323 ms.
[2025-06-06 07:56:04] [INFO ] Added : 0 causal constraints over 0 iterations in 494 ms. Result :sat
Minimization took 4896 ms.
[2025-06-06 07:56:09] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 07:56:09] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2025-06-06 07:56:09] [INFO ] [Real]Added 147 Read/Feed constraints in 106 ms returned sat
[2025-06-06 07:56:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:56:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:56:10] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2025-06-06 07:56:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 2829 ms returned sat
[2025-06-06 07:56:13] [INFO ] Deduced a trap composed of 52 places in 492 ms of which 2 ms to minimize.
[2025-06-06 07:56:14] [INFO ] Deduced a trap composed of 37 places in 491 ms of which 2 ms to minimize.
[2025-06-06 07:56:14] [INFO ] Deduced a trap composed of 140 places in 448 ms of which 2 ms to minimize.
[2025-06-06 07:56:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1652 ms
[2025-06-06 07:56:15] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 311 ms.
[2025-06-06 07:56:15] [INFO ] Added : 0 causal constraints over 0 iterations in 481 ms. Result :sat
Minimization took 4895 ms.
[2025-06-06 07:56:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:56:20] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2025-06-06 07:56:20] [INFO ] [Real]Added 147 Read/Feed constraints in 90 ms returned sat
[2025-06-06 07:56:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:56:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:56:21] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2025-06-06 07:56:23] [INFO ] [Nat]Added 147 Read/Feed constraints in 2296 ms returned sat
[2025-06-06 07:56:23] [INFO ] Deduced a trap composed of 137 places in 565 ms of which 2 ms to minimize.
[2025-06-06 07:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 681 ms
[2025-06-06 07:56:24] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 327 ms.
[2025-06-06 07:56:24] [INFO ] Added : 0 causal constraints over 0 iterations in 482 ms. Result :sat
Minimization took 4911 ms.
[2025-06-06 07:56:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-06 07:56:29] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2025-06-06 07:56:30] [INFO ] [Real]Added 147 Read/Feed constraints in 91 ms returned sat
[2025-06-06 07:56:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-06 07:56:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-06 07:56:30] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2025-06-06 07:56:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 923 ms returned sat
[2025-06-06 07:56:32] [INFO ] Deduced a trap composed of 133 places in 547 ms of which 2 ms to minimize.
[2025-06-06 07:56:32] [INFO ] Deduced a trap composed of 78 places in 548 ms of which 2 ms to minimize.
[2025-06-06 07:56:33] [INFO ] Deduced a trap composed of 129 places in 535 ms of which 2 ms to minimize.
[2025-06-06 07:56:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1858 ms
[2025-06-06 07:56:33] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 317 ms.
[2025-06-06 07:56:33] [INFO ] Added : 0 causal constraints over 0 iterations in 476 ms. Result :sat
Minimization took 4903 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 247 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:56:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:39] [INFO ] Invariant cache hit.
[2025-06-06 07:56:39] [INFO ] Implicit Places using invariants in 584 ms returned []
[2025-06-06 07:56:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:39] [INFO ] Invariant cache hit.
[2025-06-06 07:56:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2025-06-06 07:56:57] [INFO ] Implicit Places using invariants and state equation in 18185 ms returned []
Implicit Place search using SMT with State Equation took 18774 ms to find 0 implicit places.
[2025-06-06 07:56:58] [INFO ] Redundant transitions in 883 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:56:58] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:56:58] [INFO ] Invariant cache hit.
[2025-06-06 07:56:58] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30190 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30094 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 0/0 constraints]
After SMT, in 86902ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87010ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106905 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40021 steps (8 resets) in 713 ms. (56 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/6 properties
[2025-06-06 07:58:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:26] [INFO ] Invariant cache hit.
[2025-06-06 07:58:26] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-06 07:58:27] [INFO ] Flatten gal took : 725 ms
[2025-06-06 07:58:27] [INFO ] Deduced a trap composed of 132 places in 462 ms of which 2 ms to minimize.
[2025-06-06 07:58:27] [INFO ] Flatten gal took : 320 ms
[2025-06-06 07:58:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7251422444426718955.gal : 157 ms
[2025-06-06 07:58:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10972260288827946199.prop : 3 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/ReachabilityCardinality7251422444426718955.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10972260288827946199.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2025-06-06 07:58:27] [INFO ] Deduced a trap composed of 57 places in 432 ms of which 2 ms to minimize.
[2025-06-06 07:58:28] [INFO ] Deduced a trap composed of 129 places in 445 ms of which 3 ms to minimize.
Loading property file /tmp/ReachabilityCardinality10972260288827946199.prop.
[2025-06-06 07:58:28] [INFO ] Deduced a trap composed of 129 places in 462 ms of which 2 ms to minimize.
[2025-06-06 07:58:29] [INFO ] Deduced a trap composed of 138 places in 395 ms of which 4 ms to minimize.
[2025-06-06 07:58:29] [INFO ] Deduced a trap composed of 79 places in 355 ms of which 2 ms to minimize.
[2025-06-06 07:58:29] [INFO ] Deduced a trap composed of 103 places in 305 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
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 63
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :63 after 445
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :445 after 38675
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :38675 after 433196
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :433196 after 1.44287e+06
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 462 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4377 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-06 07:58:31] [INFO ] Deduced a trap composed of 78 places in 342 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.44287e+06 after 1.48496e+07
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.48496e+07 after 2.57722e+07
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-06 07:58:33] [INFO ] Deduced a trap composed of 145 places in 448 ms of which 2 ms to minimize.
[2025-06-06 07:58:34] [INFO ] Deduced a trap composed of 144 places in 404 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4525 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 8958ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 790 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40011 steps (8 resets) in 104 ms. (381 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2.57722e+07 after 3.10149e+07
Interrupted probabilistic random walk after 154297 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 2
Probabilistic random walk after 154297 steps, saw 120753 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
[2025-06-06 07:58:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:39] [INFO ] Invariant cache hit.
[2025-06-06 07:58:39] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-06 07:58:40] [INFO ] Deduced a trap composed of 73 places in 444 ms of which 2 ms to minimize.
[2025-06-06 07:58:40] [INFO ] Deduced a trap composed of 102 places in 402 ms of which 2 ms to minimize.
[2025-06-06 07:58:40] [INFO ] Deduced a trap composed of 72 places in 400 ms of which 2 ms to minimize.
[2025-06-06 07:58:41] [INFO ] Deduced a trap composed of 133 places in 437 ms of which 2 ms to minimize.
[2025-06-06 07:58:41] [INFO ] Deduced a trap composed of 129 places in 435 ms of which 2 ms to minimize.
[2025-06-06 07:58:42] [INFO ] Deduced a trap composed of 129 places in 435 ms of which 3 ms to minimize.
[2025-06-06 07:58:42] [INFO ] Deduced a trap composed of 134 places in 364 ms of which 2 ms to minimize.
[2025-06-06 07:58:43] [INFO ] Deduced a trap composed of 195 places in 320 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 463 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4358 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 255/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3.10149e+07 after 1.20559e+08
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 465 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3153 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 7572ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 330 ms.
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 176 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2025-06-06 07:58:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:47] [INFO ] Invariant cache hit.
[2025-06-06 07:58:48] [INFO ] Implicit Places using invariants in 700 ms returned []
[2025-06-06 07:58:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:58:48] [INFO ] Invariant cache hit.
[2025-06-06 07:58:49] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.20559e+08 after 6.52271e+08
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :6.52271e+08 after 1.12132e+09
[2025-06-06 07:59:06] [INFO ] Implicit Places using invariants and state equation in 18292 ms returned []
Implicit Place search using SMT with State Equation took 18994 ms to find 0 implicit places.
[2025-06-06 07:59:07] [INFO ] Redundant transitions in 746 ms returned []
Running 7806 sub problems to find dead transitions.
[2025-06-06 07:59:07] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2025-06-06 07:59:07] [INFO ] Invariant cache hit.
[2025-06-06 07:59:07] [INFO ] State equation strengthened by 147 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :1.12132e+09 after 2.4751e+09
Detected timeout of ITS tools.
[2025-06-06 07:59:18] [INFO ] Flatten gal took : 245 ms
[2025-06-06 07:59:18] [INFO ] Applying decomposition
[2025-06-06 07:59:18] [INFO ] Flatten gal took : 400 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9861148512741277764.txt' '-o' '/tmp/graph9861148512741277764.bin' '-w' '/tmp/graph9861148512741277764.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9861148512741277764.bin' '-l' '-1' '-v' '-w' '/tmp/graph9861148512741277764.weights' '-q' '0' '-e' '0.001'
[2025-06-06 07:59:20] [INFO ] Decomposing Gal with order
[2025-06-06 07:59:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-06 07:59:21] [INFO ] Removed a total of 17583 redundant transitions.
[2025-06-06 07:59:22] [INFO ] Flatten gal took : 1635 ms
[2025-06-06 07:59:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 995 labels/synchronizations in 467 ms.
[2025-06-06 07:59:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7217106490102896355.gal : 24 ms
[2025-06-06 07:59:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11971784548407700912.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7217106490102896355.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11971784548407700912.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality11971784548407700912.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :6 after 32
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 144
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :144 after 16457
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :16457 after 250504
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :250504 after 344213
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :344213 after 758741
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :758741 after 1.09325e+06
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.09325e+06 after 1.16341e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.16341e+06 after 1.17014e+06
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.17014e+06 after 1.1745e+06
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1.1745e+06 after 1.17894e+06
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.17894e+06 after 1.50125e+06

BK_STOP 1749196798223

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Szymanski-PT-b12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is Szymanski-PT-b12, 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 r251-tall-174915604900022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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