./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:28:58,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:28:58,177 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:28:58,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:28:58,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:28:58,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:28:58,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:28:58,210 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:28:58,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:28:58,211 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:28:58,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:28:58,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:28:58,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:28:58,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:28:58,214 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:28:58,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:28:58,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:28:58,216 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:28:58,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:28:58,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:28:58,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:28:58,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:28:58,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:28:58,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:28:58,219 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:28:58,219 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:28:58,220 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:28:58,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:28:58,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:28:58,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:28:58,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:28:58,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:28:58,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:28:58,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:28:58,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:28:58,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:28:58,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:28:58,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:28:58,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:28:58,225 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:28:58,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:28:58,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:28:58,225 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2023-11-28 20:28:58,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:28:58,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:28:58,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:28:58,477 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:28:58,478 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:28:58,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2023-11-28 20:29:01,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:29:01,429 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:29:01,430 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2023-11-28 20:29:01,437 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/data/831d26bcd/5a9627657b85435ba0660b939172cc5b/FLAG6ae658f40 [2023-11-28 20:29:01,450 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/data/831d26bcd/5a9627657b85435ba0660b939172cc5b [2023-11-28 20:29:01,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:29:01,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:29:01,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:29:01,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:29:01,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:29:01,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1294a8ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01, skipping insertion in model container [2023-11-28 20:29:01,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,490 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:29:01,668 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2023-11-28 20:29:01,674 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:29:01,684 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:29:01,707 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c[2630,2643] [2023-11-28 20:29:01,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:29:01,716 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:29:01,716 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 20:29:01,724 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:29:01,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01 WrapperNode [2023-11-28 20:29:01,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:29:01,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:29:01,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:29:01,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:29:01,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,743 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,764 INFO L138 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 69 [2023-11-28 20:29:01,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:29:01,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:29:01,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:29:01,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:29:01,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,795 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-28 20:29:01,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:29:01,813 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:29:01,813 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:29:01,813 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:29:01,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (1/1) ... [2023-11-28 20:29:01,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:29:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:01,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:29:01,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:29:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:29:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-28 20:29:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-28 20:29:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-28 20:29:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-28 20:29:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-28 20:29:01,882 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-28 20:29:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:29:01,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 20:29:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 20:29:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 20:29:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:29:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 20:29:01,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 20:29:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 20:29:01,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 20:29:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 20:29:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 20:29:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:29:01,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:29:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-28 20:29:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-28 20:29:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-28 20:29:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-28 20:29:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:29:01,889 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:29:02,013 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:29:02,015 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:29:02,208 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:29:02,362 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:29:02,362 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-28 20:29:02,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:29:02 BoogieIcfgContainer [2023-11-28 20:29:02,363 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:29:02,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:29:02,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:29:02,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:29:02,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:29:01" (1/3) ... [2023-11-28 20:29:02,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68af5b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:29:02, skipping insertion in model container [2023-11-28 20:29:02,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:29:01" (2/3) ... [2023-11-28 20:29:02,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68af5b84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:29:02, skipping insertion in model container [2023-11-28 20:29:02,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:29:02" (3/3) ... [2023-11-28 20:29:02,373 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2023-11-28 20:29:02,382 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 20:29:02,392 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:29:02,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:29:02,392 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:29:02,442 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-28 20:29:02,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 89 flow [2023-11-28 20:29:02,507 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2023-11-28 20:29:02,507 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 20:29:02,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2023-11-28 20:29:02,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 89 flow [2023-11-28 20:29:02,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2023-11-28 20:29:02,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:29:02,531 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2cb50682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:29:02,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-28 20:29:02,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:29:02,547 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2023-11-28 20:29:02,547 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 20:29:02,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:02,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:02,548 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:02,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:02,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1123511721, now seen corresponding path program 1 times [2023-11-28 20:29:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612860231] [2023-11-28 20:29:02,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:03,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:03,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612860231] [2023-11-28 20:29:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612860231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:29:03,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382037166] [2023-11-28 20:29:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:03,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:29:03,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:03,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:29:03,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:29:03,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 34 [2023-11-28 20:29:03,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:03,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:03,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 34 [2023-11-28 20:29:03,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:03,330 INFO L124 PetriNetUnfolderBase]: 359/616 cut-off events. [2023-11-28 20:29:03,330 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-28 20:29:03,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 616 events. 359/616 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2801 event pairs, 39 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 896. Up to 421 conditions per place. [2023-11-28 20:29:03,341 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 30 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2023-11-28 20:29:03,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 195 flow [2023-11-28 20:29:03,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:29:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:29:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2023-11-28 20:29:03,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2023-11-28 20:29:03,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 78 transitions. [2023-11-28 20:29:03,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 78 transitions. [2023-11-28 20:29:03,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:03,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 78 transitions. [2023-11-28 20:29:03,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:03,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:03,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:03,367 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 78 flow. Second operand 3 states and 78 transitions. [2023-11-28 20:29:03,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 195 flow [2023-11-28 20:29:03,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 173 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-28 20:29:03,375 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 92 flow [2023-11-28 20:29:03,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2023-11-28 20:29:03,380 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2023-11-28 20:29:03,381 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 92 flow [2023-11-28 20:29:03,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:03,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:03,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:03,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:29:03,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:03,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:03,383 INFO L85 PathProgramCache]: Analyzing trace with hash 851932553, now seen corresponding path program 1 times [2023-11-28 20:29:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954504706] [2023-11-28 20:29:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:03,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:03,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954504706] [2023-11-28 20:29:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954504706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:03,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:03,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324573310] [2023-11-28 20:29:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:03,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:29:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:03,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:29:03,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:29:03,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2023-11-28 20:29:03,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:03,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:03,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2023-11-28 20:29:03,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:04,191 INFO L124 PetriNetUnfolderBase]: 598/944 cut-off events. [2023-11-28 20:29:04,191 INFO L125 PetriNetUnfolderBase]: For 203/222 co-relation queries the response was YES. [2023-11-28 20:29:04,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2153 conditions, 944 events. 598/944 cut-off events. For 203/222 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4456 event pairs, 37 based on Foata normal form. 0/849 useless extension candidates. Maximal degree in co-relation 464. Up to 478 conditions per place. [2023-11-28 20:29:04,202 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 64 selfloop transitions, 18 changer transitions 0/90 dead transitions. [2023-11-28 20:29:04,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 90 transitions, 412 flow [2023-11-28 20:29:04,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:29:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:29:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2023-11-28 20:29:04,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6213235294117647 [2023-11-28 20:29:04,206 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 169 transitions. [2023-11-28 20:29:04,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 169 transitions. [2023-11-28 20:29:04,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:04,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 169 transitions. [2023-11-28 20:29:04,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,211 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,211 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 92 flow. Second operand 8 states and 169 transitions. [2023-11-28 20:29:04,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 90 transitions, 412 flow [2023-11-28 20:29:04,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 90 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:29:04,216 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 209 flow [2023-11-28 20:29:04,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=209, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2023-11-28 20:29:04,217 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2023-11-28 20:29:04,218 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 209 flow [2023-11-28 20:29:04,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:04,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:04,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:29:04,219 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:04,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:04,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1593507527, now seen corresponding path program 2 times [2023-11-28 20:29:04,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:04,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009602771] [2023-11-28 20:29:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:04,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:04,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009602771] [2023-11-28 20:29:04,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009602771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:29:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445270977] [2023-11-28 20:29:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:29:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:29:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:29:04,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2023-11-28 20:29:04,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 209 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:04,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2023-11-28 20:29:04,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:04,717 INFO L124 PetriNetUnfolderBase]: 710/1118 cut-off events. [2023-11-28 20:29:04,717 INFO L125 PetriNetUnfolderBase]: For 789/816 co-relation queries the response was YES. [2023-11-28 20:29:04,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3065 conditions, 1118 events. 710/1118 cut-off events. For 789/816 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5387 event pairs, 95 based on Foata normal form. 25/1114 useless extension candidates. Maximal degree in co-relation 2902. Up to 734 conditions per place. [2023-11-28 20:29:04,728 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 54 selfloop transitions, 21 changer transitions 3/86 dead transitions. [2023-11-28 20:29:04,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 86 transitions, 506 flow [2023-11-28 20:29:04,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:29:04,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:29:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2023-11-28 20:29:04,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6421568627450981 [2023-11-28 20:29:04,731 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 131 transitions. [2023-11-28 20:29:04,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 131 transitions. [2023-11-28 20:29:04,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:04,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 131 transitions. [2023-11-28 20:29:04,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,734 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,734 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 209 flow. Second operand 6 states and 131 transitions. [2023-11-28 20:29:04,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 86 transitions, 506 flow [2023-11-28 20:29:04,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:29:04,740 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 347 flow [2023-11-28 20:29:04,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2023-11-28 20:29:04,741 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2023-11-28 20:29:04,741 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 347 flow [2023-11-28 20:29:04,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:04,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:04,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:04,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:29:04,742 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:04,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:04,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1227087889, now seen corresponding path program 3 times [2023-11-28 20:29:04,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:04,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324076314] [2023-11-28 20:29:04,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:04,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:05,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:05,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324076314] [2023-11-28 20:29:05,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324076314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:05,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:05,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:05,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490705222] [2023-11-28 20:29:05,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:05,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:29:05,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:05,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:29:05,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:29:05,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2023-11-28 20:29:05,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 347 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:05,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:05,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2023-11-28 20:29:05,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:05,549 INFO L124 PetriNetUnfolderBase]: 1418/2106 cut-off events. [2023-11-28 20:29:05,549 INFO L125 PetriNetUnfolderBase]: For 1909/1930 co-relation queries the response was YES. [2023-11-28 20:29:05,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6224 conditions, 2106 events. 1418/2106 cut-off events. For 1909/1930 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 10700 event pairs, 221 based on Foata normal form. 33/2104 useless extension candidates. Maximal degree in co-relation 4908. Up to 995 conditions per place. [2023-11-28 20:29:05,575 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 91 selfloop transitions, 31 changer transitions 3/132 dead transitions. [2023-11-28 20:29:05,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 132 transitions, 857 flow [2023-11-28 20:29:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:29:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:29:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2023-11-28 20:29:05,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7226890756302521 [2023-11-28 20:29:05,577 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 172 transitions. [2023-11-28 20:29:05,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 172 transitions. [2023-11-28 20:29:05,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:05,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 172 transitions. [2023-11-28 20:29:05,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:05,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:05,610 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:05,610 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 347 flow. Second operand 7 states and 172 transitions. [2023-11-28 20:29:05,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 132 transitions, 857 flow [2023-11-28 20:29:05,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 132 transitions, 811 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-28 20:29:05,621 INFO L231 Difference]: Finished difference. Result has 62 places, 69 transitions, 498 flow [2023-11-28 20:29:05,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=498, PETRI_PLACES=62, PETRI_TRANSITIONS=69} [2023-11-28 20:29:05,622 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2023-11-28 20:29:05,623 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 69 transitions, 498 flow [2023-11-28 20:29:05,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:05,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:05,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:05,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:29:05,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:05,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1297419695, now seen corresponding path program 4 times [2023-11-28 20:29:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152794578] [2023-11-28 20:29:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:05,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152794578] [2023-11-28 20:29:05,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152794578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:05,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:05,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570085001] [2023-11-28 20:29:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:05,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:29:05,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:05,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:29:05,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:29:05,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2023-11-28 20:29:05,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 69 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:05,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:05,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2023-11-28 20:29:05,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:06,400 INFO L124 PetriNetUnfolderBase]: 1332/2050 cut-off events. [2023-11-28 20:29:06,400 INFO L125 PetriNetUnfolderBase]: For 4173/4229 co-relation queries the response was YES. [2023-11-28 20:29:06,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7147 conditions, 2050 events. 1332/2050 cut-off events. For 4173/4229 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10846 event pairs, 227 based on Foata normal form. 30/2052 useless extension candidates. Maximal degree in co-relation 5784. Up to 1207 conditions per place. [2023-11-28 20:29:06,426 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 62 selfloop transitions, 35 changer transitions 3/109 dead transitions. [2023-11-28 20:29:06,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 861 flow [2023-11-28 20:29:06,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:29:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 20:29:06,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2023-11-28 20:29:06,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5992647058823529 [2023-11-28 20:29:06,429 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 163 transitions. [2023-11-28 20:29:06,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 163 transitions. [2023-11-28 20:29:06,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:06,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 163 transitions. [2023-11-28 20:29:06,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 20.375) internal successors, (163), 8 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:06,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:06,432 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 34.0) internal successors, (306), 9 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:06,432 INFO L175 Difference]: Start difference. First operand has 62 places, 69 transitions, 498 flow. Second operand 8 states and 163 transitions. [2023-11-28 20:29:06,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 861 flow [2023-11-28 20:29:06,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 851 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-28 20:29:06,447 INFO L231 Difference]: Finished difference. Result has 71 places, 76 transitions, 642 flow [2023-11-28 20:29:06,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2023-11-28 20:29:06,449 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2023-11-28 20:29:06,449 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 642 flow [2023-11-28 20:29:06,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:06,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:06,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:06,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:29:06,450 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:06,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1625499077, now seen corresponding path program 1 times [2023-11-28 20:29:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:06,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690552305] [2023-11-28 20:29:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:06,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:06,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690552305] [2023-11-28 20:29:06,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690552305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:06,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:06,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:06,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597843026] [2023-11-28 20:29:06,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:29:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:06,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:29:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:29:06,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2023-11-28 20:29:06,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 642 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:06,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:06,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2023-11-28 20:29:06,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:07,421 INFO L124 PetriNetUnfolderBase]: 2224/3463 cut-off events. [2023-11-28 20:29:07,421 INFO L125 PetriNetUnfolderBase]: For 9406/9561 co-relation queries the response was YES. [2023-11-28 20:29:07,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12883 conditions, 3463 events. 2224/3463 cut-off events. For 9406/9561 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 19565 event pairs, 728 based on Foata normal form. 6/3217 useless extension candidates. Maximal degree in co-relation 11430. Up to 1938 conditions per place. [2023-11-28 20:29:07,465 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 75 selfloop transitions, 36 changer transitions 0/121 dead transitions. [2023-11-28 20:29:07,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 121 transitions, 1025 flow [2023-11-28 20:29:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:29:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:29:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2023-11-28 20:29:07,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6705882352941176 [2023-11-28 20:29:07,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 114 transitions. [2023-11-28 20:29:07,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 114 transitions. [2023-11-28 20:29:07,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:07,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 114 transitions. [2023-11-28 20:29:07,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:07,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:07,468 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:07,468 INFO L175 Difference]: Start difference. First operand has 71 places, 76 transitions, 642 flow. Second operand 5 states and 114 transitions. [2023-11-28 20:29:07,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 121 transitions, 1025 flow [2023-11-28 20:29:07,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 121 transitions, 975 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-28 20:29:07,502 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 755 flow [2023-11-28 20:29:07,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=755, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2023-11-28 20:29:07,503 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2023-11-28 20:29:07,504 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 755 flow [2023-11-28 20:29:07,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:07,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:07,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:07,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:29:07,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:07,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:07,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1709205711, now seen corresponding path program 2 times [2023-11-28 20:29:07,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:07,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336592] [2023-11-28 20:29:07,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:07,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:07,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336592] [2023-11-28 20:29:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:07,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:07,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:07,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187148550] [2023-11-28 20:29:07,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:07,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:29:07,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:07,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:29:07,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:29:07,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2023-11-28 20:29:07,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 755 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:07,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:07,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2023-11-28 20:29:07,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:08,576 INFO L124 PetriNetUnfolderBase]: 2919/4438 cut-off events. [2023-11-28 20:29:08,577 INFO L125 PetriNetUnfolderBase]: For 20600/20851 co-relation queries the response was YES. [2023-11-28 20:29:08,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19163 conditions, 4438 events. 2919/4438 cut-off events. For 20600/20851 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 25959 event pairs, 414 based on Foata normal form. 49/4449 useless extension candidates. Maximal degree in co-relation 18287. Up to 1922 conditions per place. [2023-11-28 20:29:08,633 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 124 selfloop transitions, 74 changer transitions 2/210 dead transitions. [2023-11-28 20:29:08,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 210 transitions, 2489 flow [2023-11-28 20:29:08,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:29:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:29:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2023-11-28 20:29:08,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2023-11-28 20:29:08,635 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 124 transitions. [2023-11-28 20:29:08,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 124 transitions. [2023-11-28 20:29:08,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:08,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 124 transitions. [2023-11-28 20:29:08,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:08,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:08,636 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:08,637 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 755 flow. Second operand 6 states and 124 transitions. [2023-11-28 20:29:08,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 210 transitions, 2489 flow [2023-11-28 20:29:08,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 210 transitions, 2349 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-11-28 20:29:08,701 INFO L231 Difference]: Finished difference. Result has 82 places, 136 transitions, 1687 flow [2023-11-28 20:29:08,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1687, PETRI_PLACES=82, PETRI_TRANSITIONS=136} [2023-11-28 20:29:08,702 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2023-11-28 20:29:08,702 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 136 transitions, 1687 flow [2023-11-28 20:29:08,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:08,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:08,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:08,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:29:08,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:08,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1060668215, now seen corresponding path program 1 times [2023-11-28 20:29:08,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:08,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239219381] [2023-11-28 20:29:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:08,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239219381] [2023-11-28 20:29:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239219381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:08,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547883621] [2023-11-28 20:29:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:08,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:29:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:08,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:29:08,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:29:09,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2023-11-28 20:29:09,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 136 transitions, 1687 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:09,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:09,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2023-11-28 20:29:09,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:10,006 INFO L124 PetriNetUnfolderBase]: 3533/5323 cut-off events. [2023-11-28 20:29:10,006 INFO L125 PetriNetUnfolderBase]: For 29722/30383 co-relation queries the response was YES. [2023-11-28 20:29:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25958 conditions, 5323 events. 3533/5323 cut-off events. For 29722/30383 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 30878 event pairs, 483 based on Foata normal form. 301/5501 useless extension candidates. Maximal degree in co-relation 22177. Up to 2654 conditions per place. [2023-11-28 20:29:10,046 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 162 selfloop transitions, 52 changer transitions 3/227 dead transitions. [2023-11-28 20:29:10,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 227 transitions, 2939 flow [2023-11-28 20:29:10,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:29:10,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 20:29:10,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2023-11-28 20:29:10,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2023-11-28 20:29:10,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 154 transitions. [2023-11-28 20:29:10,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 154 transitions. [2023-11-28 20:29:10,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:10,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 154 transitions. [2023-11-28 20:29:10,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:10,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:10,049 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 34.0) internal successors, (272), 8 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:10,049 INFO L175 Difference]: Start difference. First operand has 82 places, 136 transitions, 1687 flow. Second operand 7 states and 154 transitions. [2023-11-28 20:29:10,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 227 transitions, 2939 flow [2023-11-28 20:29:10,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 227 transitions, 2909 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-11-28 20:29:10,116 INFO L231 Difference]: Finished difference. Result has 93 places, 139 transitions, 1908 flow [2023-11-28 20:29:10,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1908, PETRI_PLACES=93, PETRI_TRANSITIONS=139} [2023-11-28 20:29:10,117 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 56 predicate places. [2023-11-28 20:29:10,117 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 139 transitions, 1908 flow [2023-11-28 20:29:10,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:10,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:10,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:10,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:29:10,118 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:10,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:10,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1637369743, now seen corresponding path program 3 times [2023-11-28 20:29:10,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:10,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021209712] [2023-11-28 20:29:10,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:10,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:10,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:10,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021209712] [2023-11-28 20:29:10,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021209712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:10,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:10,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:10,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401368496] [2023-11-28 20:29:10,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:10,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:29:10,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:10,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:29:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:29:10,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2023-11-28 20:29:10,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 139 transitions, 1908 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:10,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:10,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2023-11-28 20:29:10,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:11,464 INFO L124 PetriNetUnfolderBase]: 4280/6827 cut-off events. [2023-11-28 20:29:11,464 INFO L125 PetriNetUnfolderBase]: For 42679/43339 co-relation queries the response was YES. [2023-11-28 20:29:11,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34432 conditions, 6827 events. 4280/6827 cut-off events. For 42679/43339 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 44674 event pairs, 1090 based on Foata normal form. 65/6821 useless extension candidates. Maximal degree in co-relation 28948. Up to 3311 conditions per place. [2023-11-28 20:29:11,547 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 98 selfloop transitions, 133 changer transitions 3/247 dead transitions. [2023-11-28 20:29:11,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 247 transitions, 3585 flow [2023-11-28 20:29:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:29:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:29:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2023-11-28 20:29:11,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6519607843137255 [2023-11-28 20:29:11,549 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 133 transitions. [2023-11-28 20:29:11,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 133 transitions. [2023-11-28 20:29:11,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:11,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 133 transitions. [2023-11-28 20:29:11,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:11,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:11,552 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:11,552 INFO L175 Difference]: Start difference. First operand has 93 places, 139 transitions, 1908 flow. Second operand 6 states and 133 transitions. [2023-11-28 20:29:11,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 247 transitions, 3585 flow [2023-11-28 20:29:11,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 247 transitions, 3575 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-11-28 20:29:11,719 INFO L231 Difference]: Finished difference. Result has 101 places, 190 transitions, 3176 flow [2023-11-28 20:29:11,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3176, PETRI_PLACES=101, PETRI_TRANSITIONS=190} [2023-11-28 20:29:11,721 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 64 predicate places. [2023-11-28 20:29:11,721 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 190 transitions, 3176 flow [2023-11-28 20:29:11,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:11,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:11,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:11,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:29:11,722 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:11,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:11,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1722166531, now seen corresponding path program 4 times [2023-11-28 20:29:11,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:11,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321633557] [2023-11-28 20:29:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321633557] [2023-11-28 20:29:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321633557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:12,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660750452] [2023-11-28 20:29:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:12,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:29:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:29:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:29:12,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2023-11-28 20:29:12,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 190 transitions, 3176 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:12,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:12,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2023-11-28 20:29:12,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:13,355 INFO L124 PetriNetUnfolderBase]: 4405/7124 cut-off events. [2023-11-28 20:29:13,355 INFO L125 PetriNetUnfolderBase]: For 58572/59324 co-relation queries the response was YES. [2023-11-28 20:29:13,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39521 conditions, 7124 events. 4405/7124 cut-off events. For 58572/59324 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 48374 event pairs, 686 based on Foata normal form. 86/7149 useless extension candidates. Maximal degree in co-relation 33250. Up to 2563 conditions per place. [2023-11-28 20:29:13,408 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 135 selfloop transitions, 145 changer transitions 6/299 dead transitions. [2023-11-28 20:29:13,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 299 transitions, 4992 flow [2023-11-28 20:29:13,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:29:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:29:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2023-11-28 20:29:13,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6568627450980392 [2023-11-28 20:29:13,410 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 134 transitions. [2023-11-28 20:29:13,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 134 transitions. [2023-11-28 20:29:13,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:13,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 134 transitions. [2023-11-28 20:29:13,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:13,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:13,412 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:13,412 INFO L175 Difference]: Start difference. First operand has 101 places, 190 transitions, 3176 flow. Second operand 6 states and 134 transitions. [2023-11-28 20:29:13,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 299 transitions, 4992 flow [2023-11-28 20:29:13,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 299 transitions, 4947 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-28 20:29:13,531 INFO L231 Difference]: Finished difference. Result has 109 places, 228 transitions, 4351 flow [2023-11-28 20:29:13,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3140, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4351, PETRI_PLACES=109, PETRI_TRANSITIONS=228} [2023-11-28 20:29:13,532 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 72 predicate places. [2023-11-28 20:29:13,532 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 228 transitions, 4351 flow [2023-11-28 20:29:13,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:13,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:13,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:13,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:29:13,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:13,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:13,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1169430289, now seen corresponding path program 2 times [2023-11-28 20:29:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680221512] [2023-11-28 20:29:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:13,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:13,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680221512] [2023-11-28 20:29:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680221512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 20:29:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099949927] [2023-11-28 20:29:13,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:13,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:29:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:29:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:29:13,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2023-11-28 20:29:13,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 228 transitions, 4351 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:13,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:13,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2023-11-28 20:29:13,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:14,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 32#L53true, 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#L99-4true, Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 6#L83true, Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,500 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,500 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-28 20:29:14,500 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-28 20:29:14,500 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-28 20:29:14,657 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 32#L53true, 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#true, 6#L83true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, 5#L100-1true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,657 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,657 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,657 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,657 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#L99-4true, Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 6#L83true, Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 12#thread1EXITtrue, Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,659 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,660 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,660 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,660 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#L99-4true, Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 3#L45true, Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 6#L83true, Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,661 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,661 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,661 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,661 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-28 20:29:14,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#true, 6#L83true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, 5#L100-1true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 12#thread1EXITtrue, Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,795 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-28 20:29:14,795 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,796 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,796 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 3#L45true, 6#L83true, Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 173#true, Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 5#L100-1true, Black: 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,797 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-28 20:29:14,797 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,797 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,797 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 119#true, Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, 165#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 16#L99-4true, Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 6#L83true, Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), 149#true, Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), Black: 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 13#L50true, Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,801 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-28 20:29:14,801 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,801 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,801 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-28 20:29:14,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), 6#L83true, Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 173#true, Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 34#L100-2true, 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,947 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-28 20:29:14,947 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,948 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 119#true, Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 165#(and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 6#L83true, Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), 149#true, 173#true, Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 5#L100-1true, Black: 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), 13#L50true, Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,948 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-28 20:29:14,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,948 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-28 20:29:14,987 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 24#L101-1true, Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), 7#thread2EXITtrue, Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#true, 6#L83true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:14,988 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-28 20:29:14,988 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-28 20:29:14,988 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-28 20:29:14,988 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-28 20:29:15,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 18#L101-2true, 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 161#true, 6#L83true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:15,011 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-28 20:29:15,011 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-28 20:29:15,011 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-28 20:29:15,011 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-28 20:29:15,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([276] L80-->L83: Formula: (and (= (+ v_~L~0_14 1) v_~L~0_15) (= v_~q~0_13 (+ v_~q~0_14 v_~M~0_22))) InVars {~q~0=v_~q~0_14, ~M~0=v_~M~0_22, ~L~0=v_~L~0_15} OutVars{~q~0=v_~q~0_13, ~M~0=v_~M~0_22, ~L~0=v_~L~0_14, thread3Thread1of1ForFork0_#t~post2=|v_thread3Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~L~0, ~q~0, thread3Thread1of1ForFork0_#t~post2][100], [Black: 56#(and (= ~N~0 ~L~0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 58#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 123#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 52#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 127#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 125#(and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 79#true, 133#true, Black: 69#(= ~N~0 ~L~0), Black: 73#(and (= ~N~0 ~L~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= (+ (* 4294967296 (div ~L~0 4294967296)) 1) ~L~0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 167#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 71#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 140#(and (= ~N~0 ~L~0) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 138#(not (= ~L~0 (* 4294967296 (div ~L~0 4294967296)))), Black: 135#(= ~N~0 ~L~0), Black: 142#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork1_~cond~0 1)), 49#true, Black: 83#(and (or (< ~L~0 (+ (* 4294967296 (div ~L~0 4294967296)) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0)), Black: 86#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)), Black: 84#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 82#(and (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), 121#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), Black: 152#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), Black: 155#(and (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1))) (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 101#(and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 96#(<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0), Black: 97#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), 6#L83true, Black: 161#true, Black: 164#(and (or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1)))), 151#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 163#(or (and (<= ~N~0 (+ (* (div ~N~0 4294967296) 4294967296) 1)) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (<= (+ 2 (* (div ~N~0 4294967296) 4294967296)) ~N~0) (= thread2Thread1of1ForFork2_~cond~1 1))), 173#true, Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 112#(and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), 25#L102-1true, Black: 114#(and (= thread2Thread1of1ForFork2_~cond~1 0) (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 108#(or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))), Black: 60#(and (<= ~L~0 (* 4294967296 (div ~L~0 4294967296))) (or (and (<= ~N~0 (* (div ~N~0 4294967296) 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (<= (+ (* (div ~N~0 4294967296) 4294967296) 1) ~N~0) (= thread1Thread1of1ForFork1_~cond~0 1))) (or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))), Black: 51#(or (= ~N~0 ~L~0) (< (* (div ~N~0 4294967296) 4294967296) ~N~0))]) [2023-11-28 20:29:15,028 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-28 20:29:15,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-28 20:29:15,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-28 20:29:15,028 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-28 20:29:15,060 INFO L124 PetriNetUnfolderBase]: 4212/6830 cut-off events. [2023-11-28 20:29:15,061 INFO L125 PetriNetUnfolderBase]: For 82007/83732 co-relation queries the response was YES. [2023-11-28 20:29:15,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43175 conditions, 6830 events. 4212/6830 cut-off events. For 82007/83732 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 45746 event pairs, 829 based on Foata normal form. 376/7026 useless extension candidates. Maximal degree in co-relation 33523. Up to 5723 conditions per place. [2023-11-28 20:29:15,118 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 162 selfloop transitions, 78 changer transitions 2/262 dead transitions. [2023-11-28 20:29:15,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 262 transitions, 5090 flow [2023-11-28 20:29:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:29:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 20:29:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2023-11-28 20:29:15,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2023-11-28 20:29:15,120 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 113 transitions. [2023-11-28 20:29:15,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 113 transitions. [2023-11-28 20:29:15,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:15,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 113 transitions. [2023-11-28 20:29:15,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:15,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:15,122 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:15,122 INFO L175 Difference]: Start difference. First operand has 109 places, 228 transitions, 4351 flow. Second operand 5 states and 113 transitions. [2023-11-28 20:29:15,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 262 transitions, 5090 flow [2023-11-28 20:29:15,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 262 transitions, 5018 flow, removed 36 selfloop flow, removed 0 redundant places. [2023-11-28 20:29:15,297 INFO L231 Difference]: Finished difference. Result has 115 places, 233 transitions, 4649 flow [2023-11-28 20:29:15,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4287, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4649, PETRI_PLACES=115, PETRI_TRANSITIONS=233} [2023-11-28 20:29:15,298 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 78 predicate places. [2023-11-28 20:29:15,298 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 233 transitions, 4649 flow [2023-11-28 20:29:15,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:15,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:15,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:15,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:29:15,298 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:15,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:15,299 INFO L85 PathProgramCache]: Analyzing trace with hash -877644617, now seen corresponding path program 5 times [2023-11-28 20:29:15,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:15,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486501103] [2023-11-28 20:29:15,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:15,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:15,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486501103] [2023-11-28 20:29:15,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486501103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:29:15,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:29:15,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:29:15,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161631945] [2023-11-28 20:29:15,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:29:15,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 20:29:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:15,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 20:29:15,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-28 20:29:15,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2023-11-28 20:29:15,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 233 transitions, 4649 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:15,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:15,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2023-11-28 20:29:15,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:16,859 INFO L124 PetriNetUnfolderBase]: 5313/8253 cut-off events. [2023-11-28 20:29:16,859 INFO L125 PetriNetUnfolderBase]: For 83618/84278 co-relation queries the response was YES. [2023-11-28 20:29:16,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50034 conditions, 8253 events. 5313/8253 cut-off events. For 83618/84278 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 52509 event pairs, 1312 based on Foata normal form. 40/8248 useless extension candidates. Maximal degree in co-relation 42079. Up to 4288 conditions per place. [2023-11-28 20:29:17,001 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 111 selfloop transitions, 184 changer transitions 4/309 dead transitions. [2023-11-28 20:29:17,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 309 transitions, 5931 flow [2023-11-28 20:29:17,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:29:17,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:29:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2023-11-28 20:29:17,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2023-11-28 20:29:17,003 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 132 transitions. [2023-11-28 20:29:17,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 132 transitions. [2023-11-28 20:29:17,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:17,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 132 transitions. [2023-11-28 20:29:17,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:17,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:17,005 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:17,005 INFO L175 Difference]: Start difference. First operand has 115 places, 233 transitions, 4649 flow. Second operand 6 states and 132 transitions. [2023-11-28 20:29:17,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 309 transitions, 5931 flow [2023-11-28 20:29:17,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 309 transitions, 5845 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:29:17,188 INFO L231 Difference]: Finished difference. Result has 121 places, 248 transitions, 5317 flow [2023-11-28 20:29:17,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4549, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5317, PETRI_PLACES=121, PETRI_TRANSITIONS=248} [2023-11-28 20:29:17,189 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 84 predicate places. [2023-11-28 20:29:17,189 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 248 transitions, 5317 flow [2023-11-28 20:29:17,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:17,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:17,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:17,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:29:17,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:17,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:17,190 INFO L85 PathProgramCache]: Analyzing trace with hash 326785423, now seen corresponding path program 6 times [2023-11-28 20:29:17,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:17,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620446610] [2023-11-28 20:29:17,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:17,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:17,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:17,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620446610] [2023-11-28 20:29:17,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620446610] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:29:17,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305782502] [2023-11-28 20:29:17,481 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-28 20:29:17,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:29:17,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:17,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:29:17,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-28 20:29:17,601 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-28 20:29:17,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:29:17,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 20:29:17,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:17,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:18,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305782502] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:29:18,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:29:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2023-11-28 20:29:18,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955293867] [2023-11-28 20:29:18,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:29:18,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:29:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:18,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:29:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:29:18,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-28 20:29:18,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 248 transitions, 5317 flow. Second operand has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:18,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:18,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-28 20:29:18,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:22,253 INFO L124 PetriNetUnfolderBase]: 9860/14592 cut-off events. [2023-11-28 20:29:22,253 INFO L125 PetriNetUnfolderBase]: For 172615/172615 co-relation queries the response was YES. [2023-11-28 20:29:22,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93015 conditions, 14592 events. 9860/14592 cut-off events. For 172615/172615 co-relation queries the response was YES. Maximal size of possible extension queue 814. Compared 89808 event pairs, 445 based on Foata normal form. 230/14817 useless extension candidates. Maximal degree in co-relation 80915. Up to 3329 conditions per place. [2023-11-28 20:29:22,551 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 279 selfloop transitions, 398 changer transitions 94/775 dead transitions. [2023-11-28 20:29:22,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 775 transitions, 13199 flow [2023-11-28 20:29:22,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-28 20:29:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-28 20:29:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 576 transitions. [2023-11-28 20:29:22,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5841784989858012 [2023-11-28 20:29:22,555 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 576 transitions. [2023-11-28 20:29:22,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 576 transitions. [2023-11-28 20:29:22,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:22,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 576 transitions. [2023-11-28 20:29:22,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 19.862068965517242) internal successors, (576), 29 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:22,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 34.0) internal successors, (1020), 30 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:22,560 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 34.0) internal successors, (1020), 30 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:22,560 INFO L175 Difference]: Start difference. First operand has 121 places, 248 transitions, 5317 flow. Second operand 29 states and 576 transitions. [2023-11-28 20:29:22,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 775 transitions, 13199 flow [2023-11-28 20:29:23,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 775 transitions, 12860 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-28 20:29:23,063 INFO L231 Difference]: Finished difference. Result has 170 places, 460 transitions, 10312 flow [2023-11-28 20:29:23,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4740, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=10312, PETRI_PLACES=170, PETRI_TRANSITIONS=460} [2023-11-28 20:29:23,064 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 133 predicate places. [2023-11-28 20:29:23,064 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 460 transitions, 10312 flow [2023-11-28 20:29:23,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.25) internal successors, (147), 12 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:23,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:23,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:23,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:29:23,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-28 20:29:23,265 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:23,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 722719631, now seen corresponding path program 1 times [2023-11-28 20:29:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192202760] [2023-11-28 20:29:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192202760] [2023-11-28 20:29:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192202760] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:29:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609148062] [2023-11-28 20:29:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:23,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:29:23,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:23,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:29:23,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-28 20:29:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:23,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 20:29:23,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:23,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609148062] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:29:24,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:29:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-28 20:29:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335658507] [2023-11-28 20:29:24,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:29:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:29:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:29:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-11-28 20:29:24,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34 [2023-11-28 20:29:24,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 460 transitions, 10312 flow. Second operand has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:24,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:24,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34 [2023-11-28 20:29:24,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:28,228 INFO L124 PetriNetUnfolderBase]: 9101/15272 cut-off events. [2023-11-28 20:29:28,228 INFO L125 PetriNetUnfolderBase]: For 321924/323872 co-relation queries the response was YES. [2023-11-28 20:29:28,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125369 conditions, 15272 events. 9101/15272 cut-off events. For 321924/323872 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 118090 event pairs, 542 based on Foata normal form. 732/15740 useless extension candidates. Maximal degree in co-relation 119422. Up to 7625 conditions per place. [2023-11-28 20:29:28,450 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 321 selfloop transitions, 382 changer transitions 4/887 dead transitions. [2023-11-28 20:29:28,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 887 transitions, 19680 flow [2023-11-28 20:29:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 20:29:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 20:29:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 241 transitions. [2023-11-28 20:29:28,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7088235294117647 [2023-11-28 20:29:28,452 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 241 transitions. [2023-11-28 20:29:28,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 241 transitions. [2023-11-28 20:29:28,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:28,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 241 transitions. [2023-11-28 20:29:28,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:28,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 34.0) internal successors, (374), 11 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:28,454 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 34.0) internal successors, (374), 11 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:28,454 INFO L175 Difference]: Start difference. First operand has 170 places, 460 transitions, 10312 flow. Second operand 10 states and 241 transitions. [2023-11-28 20:29:28,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 887 transitions, 19680 flow [2023-11-28 20:29:29,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 887 transitions, 18494 flow, removed 444 selfloop flow, removed 14 redundant places. [2023-11-28 20:29:29,928 INFO L231 Difference]: Finished difference. Result has 162 places, 777 transitions, 17483 flow [2023-11-28 20:29:29,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=9578, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17483, PETRI_PLACES=162, PETRI_TRANSITIONS=777} [2023-11-28 20:29:29,929 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 125 predicate places. [2023-11-28 20:29:29,929 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 777 transitions, 17483 flow [2023-11-28 20:29:29,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.666666666666668) internal successors, (200), 12 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:29,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:29,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:29,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-28 20:29:30,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-28 20:29:30,130 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:30,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:30,131 INFO L85 PathProgramCache]: Analyzing trace with hash -821637907, now seen corresponding path program 2 times [2023-11-28 20:29:30,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:30,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001372788] [2023-11-28 20:29:30,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:30,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:30,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001372788] [2023-11-28 20:29:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001372788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:29:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598617101] [2023-11-28 20:29:30,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:29:30,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:29:30,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:30,359 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:29:30,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-28 20:29:30,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:29:30,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:29:30,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-28 20:29:30,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:30,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598617101] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:29:31,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:29:31,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-11-28 20:29:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046325586] [2023-11-28 20:29:31,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:29:31,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-28 20:29:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-28 20:29:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-28 20:29:31,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2023-11-28 20:29:31,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 777 transitions, 17483 flow. Second operand has 15 states, 15 states have (on average 14.4) internal successors, (216), 15 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:31,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:31,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2023-11-28 20:29:31,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:33,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:29:40,496 INFO L124 PetriNetUnfolderBase]: 17090/26806 cut-off events. [2023-11-28 20:29:40,496 INFO L125 PetriNetUnfolderBase]: For 562454/564369 co-relation queries the response was YES. [2023-11-28 20:29:40,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215738 conditions, 26806 events. 17090/26806 cut-off events. For 562454/564369 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 202486 event pairs, 857 based on Foata normal form. 941/27583 useless extension candidates. Maximal degree in co-relation 208552. Up to 10017 conditions per place. [2023-11-28 20:29:40,966 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 769 selfloop transitions, 748 changer transitions 8/1560 dead transitions. [2023-11-28 20:29:40,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1560 transitions, 35198 flow [2023-11-28 20:29:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-28 20:29:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-28 20:29:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 345 transitions. [2023-11-28 20:29:40,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2023-11-28 20:29:40,969 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 345 transitions. [2023-11-28 20:29:40,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 345 transitions. [2023-11-28 20:29:40,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:40,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 345 transitions. [2023-11-28 20:29:40,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 23.0) internal successors, (345), 15 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:40,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 34.0) internal successors, (544), 16 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:40,972 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 34.0) internal successors, (544), 16 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:40,972 INFO L175 Difference]: Start difference. First operand has 162 places, 777 transitions, 17483 flow. Second operand 15 states and 345 transitions. [2023-11-28 20:29:40,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1560 transitions, 35198 flow [2023-11-28 20:29:44,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 1560 transitions, 34447 flow, removed 348 selfloop flow, removed 1 redundant places. [2023-11-28 20:29:44,833 INFO L231 Difference]: Finished difference. Result has 181 places, 1079 transitions, 25970 flow [2023-11-28 20:29:44,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=16848, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=505, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=25970, PETRI_PLACES=181, PETRI_TRANSITIONS=1079} [2023-11-28 20:29:44,834 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 144 predicate places. [2023-11-28 20:29:44,835 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 1079 transitions, 25970 flow [2023-11-28 20:29:44,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.4) internal successors, (216), 15 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:44,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:29:44,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:29:44,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-28 20:29:45,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-28 20:29:45,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:29:45,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:29:45,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1836420285, now seen corresponding path program 3 times [2023-11-28 20:29:45,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:29:45,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510423786] [2023-11-28 20:29:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:29:45,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:29:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:29:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:45,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:29:45,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510423786] [2023-11-28 20:29:45,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510423786] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:29:45,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368150377] [2023-11-28 20:29:45,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:29:45,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:29:45,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:29:45,399 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:29:45,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-28 20:29:45,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-28 20:29:45,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:29:45,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-28 20:29:45,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:29:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:45,650 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:29:46,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368150377] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:29:46,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:29:46,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-11-28 20:29:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621085438] [2023-11-28 20:29:46,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:29:46,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-28 20:29:46,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:29:46,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-28 20:29:46,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-28 20:29:46,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2023-11-28 20:29:46,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 1079 transitions, 25970 flow. Second operand has 13 states, 13 states have (on average 15.0) internal successors, (195), 13 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:46,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:29:46,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2023-11-28 20:29:46,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:29:56,486 INFO L124 PetriNetUnfolderBase]: 19516/30462 cut-off events. [2023-11-28 20:29:56,487 INFO L125 PetriNetUnfolderBase]: For 746790/749020 co-relation queries the response was YES. [2023-11-28 20:29:56,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264010 conditions, 30462 events. 19516/30462 cut-off events. For 746790/749020 co-relation queries the response was YES. Maximal size of possible extension queue 2035. Compared 232753 event pairs, 1698 based on Foata normal form. 865/31090 useless extension candidates. Maximal degree in co-relation 256650. Up to 21865 conditions per place. [2023-11-28 20:29:57,044 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 1005 selfloop transitions, 504 changer transitions 5/1549 dead transitions. [2023-11-28 20:29:57,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1549 transitions, 39321 flow [2023-11-28 20:29:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-28 20:29:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-28 20:29:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 225 transitions. [2023-11-28 20:29:57,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6016042780748663 [2023-11-28 20:29:57,046 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 225 transitions. [2023-11-28 20:29:57,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 225 transitions. [2023-11-28 20:29:57,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:29:57,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 225 transitions. [2023-11-28 20:29:57,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 20.454545454545453) internal successors, (225), 11 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:57,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 34.0) internal successors, (408), 12 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:57,049 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 34.0) internal successors, (408), 12 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:29:57,049 INFO L175 Difference]: Start difference. First operand has 181 places, 1079 transitions, 25970 flow. Second operand 11 states and 225 transitions. [2023-11-28 20:29:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 1549 transitions, 39321 flow [2023-11-28 20:30:04,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 1549 transitions, 38537 flow, removed 296 selfloop flow, removed 5 redundant places. [2023-11-28 20:30:04,995 INFO L231 Difference]: Finished difference. Result has 189 places, 1306 transitions, 33074 flow [2023-11-28 20:30:04,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=25270, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1079, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=33074, PETRI_PLACES=189, PETRI_TRANSITIONS=1306} [2023-11-28 20:30:04,996 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 152 predicate places. [2023-11-28 20:30:04,997 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 1306 transitions, 33074 flow [2023-11-28 20:30:04,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.0) internal successors, (195), 13 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:04,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:30:04,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:05,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-28 20:30:05,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-28 20:30:05,197 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:30:05,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2103439181, now seen corresponding path program 1 times [2023-11-28 20:30:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763143488] [2023-11-28 20:30:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:30:05,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:05,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763143488] [2023-11-28 20:30:05,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763143488] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:30:05,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397162933] [2023-11-28 20:30:05,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:05,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:30:05,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:30:05,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:30:05,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-28 20:30:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:05,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-28 20:30:05,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:30:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-28 20:30:05,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:30:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:30:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397162933] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:30:06,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:30:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 18 [2023-11-28 20:30:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123461400] [2023-11-28 20:30:06,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:30:06,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-28 20:30:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:06,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-28 20:30:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2023-11-28 20:30:06,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-28 20:30:06,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1306 transitions, 33074 flow. Second operand has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 18 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:06,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:30:06,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-28 20:30:06,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:30:28,478 INFO L124 PetriNetUnfolderBase]: 39090/57030 cut-off events. [2023-11-28 20:30:28,478 INFO L125 PetriNetUnfolderBase]: For 1434408/1434408 co-relation queries the response was YES. [2023-11-28 20:30:28,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500430 conditions, 57030 events. 39090/57030 cut-off events. For 1434408/1434408 co-relation queries the response was YES. Maximal size of possible extension queue 3222. Compared 411122 event pairs, 761 based on Foata normal form. 294/57323 useless extension candidates. Maximal degree in co-relation 492908. Up to 13517 conditions per place. [2023-11-28 20:30:29,254 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 1833 selfloop transitions, 1602 changer transitions 7/3446 dead transitions. [2023-11-28 20:30:29,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 3446 transitions, 84729 flow [2023-11-28 20:30:29,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-28 20:30:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-28 20:30:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 623 transitions. [2023-11-28 20:30:29,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5552584670231729 [2023-11-28 20:30:29,257 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 623 transitions. [2023-11-28 20:30:29,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 623 transitions. [2023-11-28 20:30:29,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:30:29,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 623 transitions. [2023-11-28 20:30:29,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 18.87878787878788) internal successors, (623), 33 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:29,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 34.0) internal successors, (1156), 34 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:29,263 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 34.0) internal successors, (1156), 34 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:29,263 INFO L175 Difference]: Start difference. First operand has 189 places, 1306 transitions, 33074 flow. Second operand 33 states and 623 transitions. [2023-11-28 20:30:29,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 3446 transitions, 84729 flow [2023-11-28 20:30:51,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 3446 transitions, 84126 flow, removed 254 selfloop flow, removed 3 redundant places. [2023-11-28 20:30:51,424 INFO L231 Difference]: Finished difference. Result has 242 places, 2675 transitions, 70710 flow [2023-11-28 20:30:51,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=32642, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=482, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=70710, PETRI_PLACES=242, PETRI_TRANSITIONS=2675} [2023-11-28 20:30:51,425 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 205 predicate places. [2023-11-28 20:30:51,425 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 2675 transitions, 70710 flow [2023-11-28 20:30:51,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.666666666666666) internal successors, (174), 18 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:51,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:30:51,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:30:51,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-28 20:30:51,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-28 20:30:51,626 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:30:51,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:51,627 INFO L85 PathProgramCache]: Analyzing trace with hash 940770555, now seen corresponding path program 2 times [2023-11-28 20:30:51,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:30:51,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001285845] [2023-11-28 20:30:51,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:30:51,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:30:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:30:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:30:51,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:30:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001285845] [2023-11-28 20:30:51,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001285845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:30:51,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077359797] [2023-11-28 20:30:51,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:30:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:30:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:30:51,844 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:30:51,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-28 20:30:51,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:30:51,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:30:51,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-28 20:30:51,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:30:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:30:52,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:30:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:30:52,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077359797] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:30:52,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:30:52,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 21 [2023-11-28 20:30:52,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250513620] [2023-11-28 20:30:52,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:30:52,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-28 20:30:52,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:30:52,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-28 20:30:52,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2023-11-28 20:30:52,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-28 20:30:52,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 2675 transitions, 70710 flow. Second operand has 22 states, 22 states have (on average 9.318181818181818) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:52,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:30:52,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-28 20:30:52,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:32:07,508 INFO L124 PetriNetUnfolderBase]: 58863/87006 cut-off events. [2023-11-28 20:32:07,508 INFO L125 PetriNetUnfolderBase]: For 3027334/3027334 co-relation queries the response was YES. [2023-11-28 20:32:08,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869700 conditions, 87006 events. 58863/87006 cut-off events. For 3027334/3027334 co-relation queries the response was YES. Maximal size of possible extension queue 4522. Compared 666550 event pairs, 1576 based on Foata normal form. 4418/91423 useless extension candidates. Maximal degree in co-relation 868814. Up to 20101 conditions per place. [2023-11-28 20:32:08,999 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 3212 selfloop transitions, 3834 changer transitions 11/7061 dead transitions. [2023-11-28 20:32:08,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 7061 transitions, 181992 flow [2023-11-28 20:32:09,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-11-28 20:32:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-11-28 20:32:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 1605 transitions. [2023-11-28 20:32:09,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5364304812834224 [2023-11-28 20:32:09,006 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 1605 transitions. [2023-11-28 20:32:09,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 1605 transitions. [2023-11-28 20:32:09,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:32:09,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 1605 transitions. [2023-11-28 20:32:09,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 18.238636363636363) internal successors, (1605), 88 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:32:09,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 34.0) internal successors, (3026), 89 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:32:09,019 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 34.0) internal successors, (3026), 89 states have internal predecessors, (3026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:32:09,019 INFO L175 Difference]: Start difference. First operand has 242 places, 2675 transitions, 70710 flow. Second operand 88 states and 1605 transitions. [2023-11-28 20:32:09,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 7061 transitions, 181992 flow [2023-11-28 20:34:06,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 7061 transitions, 176419 flow, removed 2623 selfloop flow, removed 6 redundant places. [2023-11-28 20:34:07,007 INFO L231 Difference]: Finished difference. Result has 375 places, 5470 transitions, 148469 flow [2023-11-28 20:34:07,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=63043, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1323, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=747, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=148469, PETRI_PLACES=375, PETRI_TRANSITIONS=5470} [2023-11-28 20:34:07,010 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 338 predicate places. [2023-11-28 20:34:07,010 INFO L495 AbstractCegarLoop]: Abstraction has has 375 places, 5470 transitions, 148469 flow [2023-11-28 20:34:07,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.318181818181818) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:34:07,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:34:07,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 20:34:07,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-28 20:34:07,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-28 20:34:07,212 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-28 20:34:07,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:34:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 593048575, now seen corresponding path program 3 times [2023-11-28 20:34:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:34:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299665424] [2023-11-28 20:34:07,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:34:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:34:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:34:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:07,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:34:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299665424] [2023-11-28 20:34:07,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299665424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-28 20:34:07,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732227729] [2023-11-28 20:34:07,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:34:07,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-28 20:34:07,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:34:07,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-28 20:34:07,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae42ba60-42db-42a7-9d8d-018a15199ab2/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-28 20:34:07,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-28 20:34:07,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:34:07,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-28 20:34:07,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:34:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:07,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:34:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:34:08,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732227729] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:34:08,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-28 20:34:08,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 22 [2023-11-28 20:34:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922934693] [2023-11-28 20:34:08,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-28 20:34:08,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-28 20:34:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:34:08,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-28 20:34:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2023-11-28 20:34:08,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-28 20:34:08,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 5470 transitions, 148469 flow. Second operand has 23 states, 23 states have (on average 9.173913043478262) internal successors, (211), 23 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:34:08,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:34:08,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-28 20:34:08,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:39:20,550 INFO L124 PetriNetUnfolderBase]: 122233/181054 cut-off events. [2023-11-28 20:39:20,550 INFO L125 PetriNetUnfolderBase]: For 8410686/8410688 co-relation queries the response was YES. [2023-11-28 20:39:23,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2106325 conditions, 181054 events. 122233/181054 cut-off events. For 8410686/8410688 co-relation queries the response was YES. Maximal size of possible extension queue 7568. Compared 1478832 event pairs, 675 based on Foata normal form. 4654/185707 useless extension candidates. Maximal degree in co-relation 2103031. Up to 40883 conditions per place. [2023-11-28 20:39:24,767 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 7791 selfloop transitions, 10079 changer transitions 24/17898 dead transitions. [2023-11-28 20:39:24,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 17898 transitions, 507240 flow [2023-11-28 20:39:24,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-11-28 20:39:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2023-11-28 20:39:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 2191 transitions. [2023-11-28 20:39:24,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5461116650049851 [2023-11-28 20:39:24,773 INFO L72 ComplementDD]: Start complementDD. Operand 118 states and 2191 transitions. [2023-11-28 20:39:24,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 2191 transitions. [2023-11-28 20:39:24,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:39:24,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 2191 transitions. [2023-11-28 20:39:24,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 119 states, 118 states have (on average 18.56779661016949) internal successors, (2191), 118 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:24,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 119 states, 119 states have (on average 34.0) internal successors, (4046), 119 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:24,789 INFO L81 ComplementDD]: Finished complementDD. Result has 119 states, 119 states have (on average 34.0) internal successors, (4046), 119 states have internal predecessors, (4046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:39:24,789 INFO L175 Difference]: Start difference. First operand has 375 places, 5470 transitions, 148469 flow. Second operand 118 states and 2191 transitions. [2023-11-28 20:39:24,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 17898 transitions, 507240 flow