./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:36:20,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:36:20,568 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:36:20,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:36:20,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:36:20,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:36:20,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:36:20,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:36:20,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:36:20,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:36:20,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:36:20,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:36:20,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:36:20,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:36:20,619 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:36:20,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:36:20,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:36:20,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:36:20,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:36:20,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:36:20,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:36:20,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:36:20,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:36:20,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:36:20,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:36:20,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:36:20,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:36:20,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:36:20,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:36:20,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:36:20,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:36:20,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:36:20,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:36:20,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:36:20,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:36:20,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:36:20,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:36:20,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:36:20,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:36:20,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:36:20,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:36:20,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:36:20,629 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 [2024-10-24 12:36:20,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:36:20,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:36:20,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:36:20,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:36:20,889 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:36:20,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2024-10-24 12:36:22,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:36:22,548 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:36:22,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2024-10-24 12:36:22,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80b60869/a85487b5e4c94f14ac7ccdddc3920f76/FLAGbddde227a [2024-10-24 12:36:22,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80b60869/a85487b5e4c94f14ac7ccdddc3920f76 [2024-10-24 12:36:22,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:36:22,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:36:22,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:36:22,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:36:22,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:36:22,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5353d0d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22, skipping insertion in model container [2024-10-24 12:36:22,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:36:22,819 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2024-10-24 12:36:22,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:36:22,839 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:36:22,870 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2024-10-24 12:36:22,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:36:22,891 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:36:22,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22 WrapperNode [2024-10-24 12:36:22,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:36:22,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:36:22,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:36:22,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:36:22,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,932 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 256 [2024-10-24 12:36:22,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:36:22,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:36:22,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:36:22,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:36:22,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,967 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-10-24 12:36:22,968 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,968 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,976 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,980 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:22,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:36:22,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:36:22,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:36:22,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:36:22,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (1/1) ... [2024-10-24 12:36:23,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:36:23,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:36:23,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:36:23,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:36:23,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:36:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 12:36:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 12:36:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 12:36:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 12:36:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 12:36:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 12:36:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-24 12:36:23,062 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-24 12:36:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:36:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:36:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:36:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:36:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 12:36:23,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 12:36:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 12:36:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:36:23,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:36:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:36:23,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:36:23,065 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:36:23,171 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:36:23,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:36:23,552 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:36:23,552 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:36:23,868 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:36:23,868 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-24 12:36:23,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:36:23 BoogieIcfgContainer [2024-10-24 12:36:23,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:36:23,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:36:23,873 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:36:23,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:36:23,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:36:22" (1/3) ... [2024-10-24 12:36:23,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619dc82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:36:23, skipping insertion in model container [2024-10-24 12:36:23,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:36:22" (2/3) ... [2024-10-24 12:36:23,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619dc82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:36:23, skipping insertion in model container [2024-10-24 12:36:23,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:36:23" (3/3) ... [2024-10-24 12:36:23,879 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2024-10-24 12:36:23,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:36:23,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:36:23,892 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:36:23,936 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-24 12:36:23,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 51 transitions, 130 flow [2024-10-24 12:36:24,006 INFO L124 PetriNetUnfolderBase]: 6/47 cut-off events. [2024-10-24 12:36:24,006 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 12:36:24,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 47 events. 6/47 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2024-10-24 12:36:24,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 51 transitions, 130 flow [2024-10-24 12:36:24,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 116 flow [2024-10-24 12:36:24,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:36:24,028 INFO L333 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, 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;@2b49e7ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:36:24,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-24 12:36:24,042 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:36:24,042 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2024-10-24 12:36:24,042 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 12:36:24,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:24,043 INFO L204 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, 1, 1] [2024-10-24 12:36:24,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:24,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:24,049 INFO L85 PathProgramCache]: Analyzing trace with hash -811056868, now seen corresponding path program 1 times [2024-10-24 12:36:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684066837] [2024-10-24 12:36:24,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:24,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:36:24,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:24,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684066837] [2024-10-24 12:36:24,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684066837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:36:24,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:36:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:36:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775745373] [2024-10-24 12:36:24,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:36:24,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:36:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:36:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:36:24,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 51 [2024-10-24 12:36:24,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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) [2024-10-24 12:36:24,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:24,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 51 [2024-10-24 12:36:24,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:25,916 INFO L124 PetriNetUnfolderBase]: 6160/9047 cut-off events. [2024-10-24 12:36:25,916 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2024-10-24 12:36:25,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17724 conditions, 9047 events. 6160/9047 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 55076 event pairs, 2221 based on Foata normal form. 2/8840 useless extension candidates. Maximal degree in co-relation 16284. Up to 3674 conditions per place. [2024-10-24 12:36:25,984 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 65 selfloop transitions, 4 changer transitions 3/85 dead transitions. [2024-10-24 12:36:25,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 365 flow [2024-10-24 12:36:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:36:25,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:36:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-10-24 12:36:25,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2024-10-24 12:36:26,001 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 116 flow. Second operand 5 states and 159 transitions. [2024-10-24 12:36:26,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 365 flow [2024-10-24 12:36:26,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 331 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-24 12:36:26,027 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 124 flow [2024-10-24 12:36:26,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-10-24 12:36:26,032 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2024-10-24 12:36:26,032 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 124 flow [2024-10-24 12:36:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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) [2024-10-24 12:36:26,032 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:26,033 INFO L204 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, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:26,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:36:26,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:26,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:26,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1082259351, now seen corresponding path program 1 times [2024-10-24 12:36:26,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:26,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400441494] [2024-10-24 12:36:26,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:26,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:36:26,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:26,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400441494] [2024-10-24 12:36:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400441494] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:36:26,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:36:26,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:36:26,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70339342] [2024-10-24 12:36:26,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:36:26,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:36:26,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:26,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:36:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:36:26,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-10-24 12:36:26,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2024-10-24 12:36:26,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:26,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-10-24 12:36:26,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:26,781 INFO L124 PetriNetUnfolderBase]: 3414/5580 cut-off events. [2024-10-24 12:36:26,781 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-10-24 12:36:26,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10821 conditions, 5580 events. 3414/5580 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 36080 event pairs, 1305 based on Foata normal form. 90/5519 useless extension candidates. Maximal degree in co-relation 6911. Up to 3076 conditions per place. [2024-10-24 12:36:26,831 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 46 selfloop transitions, 2 changer transitions 3/68 dead transitions. [2024-10-24 12:36:26,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 272 flow [2024-10-24 12:36:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:36:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:36:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-10-24 12:36:26,834 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7124183006535948 [2024-10-24 12:36:26,834 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 124 flow. Second operand 3 states and 109 transitions. [2024-10-24 12:36:26,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 272 flow [2024-10-24 12:36:26,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:36:26,840 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 132 flow [2024-10-24 12:36:26,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-10-24 12:36:26,842 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-10-24 12:36:26,842 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 132 flow [2024-10-24 12:36:26,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2024-10-24 12:36:26,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:26,843 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:26,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:36:26,844 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:26,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:26,845 INFO L85 PathProgramCache]: Analyzing trace with hash -342713442, now seen corresponding path program 1 times [2024-10-24 12:36:26,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174050718] [2024-10-24 12:36:26,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:26,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:36:26,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:26,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174050718] [2024-10-24 12:36:26,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174050718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:36:26,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:36:26,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 12:36:26,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479422856] [2024-10-24 12:36:26,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:36:26,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:36:26,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:26,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:36:26,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:36:26,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-10-24 12:36:26,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-10-24 12:36:26,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:26,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-10-24 12:36:26,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:27,466 INFO L124 PetriNetUnfolderBase]: 3423/5576 cut-off events. [2024-10-24 12:36:27,466 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2024-10-24 12:36:27,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11291 conditions, 5576 events. 3423/5576 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 34201 event pairs, 1395 based on Foata normal form. 74/5462 useless extension candidates. Maximal degree in co-relation 7957. Up to 3744 conditions per place. [2024-10-24 12:36:27,506 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 42 selfloop transitions, 2 changer transitions 7/68 dead transitions. [2024-10-24 12:36:27,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 279 flow [2024-10-24 12:36:27,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:36:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:36:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-10-24 12:36:27,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-10-24 12:36:27,508 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 132 flow. Second operand 3 states and 108 transitions. [2024-10-24 12:36:27,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 279 flow [2024-10-24 12:36:27,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:36:27,584 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 142 flow [2024-10-24 12:36:27,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2024-10-24 12:36:27,585 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2024-10-24 12:36:27,585 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 142 flow [2024-10-24 12:36:27,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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) [2024-10-24 12:36:27,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:27,586 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:36:27,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:27,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:27,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1374563807, now seen corresponding path program 1 times [2024-10-24 12:36:27,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:27,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869124810] [2024-10-24 12:36:27,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:27,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:36:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869124810] [2024-10-24 12:36:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869124810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:36:27,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:36:27,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:36:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167310599] [2024-10-24 12:36:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:36:27,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:36:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:36:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:36:27,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-10-24 12:36:27,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2024-10-24 12:36:27,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:27,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-10-24 12:36:27,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:28,287 INFO L124 PetriNetUnfolderBase]: 3940/6563 cut-off events. [2024-10-24 12:36:28,287 INFO L125 PetriNetUnfolderBase]: For 1135/1149 co-relation queries the response was YES. [2024-10-24 12:36:28,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13831 conditions, 6563 events. 3940/6563 cut-off events. For 1135/1149 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 42176 event pairs, 3357 based on Foata normal form. 58/6346 useless extension candidates. Maximal degree in co-relation 9911. Up to 4556 conditions per place. [2024-10-24 12:36:28,319 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 32 selfloop transitions, 2 changer transitions 25/76 dead transitions. [2024-10-24 12:36:28,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 324 flow [2024-10-24 12:36:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:36:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:36:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-10-24 12:36:28,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-10-24 12:36:28,323 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 142 flow. Second operand 5 states and 153 transitions. [2024-10-24 12:36:28,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 324 flow [2024-10-24 12:36:28,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 76 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:36:28,329 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 158 flow [2024-10-24 12:36:28,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-10-24 12:36:28,330 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-10-24 12:36:28,330 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 158 flow [2024-10-24 12:36:28,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2024-10-24 12:36:28,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:28,331 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:28,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:36:28,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:28,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:28,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1858947521, now seen corresponding path program 1 times [2024-10-24 12:36:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100450585] [2024-10-24 12:36:28,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:28,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 12:36:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100450585] [2024-10-24 12:36:28,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100450585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:36:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:36:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:36:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137528127] [2024-10-24 12:36:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:36:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:36:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:28,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:36:28,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:36:28,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-10-24 12:36:28,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) [2024-10-24 12:36:28,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:28,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-10-24 12:36:28,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:29,294 INFO L124 PetriNetUnfolderBase]: 4848/8041 cut-off events. [2024-10-24 12:36:29,294 INFO L125 PetriNetUnfolderBase]: For 1636/1650 co-relation queries the response was YES. [2024-10-24 12:36:29,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16962 conditions, 8041 events. 4848/8041 cut-off events. For 1636/1650 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 54038 event pairs, 4151 based on Foata normal form. 86/7726 useless extension candidates. Maximal degree in co-relation 16943. Up to 4557 conditions per place. [2024-10-24 12:36:29,350 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 33 selfloop transitions, 2 changer transitions 25/77 dead transitions. [2024-10-24 12:36:29,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 352 flow [2024-10-24 12:36:29,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:36:29,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:36:29,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-10-24 12:36:29,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6519607843137255 [2024-10-24 12:36:29,352 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 158 flow. Second operand 4 states and 133 transitions. [2024-10-24 12:36:29,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 352 flow [2024-10-24 12:36:29,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 336 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-10-24 12:36:29,360 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 162 flow [2024-10-24 12:36:29,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-10-24 12:36:29,361 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2024-10-24 12:36:29,362 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 162 flow [2024-10-24 12:36:29,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 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) [2024-10-24 12:36:29,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:29,362 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:29,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:36:29,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:29,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:29,364 INFO L85 PathProgramCache]: Analyzing trace with hash 492940718, now seen corresponding path program 1 times [2024-10-24 12:36:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:29,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797146954] [2024-10-24 12:36:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:29,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:36:29,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797146954] [2024-10-24 12:36:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797146954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:36:29,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:36:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:36:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37420936] [2024-10-24 12:36:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:36:29,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:36:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:29,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:36:29,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:36:29,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 51 [2024-10-24 12:36:29,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-10-24 12:36:29,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:29,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 51 [2024-10-24 12:36:29,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:31,705 INFO L124 PetriNetUnfolderBase]: 17735/26583 cut-off events. [2024-10-24 12:36:31,706 INFO L125 PetriNetUnfolderBase]: For 5717/5717 co-relation queries the response was YES. [2024-10-24 12:36:31,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57910 conditions, 26583 events. 17735/26583 cut-off events. For 5717/5717 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 177302 event pairs, 1924 based on Foata normal form. 800/27215 useless extension candidates. Maximal degree in co-relation 57886. Up to 6730 conditions per place. [2024-10-24 12:36:31,836 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 113 selfloop transitions, 13 changer transitions 22/159 dead transitions. [2024-10-24 12:36:31,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 159 transitions, 763 flow [2024-10-24 12:36:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 12:36:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-24 12:36:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2024-10-24 12:36:31,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6638655462184874 [2024-10-24 12:36:31,839 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 162 flow. Second operand 7 states and 237 transitions. [2024-10-24 12:36:31,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 159 transitions, 763 flow [2024-10-24 12:36:31,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 159 transitions, 747 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-10-24 12:36:31,851 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 236 flow [2024-10-24 12:36:31,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2024-10-24 12:36:31,853 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2024-10-24 12:36:31,854 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 236 flow [2024-10-24 12:36:31,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 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) [2024-10-24 12:36:31,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:31,855 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:31,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:36:31,855 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:31,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 674833818, now seen corresponding path program 2 times [2024-10-24 12:36:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:31,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590217507] [2024-10-24 12:36:31,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:31,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 12:36:32,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:32,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590217507] [2024-10-24 12:36:32,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590217507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:36:32,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078989478] [2024-10-24 12:36:32,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 12:36:32,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:36:32,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:36:32,179 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:36:32,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:36:32,303 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 12:36:32,303 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:36:32,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 12:36:32,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:36:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:36:32,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:36:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:36:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078989478] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:36:32,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:36:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-24 12:36:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679062759] [2024-10-24 12:36:32,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:36:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:36:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:36:32,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:36:32,595 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-10-24 12:36:32,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 236 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 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) [2024-10-24 12:36:32,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:32,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-10-24 12:36:32,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:36,265 INFO L124 PetriNetUnfolderBase]: 25369/36568 cut-off events. [2024-10-24 12:36:36,266 INFO L125 PetriNetUnfolderBase]: For 20440/20440 co-relation queries the response was YES. [2024-10-24 12:36:36,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90698 conditions, 36568 events. 25369/36568 cut-off events. For 20440/20440 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 226161 event pairs, 1689 based on Foata normal form. 544/36250 useless extension candidates. Maximal degree in co-relation 90669. Up to 5468 conditions per place. [2024-10-24 12:36:36,482 INFO L140 encePairwiseOnDemand]: 38/51 looper letters, 377 selfloop transitions, 100 changer transitions 30/514 dead transitions. [2024-10-24 12:36:36,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 514 transitions, 2760 flow [2024-10-24 12:36:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-24 12:36:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-10-24 12:36:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 805 transitions. [2024-10-24 12:36:36,486 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5091714104996837 [2024-10-24 12:36:36,486 INFO L175 Difference]: Start difference. First operand has 68 places, 60 transitions, 236 flow. Second operand 31 states and 805 transitions. [2024-10-24 12:36:36,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 514 transitions, 2760 flow [2024-10-24 12:36:36,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 514 transitions, 2741 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-10-24 12:36:36,577 INFO L231 Difference]: Finished difference. Result has 125 places, 154 transitions, 1135 flow [2024-10-24 12:36:36,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1135, PETRI_PLACES=125, PETRI_TRANSITIONS=154} [2024-10-24 12:36:36,578 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 72 predicate places. [2024-10-24 12:36:36,578 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 154 transitions, 1135 flow [2024-10-24 12:36:36,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 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) [2024-10-24 12:36:36,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:36,578 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:36,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:36:36,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:36:36,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:36,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -450088264, now seen corresponding path program 3 times [2024-10-24 12:36:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749381440] [2024-10-24 12:36:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:36:37,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749381440] [2024-10-24 12:36:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749381440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:36:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104542370] [2024-10-24 12:36:37,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 12:36:37,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:36:37,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:36:37,093 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:36:37,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:36:37,207 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 12:36:37,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:36:37,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 12:36:37,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:36:37,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:36:37,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:36:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:36:37,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104542370] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:36:37,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:36:37,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-24 12:36:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868916922] [2024-10-24 12:36:37,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:36:37,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 12:36:37,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:37,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 12:36:37,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 12:36:37,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 51 [2024-10-24 12:36:37,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 154 transitions, 1135 flow. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 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) [2024-10-24 12:36:37,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:37,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 51 [2024-10-24 12:36:37,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:36:41,272 INFO L124 PetriNetUnfolderBase]: 19689/29138 cut-off events. [2024-10-24 12:36:41,272 INFO L125 PetriNetUnfolderBase]: For 228106/229350 co-relation queries the response was YES. [2024-10-24 12:36:41,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115394 conditions, 29138 events. 19689/29138 cut-off events. For 228106/229350 co-relation queries the response was YES. Maximal size of possible extension queue 1191. Compared 188666 event pairs, 1739 based on Foata normal form. 1324/29940 useless extension candidates. Maximal degree in co-relation 115336. Up to 5163 conditions per place. [2024-10-24 12:36:41,620 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 179 selfloop transitions, 80 changer transitions 35/323 dead transitions. [2024-10-24 12:36:41,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 323 transitions, 2731 flow [2024-10-24 12:36:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 12:36:41,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-24 12:36:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 419 transitions. [2024-10-24 12:36:41,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5134803921568627 [2024-10-24 12:36:41,623 INFO L175 Difference]: Start difference. First operand has 125 places, 154 transitions, 1135 flow. Second operand 16 states and 419 transitions. [2024-10-24 12:36:41,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 323 transitions, 2731 flow [2024-10-24 12:36:42,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 323 transitions, 2625 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-10-24 12:36:42,646 INFO L231 Difference]: Finished difference. Result has 140 places, 148 transitions, 1414 flow [2024-10-24 12:36:42,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1414, PETRI_PLACES=140, PETRI_TRANSITIONS=148} [2024-10-24 12:36:42,647 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 87 predicate places. [2024-10-24 12:36:42,647 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 148 transitions, 1414 flow [2024-10-24 12:36:42,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 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) [2024-10-24 12:36:42,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:36:42,648 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:36:42,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 12:36:42,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-24 12:36:42,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:36:42,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:36:42,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1877270382, now seen corresponding path program 4 times [2024-10-24 12:36:42,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:36:42,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603679268] [2024-10-24 12:36:42,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:36:42,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:36:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:36:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:36:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:36:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603679268] [2024-10-24 12:36:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603679268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:36:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429675325] [2024-10-24 12:36:44,286 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 12:36:44,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:36:44,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:36:44,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:36:44,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 12:36:44,384 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 12:36:44,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:36:44,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-24 12:36:44,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:36:44,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-24 12:36:45,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:36:45,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2024-10-24 12:36:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:36:45,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:36:46,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:36:46,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 150 [2024-10-24 12:36:46,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:36:46,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-10-24 12:36:46,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:36:46,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 157 [2024-10-24 12:36:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:36:46,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429675325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:36:46,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:36:46,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 37 [2024-10-24 12:36:46,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051253436] [2024-10-24 12:36:46,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:36:46,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-24 12:36:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:36:46,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-24 12:36:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2024-10-24 12:36:47,128 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 51 [2024-10-24 12:36:47,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 148 transitions, 1414 flow. Second operand has 38 states, 38 states have (on average 18.68421052631579) internal successors, (710), 38 states have internal predecessors, (710), 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) [2024-10-24 12:36:47,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:36:47,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 51 [2024-10-24 12:36:47,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:37:04,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L115-->L117: Formula: (= v_~v_assert~0_6 (ite (= (ite (<= v_~d2~0_3 (* 2 v_~W~0_2)) 1 0) 0) 0 1)) InVars {~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} OutVars{~v_assert~0=v_~v_assert~0_6, ~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} AuxVars[] AssignedVars[~v_assert~0][954], [Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 18#L51true, Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 21#L117true, 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), 16#L108true, 1185#(and (or (not (= ~back2~0 0)) (< ~front1~0 0) (and (= ~front1~0 ~back1~0) (= ~front2~0 0) (<= ~d2~0 0)) (< ~back1~0 ~front1~0)) (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 10#L143-4true, 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), 95#true, Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))]) [2024-10-24 12:37:04,428 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-10-24 12:37:04,429 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:37:04,429 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:37:04,429 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:37:05,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([721] L115-->L117: Formula: (= v_~v_assert~0_6 (ite (= (ite (<= v_~d2~0_3 (* 2 v_~W~0_2)) 1 0) 0) 0 1)) InVars {~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} OutVars{~v_assert~0=v_~v_assert~0_6, ~d2~0=v_~d2~0_3, ~W~0=v_~W~0_2} AuxVars[] AssignedVars[~v_assert~0][954], [Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), 18#L51true, Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 21#L117true, 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), 16#L108true, 1185#(and (or (not (= ~back2~0 0)) (< ~front1~0 0) (and (= ~front1~0 ~back1~0) (= ~front2~0 0) (<= ~d2~0 0)) (< ~back1~0 ~front1~0)) (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), 95#true, Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))]) [2024-10-24 12:37:05,846 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-10-24 12:37:05,846 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:37:05,846 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:37:05,846 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:37:08,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:08,306 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-10-24 12:37:08,306 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-10-24 12:37:08,306 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 12:37:08,306 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 12:37:09,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:09,578 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-10-24 12:37:09,578 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 12:37:09,578 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:09,579 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:09,686 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-10-24 12:37:09,686 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-10-24 12:37:09,686 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:09,686 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:09,686 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 12:37:09,687 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:09,688 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-10-24 12:37:09,688 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 12:37:09,688 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:09,688 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:10,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:10,395 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-10-24 12:37:10,395 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:10,395 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-10-24 12:37:10,395 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:37:11,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-10-24 12:37:11,143 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,143 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,143 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,143 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][915], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 1167#(and (= ~v_assert~0 1) (<= ~d2~0 2) (<= 1 ~W~0)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:11,145 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,145 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,145 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,145 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-10-24 12:37:11,625 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,625 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,625 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,625 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][1191], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-10-24 12:37:11,631 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,631 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,632 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,632 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,880 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 78#(<= ~back1~0 ~front1~0), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 29#L75true, 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:11,880 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,880 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,880 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,880 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 10#L143-4true, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 78#(<= ~back1~0 ~front1~0), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:11,891 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-10-24 12:37:11,891 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,891 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2024-10-24 12:37:11,891 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-10-24 12:37:12,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][990], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-10-24 12:37:12,410 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-10-24 12:37:12,410 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-24 12:37:12,410 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-10-24 12:37:12,410 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-10-24 12:37:12,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][1191], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 906#(= ~v_assert~0 1), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 35#L105true]) [2024-10-24 12:37:12,411 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-10-24 12:37:12,411 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-24 12:37:12,411 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-10-24 12:37:12,411 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-10-24 12:37:13,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L55-->L59: Formula: (and (not (= (ite (= (select (select |v_#memory_int#1_73| v_~queue1~0.base_79) (+ v_~queue1~0.offset_79 (* 4 v_~back1~0_75))) 1) 1 0) 0)) (= (+ v_~back1~0_75 1) v_~back1~0_74) (not (= (ite (and (< v_~back1~0_75 v_~n1~0_72) (<= 0 v_~back1~0_75)) 1 0) 0))) InVars {~back1~0=v_~back1~0_75, ~queue1~0.offset=v_~queue1~0.offset_79, ~queue1~0.base=v_~queue1~0.base_79, #memory_int#1=|v_#memory_int#1_73|, ~n1~0=v_~n1~0_72} OutVars{thread1Thread1of1ForFork1_#t~post2#1=|v_thread1Thread1of1ForFork1_#t~post2#1_1|, ~queue1~0.base=v_~queue1~0.base_79, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~n1~0=v_~n1~0_72, ~back1~0=v_~back1~0_74, ~queue1~0.offset=v_~queue1~0.offset_79, thread1Thread1of1ForFork1_#t~mem1#1=|v_thread1Thread1of1ForFork1_#t~mem1#1_1|, #memory_int#1=|v_#memory_int#1_73|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~back1~0, thread1Thread1of1ForFork1_#t~mem1#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][650], [Black: 575#(= |thread2Thread1of1ForFork3_~cond~1#1| 1), Black: 482#(not (= (mod ~v_assert~0 256) 0)), Black: 479#true, Black: 727#(or (not (= (mod ~v_assert~0 256) 0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256))), Black: 483#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 481#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 636#(< 0 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)), Black: 753#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 755#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 765#(and (<= 1 (mod |thread2Thread1of1ForFork3_~cond~1#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 101#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 6#thread4EXITtrue, 1133#(and (= ~v_assert~0 1) (<= ~d2~0 (* 2 ~W~0))), 27#L59true, 400#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 42#L80true, Black: 278#(< 0 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)), Black: 111#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), Black: 220#(= |thread3Thread1of1ForFork0_~cond~2#1| 1), Black: 189#(or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0))), Black: 69#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= ~d2~0 (* 2 ~W~0))), Black: 385#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 109#true, Black: 419#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 74#(= ~front2~0 ~back2~0), Black: 410#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 448#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0))), Black: 416#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256))), Black: 433#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 78#(<= ~back1~0 ~front1~0), Black: 428#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 403#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 405#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)))), Black: 394#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 443#(and (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 383#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 112#(not (= (mod ~v_assert~0 256) 0)), Black: 396#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 82#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 390#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (not (= (mod ~v_assert~0 256) 0))), Black: 412#(and (= |thread3Thread1of1ForFork0_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 431#(and (or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))) (<= 1 (mod |thread3Thread1of1ForFork0_~cond~2#1| 256)) (or (and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)) (and (= |thread2Thread1of1ForFork3_~cond~1#1| 0) (= (mod ~v_assert~0 256) 0)))), Black: 91#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 388#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), 3#L144true, Black: 99#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1)), Black: 103#(and (not (= (mod ~v_assert~0 256) 0)) (= |thread2Thread1of1ForFork3_~cond~1#1| 1) (= |thread1Thread1of1ForFork1_~cond~0#1| 1)), Black: 98#(not (= (mod ~v_assert~0 256) 0)), Black: 97#(or (and (= |thread1Thread1of1ForFork1_~cond~0#1| 0) (= (mod ~v_assert~0 256) 0)) (and (not (= (mod ~v_assert~0 256) 0)) (= |thread1Thread1of1ForFork1_~cond~0#1| 1))), 17#L102true]) [2024-10-24 12:37:13,111 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-10-24 12:37:13,111 INFO L297 olderBase$Statistics]: existing Event has 50 ancestors and is cut-off event [2024-10-24 12:37:13,111 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-10-24 12:37:13,111 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2024-10-24 12:37:16,732 INFO L124 PetriNetUnfolderBase]: 98377/155904 cut-off events. [2024-10-24 12:37:16,732 INFO L125 PetriNetUnfolderBase]: For 1286686/1300037 co-relation queries the response was YES. [2024-10-24 12:37:18,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628714 conditions, 155904 events. 98377/155904 cut-off events. For 1286686/1300037 co-relation queries the response was YES. Maximal size of possible extension queue 5330. Compared 1396538 event pairs, 12123 based on Foata normal form. 3547/148421 useless extension candidates. Maximal degree in co-relation 600009. Up to 21935 conditions per place. [2024-10-24 12:37:19,240 INFO L140 encePairwiseOnDemand]: 35/51 looper letters, 976 selfloop transitions, 315 changer transitions 65/1454 dead transitions. [2024-10-24 12:37:19,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1454 transitions, 10174 flow [2024-10-24 12:37:19,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-10-24 12:37:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2024-10-24 12:37:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 2983 transitions. [2024-10-24 12:37:19,248 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5366073034718475 [2024-10-24 12:37:19,248 INFO L175 Difference]: Start difference. First operand has 140 places, 148 transitions, 1414 flow. Second operand 109 states and 2983 transitions. [2024-10-24 12:37:19,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 1454 transitions, 10174 flow [2024-10-24 12:37:37,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 1454 transitions, 9557 flow, removed 60 selfloop flow, removed 9 redundant places. [2024-10-24 12:37:37,984 INFO L231 Difference]: Finished difference. Result has 249 places, 568 transitions, 3795 flow [2024-10-24 12:37:37,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=109, PETRI_FLOW=3795, PETRI_PLACES=249, PETRI_TRANSITIONS=568} [2024-10-24 12:37:37,985 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 196 predicate places. [2024-10-24 12:37:37,985 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 568 transitions, 3795 flow [2024-10-24 12:37:37,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 18.68421052631579) internal successors, (710), 38 states have internal predecessors, (710), 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) [2024-10-24 12:37:37,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:37:37,986 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:37:37,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 12:37:38,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:37:38,187 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-24 12:37:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:37:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1745707119, now seen corresponding path program 5 times [2024-10-24 12:37:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:37:38,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948964437] [2024-10-24 12:37:38,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:37:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 12:37:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:37:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948964437] [2024-10-24 12:37:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948964437] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:37:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041609136] [2024-10-24 12:37:38,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 12:37:38,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:37:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:37:38,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:37:38,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 12:37:38,536 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 12:37:38,536 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:37:38,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 12:37:38,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:37:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 12:37:38,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:37:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 12:37:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041609136] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:37:38,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:37:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-10-24 12:37:38,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871541492] [2024-10-24 12:37:38,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:37:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 12:37:38,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:37:38,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 12:37:38,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 12:37:38,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 51 [2024-10-24 12:37:38,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 568 transitions, 3795 flow. Second operand has 13 states, 13 states have (on average 22.307692307692307) internal successors, (290), 13 states have internal predecessors, (290), 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) [2024-10-24 12:37:38,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:37:38,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 51 [2024-10-24 12:37:38,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand