./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-bad-buffer-mult-alt2.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-bad-buffer-mult-alt2.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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:31:39,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:31:39,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:31:39,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:31:39,546 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:31:39,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:31:39,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:31:39,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:31:39,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:31:39,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:31:39,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:31:39,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:31:39,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:31:39,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:31:39,579 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:31:39,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:31:39,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:31:39,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:31:39,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:31:39,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:31:39,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:31:39,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:31:39,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:31:39,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:31:39,591 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:31:39,591 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:31:39,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:31:39,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:31:39,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:31:39,592 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:31:39,592 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:31:39,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:31:39,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:31:39,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:31:39,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:31:39,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:31:39,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:31:39,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:31:39,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:31:39,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:31:39,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:31:39,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:31:39,599 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2024-10-24 12:31:39,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:31:39,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:31:39,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:31:39,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:31:39,968 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:31:39,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-10-24 12:31:41,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:31:41,835 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:31:41,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-10-24 12:31:41,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc67c591/1f8802fc105a4b9a93e3d7415c1584ee/FLAG6c39e92fd [2024-10-24 12:31:41,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc67c591/1f8802fc105a4b9a93e3d7415c1584ee [2024-10-24 12:31:41,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:31:41,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:31:41,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:31:41,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:31:41,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:31:41,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:31:41" (1/1) ... [2024-10-24 12:31:41,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dac7b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:41, skipping insertion in model container [2024-10-24 12:31:41,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:31:41" (1/1) ... [2024-10-24 12:31:41,910 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:31:42,145 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-10-24 12:31:42,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:31:42,229 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:31:42,260 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-bad-buffer-mult-alt2.wvr.c[4226,4239] [2024-10-24 12:31:42,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:31:42,283 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:31:42,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42 WrapperNode [2024-10-24 12:31:42,284 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:31:42,285 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:31:42,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:31:42,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:31:42,292 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:31:42" (1/1) ... [2024-10-24 12:31:42,304 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:31:42" (1/1) ... [2024-10-24 12:31:42,338 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 307 [2024-10-24 12:31:42,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:31:42,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:31:42,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:31:42,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:31:42,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,407 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:31:42,411 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:31:42,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:31:42,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:31:42,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:31:42,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (1/1) ... [2024-10-24 12:31:42,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:31:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:31:42,502 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:31:42,506 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:31:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:31:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 12:31:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 12:31:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 12:31:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 12:31:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 12:31:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 12:31:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-24 12:31:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-24 12:31:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:31:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 12:31:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 12:31:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 12:31:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 12:31:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 12:31:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 12:31:42,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:31:42,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:31:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 12:31:42,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 12:31:42,564 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:31:42,683 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:31:42,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:31:43,118 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:31:43,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:31:43,698 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:31:43,698 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-24 12:31:43,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:31:43 BoogieIcfgContainer [2024-10-24 12:31:43,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:31:43,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:31:43,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:31:43,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:31:43,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:31:41" (1/3) ... [2024-10-24 12:31:43,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad6be3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:31:43, skipping insertion in model container [2024-10-24 12:31:43,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:31:42" (2/3) ... [2024-10-24 12:31:43,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad6be3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:31:43, skipping insertion in model container [2024-10-24 12:31:43,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:31:43" (3/3) ... [2024-10-24 12:31:43,712 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2024-10-24 12:31:43,732 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:31:43,732 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:31:43,732 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:31:43,805 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-24 12:31:43,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 124 flow [2024-10-24 12:31:43,893 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-10-24 12:31:43,894 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 12:31:43,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 6/44 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-10-24 12:31:43,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 48 transitions, 124 flow [2024-10-24 12:31:43,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 43 transitions, 110 flow [2024-10-24 12:31:43,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:31:43,931 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;@10ab32e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:31:43,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-24 12:31:43,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:31:43,953 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2024-10-24 12:31:43,953 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-24 12:31:43,953 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:31:43,954 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:31:43,955 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:31:43,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:31:43,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1822743091, now seen corresponding path program 1 times [2024-10-24 12:31:43,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:31:43,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433099123] [2024-10-24 12:31:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:31:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:44,866 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:31:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:31:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433099123] [2024-10-24 12:31:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433099123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:31:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:31:44,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:31:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572513700] [2024-10-24 12:31:44,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:31:44,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:31:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:31:44,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:31:44,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:31:44,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-24 12:31:44,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:31:44,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:31:44,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-24 12:31:44,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:31:45,491 INFO L124 PetriNetUnfolderBase]: 1029/1674 cut-off events. [2024-10-24 12:31:45,492 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-10-24 12:31:45,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1674 events. 1029/1674 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 10239 event pairs, 110 based on Foata normal form. 80/1706 useless extension candidates. Maximal degree in co-relation 3168. Up to 997 conditions per place. [2024-10-24 12:31:45,527 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 51 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2024-10-24 12:31:45,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 292 flow [2024-10-24 12:31:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:31:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:31:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-10-24 12:31:45,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2024-10-24 12:31:45,547 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 110 flow. Second operand 5 states and 151 transitions. [2024-10-24 12:31:45,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 292 flow [2024-10-24 12:31:45,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 264 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-24 12:31:45,560 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 110 flow [2024-10-24 12:31:45,564 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-10-24 12:31:45,571 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2024-10-24 12:31:45,571 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 110 flow [2024-10-24 12:31:45,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:31:45,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:31:45,573 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] [2024-10-24 12:31:45,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:31:45,573 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:31:45,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:31:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash 299568406, now seen corresponding path program 1 times [2024-10-24 12:31:45,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:31:45,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534149785] [2024-10-24 12:31:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:31:45,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:31:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:31:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534149785] [2024-10-24 12:31:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534149785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:31:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:31:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:31:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644960522] [2024-10-24 12:31:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:31:45,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:31:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:31:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:31:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:31:45,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-24 12:31:45,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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:31:45,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:31:45,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-24 12:31:45,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:31:46,501 INFO L124 PetriNetUnfolderBase]: 1531/2294 cut-off events. [2024-10-24 12:31:46,502 INFO L125 PetriNetUnfolderBase]: For 493/790 co-relation queries the response was YES. [2024-10-24 12:31:46,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 2294 events. 1531/2294 cut-off events. For 493/790 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 12739 event pairs, 168 based on Foata normal form. 381/2657 useless extension candidates. Maximal degree in co-relation 1398. Up to 1353 conditions per place. [2024-10-24 12:31:46,528 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 58 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2024-10-24 12:31:46,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 332 flow [2024-10-24 12:31:46,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:31:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 12:31:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2024-10-24 12:31:46,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6215277777777778 [2024-10-24 12:31:46,533 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 110 flow. Second operand 6 states and 179 transitions. [2024-10-24 12:31:46,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 332 flow [2024-10-24 12:31:46,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 12:31:46,538 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 155 flow [2024-10-24 12:31:46,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2024-10-24 12:31:46,539 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2024-10-24 12:31:46,540 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 155 flow [2024-10-24 12:31:46,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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:31:46,540 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:31:46,541 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] [2024-10-24 12:31:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:31:46,542 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:31:46,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:31:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -101555562, now seen corresponding path program 2 times [2024-10-24 12:31:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:31:46,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832067151] [2024-10-24 12:31:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:46,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:31:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:46,753 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:31:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:31:46,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832067151] [2024-10-24 12:31:46,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832067151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:31:46,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:31:46,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:31:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109810923] [2024-10-24 12:31:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:31:46,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:31:46,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:31:46,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:31:46,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:31:46,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-24 12:31:46,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 155 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:31:46,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:31:46,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-24 12:31:46,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:31:47,138 INFO L124 PetriNetUnfolderBase]: 1181/1915 cut-off events. [2024-10-24 12:31:47,140 INFO L125 PetriNetUnfolderBase]: For 2068/2430 co-relation queries the response was YES. [2024-10-24 12:31:47,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 1915 events. 1181/1915 cut-off events. For 2068/2430 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11568 event pairs, 811 based on Foata normal form. 430/2168 useless extension candidates. Maximal degree in co-relation 1779. Up to 1526 conditions per place. [2024-10-24 12:31:47,170 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 29 selfloop transitions, 2 changer transitions 17/67 dead transitions. [2024-10-24 12:31:47,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 297 flow [2024-10-24 12:31:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:31:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:31:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2024-10-24 12:31:47,176 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2024-10-24 12:31:47,176 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 155 flow. Second operand 5 states and 151 transitions. [2024-10-24 12:31:47,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 297 flow [2024-10-24 12:31:47,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 67 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:31:47,182 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 172 flow [2024-10-24 12:31:47,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=5, PETRI_FLOW=172, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-10-24 12:31:47,184 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-10-24 12:31:47,185 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 172 flow [2024-10-24 12:31:47,185 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:31:47,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:31:47,185 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:31:47,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 12:31:47,186 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:31:47,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:31:47,187 INFO L85 PathProgramCache]: Analyzing trace with hash -319821762, now seen corresponding path program 1 times [2024-10-24 12:31:47,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:31:47,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169136786] [2024-10-24 12:31:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:31:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:47,475 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:31:47,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:31:47,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169136786] [2024-10-24 12:31:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169136786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:31:47,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:31:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:31:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427910386] [2024-10-24 12:31:47,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:31:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:31:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:31:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:31:47,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:31:47,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2024-10-24 12:31:47,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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:31:47,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:31:47,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2024-10-24 12:31:47,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:31:48,203 INFO L124 PetriNetUnfolderBase]: 2547/4040 cut-off events. [2024-10-24 12:31:48,203 INFO L125 PetriNetUnfolderBase]: For 2576/2873 co-relation queries the response was YES. [2024-10-24 12:31:48,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9915 conditions, 4040 events. 2547/4040 cut-off events. For 2576/2873 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 26441 event pairs, 641 based on Foata normal form. 357/4304 useless extension candidates. Maximal degree in co-relation 9898. Up to 1387 conditions per place. [2024-10-24 12:31:48,252 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 70 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2024-10-24 12:31:48,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 471 flow [2024-10-24 12:31:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 12:31:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-24 12:31:48,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 190 transitions. [2024-10-24 12:31:48,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6597222222222222 [2024-10-24 12:31:48,255 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 172 flow. Second operand 6 states and 190 transitions. [2024-10-24 12:31:48,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 471 flow [2024-10-24 12:31:48,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 97 transitions, 457 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-10-24 12:31:48,262 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 247 flow [2024-10-24 12:31:48,263 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-10-24 12:31:48,263 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-10-24 12:31:48,264 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 247 flow [2024-10-24 12:31:48,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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:31:48,264 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:31:48,264 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] [2024-10-24 12:31:48,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:31:48,265 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:31:48,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:31:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1045503397, now seen corresponding path program 1 times [2024-10-24 12:31:48,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:31:48,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876467444] [2024-10-24 12:31:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:31:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:31:49,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:31:49,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876467444] [2024-10-24 12:31:49,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876467444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:31:49,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450438870] [2024-10-24 12:31:49,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:49,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:31:49,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:31:49,072 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:31:49,074 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:31:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:49,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 12:31:49,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:31:49,316 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:31:49,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-24 12:31:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:31:49,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:31:50,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2024-10-24 12:31:50,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2024-10-24 12:31:50,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:31:50,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450438870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:31:50,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:31:50,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-24 12:31:50,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520079570] [2024-10-24 12:31:50,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:31:50,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 12:31:50,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:31:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 12:31:50,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-10-24 12:31:50,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-24 12:31:50,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 247 flow. Second operand has 18 states, 18 states have (on average 24.38888888888889) internal successors, (439), 18 states have internal predecessors, (439), 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:31:50,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:31:50,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-24 12:31:50,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:31:52,934 INFO L124 PetriNetUnfolderBase]: 5529/8961 cut-off events. [2024-10-24 12:31:52,934 INFO L125 PetriNetUnfolderBase]: For 17032/17845 co-relation queries the response was YES. [2024-10-24 12:31:52,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26169 conditions, 8961 events. 5529/8961 cut-off events. For 17032/17845 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 65594 event pairs, 727 based on Foata normal form. 781/9312 useless extension candidates. Maximal degree in co-relation 14369. Up to 3567 conditions per place. [2024-10-24 12:31:53,055 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 141 selfloop transitions, 39 changer transitions 2/204 dead transitions. [2024-10-24 12:31:53,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 204 transitions, 1180 flow [2024-10-24 12:31:53,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 12:31:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-24 12:31:53,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 499 transitions. [2024-10-24 12:31:53,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6497395833333334 [2024-10-24 12:31:53,061 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 247 flow. Second operand 16 states and 499 transitions. [2024-10-24 12:31:53,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 204 transitions, 1180 flow [2024-10-24 12:31:53,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 204 transitions, 1159 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-10-24 12:31:53,103 INFO L231 Difference]: Finished difference. Result has 79 places, 97 transitions, 594 flow [2024-10-24 12:31:53,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=594, PETRI_PLACES=79, PETRI_TRANSITIONS=97} [2024-10-24 12:31:53,105 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2024-10-24 12:31:53,106 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 97 transitions, 594 flow [2024-10-24 12:31:53,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 24.38888888888889) internal successors, (439), 18 states have internal predecessors, (439), 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:31:53,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:31:53,107 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-24 12:31:53,131 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:31:53,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:31:53,309 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:31:53,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:31:53,309 INFO L85 PathProgramCache]: Analyzing trace with hash -923014525, now seen corresponding path program 2 times [2024-10-24 12:31:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:31:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163229022] [2024-10-24 12:31:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:53,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:31:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:31:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:31:53,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163229022] [2024-10-24 12:31:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163229022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:31:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:31:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:31:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515617307] [2024-10-24 12:31:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:31:53,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:31:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:31:53,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:31:53,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:31:53,438 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-24 12:31:53,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 97 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:31:53,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:31:53,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-24 12:31:53,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:31:54,950 INFO L124 PetriNetUnfolderBase]: 5278/8514 cut-off events. [2024-10-24 12:31:54,950 INFO L125 PetriNetUnfolderBase]: For 19907/20461 co-relation queries the response was YES. [2024-10-24 12:31:55,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26186 conditions, 8514 events. 5278/8514 cut-off events. For 19907/20461 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 61277 event pairs, 569 based on Foata normal form. 552/8684 useless extension candidates. Maximal degree in co-relation 20126. Up to 6668 conditions per place. [2024-10-24 12:31:55,081 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 69 selfloop transitions, 13 changer transitions 0/104 dead transitions. [2024-10-24 12:31:55,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 104 transitions, 749 flow [2024-10-24 12:31:55,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:31:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:31:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2024-10-24 12:31:55,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-10-24 12:31:55,084 INFO L175 Difference]: Start difference. First operand has 79 places, 97 transitions, 594 flow. Second operand 3 states and 102 transitions. [2024-10-24 12:31:55,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 104 transitions, 749 flow [2024-10-24 12:31:55,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 104 transitions, 717 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-10-24 12:31:55,135 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 552 flow [2024-10-24 12:31:55,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2024-10-24 12:31:55,136 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 29 predicate places. [2024-10-24 12:31:55,137 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 552 flow [2024-10-24 12:31:55,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 12:31:55,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:31:55,137 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-24 12:31:55,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 12:31:55,138 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:31:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:31:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1359268175, now seen corresponding path program 1 times [2024-10-24 12:31:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:31:55,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237126718] [2024-10-24 12:31:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:31:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:31:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:31:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237126718] [2024-10-24 12:31:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237126718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:31:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353058813] [2024-10-24 12:31:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:31:56,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:31:56,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:31:56,423 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:31:56,424 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:31:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:31:56,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 12:31:56,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:31:56,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-10-24 12:31:56,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 12:31:56,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:31:56,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 12:31:56,830 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 18 [2024-10-24 12:31:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:31:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353058813] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:31:56,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:31:56,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 15 [2024-10-24 12:31:56,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576041293] [2024-10-24 12:31:56,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:31:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 12:31:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:31:56,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 12:31:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-24 12:31:57,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-24 12:31:57,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 552 flow. Second operand has 16 states, 16 states have (on average 24.5625) internal successors, (393), 16 states have internal predecessors, (393), 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:31:57,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:31:57,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-24 12:31:57,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:31:59,558 INFO L124 PetriNetUnfolderBase]: 7666/12626 cut-off events. [2024-10-24 12:31:59,559 INFO L125 PetriNetUnfolderBase]: For 29569/30619 co-relation queries the response was YES. [2024-10-24 12:31:59,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38435 conditions, 12626 events. 7666/12626 cut-off events. For 29569/30619 co-relation queries the response was YES. Maximal size of possible extension queue 838. Compared 98224 event pairs, 435 based on Foata normal form. 846/13046 useless extension candidates. Maximal degree in co-relation 29039. Up to 4333 conditions per place. [2024-10-24 12:31:59,939 INFO L140 encePairwiseOnDemand]: 39/48 looper letters, 107 selfloop transitions, 69 changer transitions 1/199 dead transitions. [2024-10-24 12:31:59,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 199 transitions, 1381 flow [2024-10-24 12:31:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 12:31:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-24 12:31:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 460 transitions. [2024-10-24 12:31:59,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5989583333333334 [2024-10-24 12:31:59,950 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 552 flow. Second operand 16 states and 460 transitions. [2024-10-24 12:31:59,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 199 transitions, 1381 flow [2024-10-24 12:32:00,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 199 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-24 12:32:00,006 INFO L231 Difference]: Finished difference. Result has 95 places, 125 transitions, 977 flow [2024-10-24 12:32:00,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=977, PETRI_PLACES=95, PETRI_TRANSITIONS=125} [2024-10-24 12:32:00,007 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2024-10-24 12:32:00,007 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 125 transitions, 977 flow [2024-10-24 12:32:00,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 24.5625) internal successors, (393), 16 states have internal predecessors, (393), 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:32:00,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:32:00,009 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] [2024-10-24 12:32:00,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:32:00,209 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,SelfDestructingSolverStorable6 [2024-10-24 12:32:00,210 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:32:00,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:32:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash -242120112, now seen corresponding path program 1 times [2024-10-24 12:32:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:32:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602915397] [2024-10-24 12:32:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:32:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:32:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:32:00,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:32:00,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:32:00,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602915397] [2024-10-24 12:32:00,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602915397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:32:00,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:32:00,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:32:00,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244357229] [2024-10-24 12:32:00,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:32:00,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 12:32:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:32:00,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 12:32:00,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 12:32:00,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-24 12:32:00,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 125 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:32:00,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:32:00,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-24 12:32:00,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:32:03,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,031 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-24 12:32:03,031 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 12:32:03,031 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:03,031 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-24 12:32:03,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,096 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-24 12:32:03,096 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:03,097 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-24 12:32:03,097 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 12:32:03,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,142 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,142 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 12:32:03,142 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,142 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 12:32:03,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,144 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,144 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 12:32:03,145 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 12:32:03,145 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,146 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,146 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 12:32:03,146 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:03,146 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-24 12:32:03,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, 96#true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 351#true, 31#L92true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,197 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,198 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 12:32:03,198 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:03,198 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 25#L56true, 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 351#true, 31#L92true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 23#thread2EXITtrue]) [2024-10-24 12:32:03,201 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,202 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:03,202 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 12:32:03,202 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,203 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,203 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 12:32:03,204 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:03,204 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:03,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,234 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,234 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 12:32:03,234 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:03,235 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,236 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,236 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 12:32:03,236 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:03,236 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,237 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,237 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:03,237 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 12:32:03,237 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,239 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,240 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,240 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:03,240 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 12:32:03,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, 96#true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,255 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 12:32:03,255 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-24 12:32:03,255 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 12:32:03,255 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,256 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 12:32:03,256 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,256 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 12:32:03,256 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 25#L56true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,257 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 12:32:03,257 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,257 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:03,258 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 12:32:03,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,267 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 12:32:03,267 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 12:32:03,267 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 12:32:03,267 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 19#L74true, Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,268 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 12:32:03,268 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 12:32:03,268 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,268 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,269 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 12:32:03,269 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 12:32:03,269 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:03,269 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [8#L144true, 2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 360#(<= 1 ~total~0), Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,274 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 12:32:03,274 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 12:32:03,274 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,274 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-24 12:32:03,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 36#L145true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 96#true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:03,275 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 12:32:03,275 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 12:32:03,275 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:03,275 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:32:03,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,278 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-10-24 12:32:03,278 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 12:32:03,278 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 12:32:03,278 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-24 12:32:03,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][151], [2#thread4EXITtrue, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 36#L145true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, 604#true, Black: 325#(and (= ~total~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:03,279 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-10-24 12:32:03,279 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:03,279 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:32:03,279 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 12:32:03,280 INFO L124 PetriNetUnfolderBase]: 10977/17542 cut-off events. [2024-10-24 12:32:03,280 INFO L125 PetriNetUnfolderBase]: For 75035/77144 co-relation queries the response was YES. [2024-10-24 12:32:03,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58243 conditions, 17542 events. 10977/17542 cut-off events. For 75035/77144 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 133167 event pairs, 2798 based on Foata normal form. 1872/18654 useless extension candidates. Maximal degree in co-relation 39756. Up to 8935 conditions per place. [2024-10-24 12:32:03,488 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 150 selfloop transitions, 9 changer transitions 0/181 dead transitions. [2024-10-24 12:32:03,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 181 transitions, 1854 flow [2024-10-24 12:32:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 12:32:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-24 12:32:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-10-24 12:32:03,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7430555555555556 [2024-10-24 12:32:03,489 INFO L175 Difference]: Start difference. First operand has 95 places, 125 transitions, 977 flow. Second operand 3 states and 107 transitions. [2024-10-24 12:32:03,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 181 transitions, 1854 flow [2024-10-24 12:32:03,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 181 transitions, 1796 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-10-24 12:32:03,585 INFO L231 Difference]: Finished difference. Result has 94 places, 126 transitions, 998 flow [2024-10-24 12:32:03,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=998, PETRI_PLACES=94, PETRI_TRANSITIONS=126} [2024-10-24 12:32:03,588 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 44 predicate places. [2024-10-24 12:32:03,589 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 126 transitions, 998 flow [2024-10-24 12:32:03,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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:32:03,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:32:03,589 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] [2024-10-24 12:32:03,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 12:32:03,590 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:32:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:32:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1604433398, now seen corresponding path program 3 times [2024-10-24 12:32:03,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:32:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650985926] [2024-10-24 12:32:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:32:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:32:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:32:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:32:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:32:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650985926] [2024-10-24 12:32:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650985926] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:32:03,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624160314] [2024-10-24 12:32:03,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 12:32:03,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:32:03,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:32:03,735 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:32:03,736 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:32:03,860 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 12:32:03,860 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:32:03,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 12:32:03,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:32:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:32:03,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:32:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:32:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624160314] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:32:04,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:32:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2024-10-24 12:32:04,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046477803] [2024-10-24 12:32:04,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:32:04,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 12:32:04,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:32:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 12:32:04,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-10-24 12:32:04,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-24 12:32:04,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 126 transitions, 998 flow. Second operand has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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:32:04,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:32:04,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-24 12:32:04,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:32:07,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), 13#L143-4true, Black: 360#(<= 1 ~total~0), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:07,535 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-24 12:32:07,535 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:07,536 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:07,536 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-24 12:32:07,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, 8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:07,782 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-24 12:32:07,782 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:07,782 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-24 12:32:07,782 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:07,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 25#L56true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 31#L92true, 351#true, 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:07,861 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 12:32:07,862 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:07,862 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 12:32:07,862 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:07,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 103#(<= 1 ~total~0), 351#true, 31#L92true, 13#L143-4true, Black: 360#(<= 1 ~total~0), 19#L74true, Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:07,869 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-24 12:32:07,869 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:07,869 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-24 12:32:07,869 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-24 12:32:07,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, 8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 25#L56true, 4#L110true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), 31#L92true, 351#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-10-24 12:32:07,931 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 12:32:07,931 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 12:32:07,931 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:07,931 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:07,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, 8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, 351#true, 31#L92true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:07,937 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-24 12:32:07,937 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:07,937 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-24 12:32:07,937 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-24 12:32:07,974 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, 15#thread1EXITtrue, 96#true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 31#L92true, 351#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 13#L143-4true, Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-10-24 12:32:07,974 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 12:32:07,974 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 12:32:07,974 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:07,974 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:07,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 31#L92true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), 351#true, Black: 360#(<= 1 ~total~0), 19#L74true, Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-10-24 12:32:07,982 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-24 12:32:07,982 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:07,982 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-24 12:32:07,982 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-24 12:32:08,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, 8#L144true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 4#L110true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 15#thread1EXITtrue, 96#true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 31#L92true, 351#true, 604#true, Black: 103#(<= 1 ~total~0), Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0))]) [2024-10-24 12:32:08,006 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-10-24 12:32:08,006 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-24 12:32:08,006 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-24 12:32:08,006 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-24 12:32:08,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 6#L144-1true, Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), 31#L92true, 351#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), 23#thread2EXITtrue, Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 606#(<= ~q2_back~0 ~q2_front~0), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|))]) [2024-10-24 12:32:08,026 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-10-24 12:32:08,026 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 12:32:08,026 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-24 12:32:08,026 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-24 12:32:08,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([860] L88-->L92: Formula: (and (= v_~total~0_121 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (= v_~q1_front~0_132 (+ v_~q1_front~0_133 1)) (<= v_~total~0_121 2147483647) (<= 0 (+ v_~total~0_121 2147483648)) (not (= (ite (and (< v_~q1_front~0_133 v_~q1_back~0_131) (< v_~q1_front~0_133 v_~n1~0_58) (<= 0 v_~q1_front~0_133)) 1 0) 0)) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_122)) 1 0) 0)) (not (= (ite (or (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648)) (<= v_~total~0_122 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) 1 0) 0)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_122 (select (select |v_#memory_int#1_87| v_~q1~0.base_105) (+ (* v_~q1_front~0_133 4) v_~q1~0.offset_105))))) InVars {~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_133, ~q1_back~0=v_~q1_back~0_131, ~n1~0=v_~n1~0_58, ~q1~0.base=v_~q1~0.base_105, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_122} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_105, ~q1_front~0=v_~q1_front~0_132, ~n1~0=v_~n1~0_58, thread3Thread1of1ForFork1_plus_#res#1=|v_thread3Thread1of1ForFork1_plus_#res#1_1|, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_plus_#in~a#1=|v_thread3Thread1of1ForFork1_plus_#in~a#1_1|, thread3Thread1of1ForFork1_#t~ret10#1=|v_thread3Thread1of1ForFork1_#t~ret10#1_1|, thread3Thread1of1ForFork1_#t~mem9#1=|v_thread3Thread1of1ForFork1_#t~mem9#1_1|, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_121, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_131, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_105, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, thread3Thread1of1ForFork1_plus_~b#1=|v_thread3Thread1of1ForFork1_plus_~b#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork1_plus_#res#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_plus_#in~b#1, thread3Thread1of1ForFork1_#t~post11#1, thread3Thread1of1ForFork1_plus_#in~a#1, thread3Thread1of1ForFork1_#t~ret10#1, thread3Thread1of1ForFork1_#t~mem9#1, thread3Thread1of1ForFork1_plus_~b#1, ~total~0][163], [608#true, Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 68#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 91#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 36#L145true, Black: 76#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 4#L110true, Black: 319#(or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((~q1_front~0 Int)) (or (< ~q1_front~0 0) (< 0 (+ (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) ~total~0)) (< ~n1~0 (+ ~q1_front~0 1)) (< (select (select |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~q1_front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))), 96#true, 604#true, Black: 103#(<= 1 ~total~0), 31#L92true, 351#true, Black: 598#(and (= ~total~0 0) (<= 1 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4))) (or (and (or (not (= ~q1_back~0 1)) (= ~q1_front~0 1)) (or (< ~q1_front~0 (+ ~q1_back~0 1)) (< 0 (+ ~q1_back~0 1))) (or (< ~q1_front~0 0) (not (= ~q1_back~0 0)) (= ~q1_front~0 0))) (= ~C~0 (select (select |#memory_int#1| ~q1~0.base) (* ~q1_front~0 4)))) (= 2 ~n1~0) (= ~q1~0.offset 0)), Black: 360#(<= 1 ~total~0), Black: 343#(and (<= 1 ~total~0) (<= ~n1~0 1) (or (< ~q1_front~0 0) (< ~n1~0 (+ ~q1_front~0 1)) (< 0 (+ (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) ~total~0)))), Black: 364#(and (<= 0 ~total~0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 85#(<= ~q1_front~0 ~q1_back~0), Black: 86#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 62#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 89#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 606#(<= ~q2_back~0 ~q2_front~0)]) [2024-10-24 12:32:08,037 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-10-24 12:32:08,037 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-24 12:32:08,037 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:32:08,037 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-24 12:32:08,044 INFO L124 PetriNetUnfolderBase]: 17880/29508 cut-off events. [2024-10-24 12:32:08,045 INFO L125 PetriNetUnfolderBase]: For 100037/102361 co-relation queries the response was YES. [2024-10-24 12:32:08,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98217 conditions, 29508 events. 17880/29508 cut-off events. For 100037/102361 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 252975 event pairs, 2497 based on Foata normal form. 2097/30657 useless extension candidates. Maximal degree in co-relation 93095. Up to 12603 conditions per place. [2024-10-24 12:32:08,496 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 128 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2024-10-24 12:32:08,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 194 transitions, 1792 flow [2024-10-24 12:32:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:32:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:32:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-10-24 12:32:08,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.78125 [2024-10-24 12:32:08,498 INFO L175 Difference]: Start difference. First operand has 94 places, 126 transitions, 998 flow. Second operand 4 states and 150 transitions. [2024-10-24 12:32:08,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 194 transitions, 1792 flow [2024-10-24 12:32:08,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 194 transitions, 1781 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:32:08,870 INFO L231 Difference]: Finished difference. Result has 98 places, 145 transitions, 1413 flow [2024-10-24 12:32:08,871 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1413, PETRI_PLACES=98, PETRI_TRANSITIONS=145} [2024-10-24 12:32:08,871 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2024-10-24 12:32:08,872 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 145 transitions, 1413 flow [2024-10-24 12:32:08,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.75) internal successors, (206), 8 states have internal predecessors, (206), 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:32:08,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:32:08,872 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] [2024-10-24 12:32:08,887 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:32:09,073 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:32:09,074 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:32:09,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:32:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1461972397, now seen corresponding path program 1 times [2024-10-24 12:32:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:32:09,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808210021] [2024-10-24 12:32:09,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:32:09,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:32:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:32:09,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 12:32:09,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:32:09,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808210021] [2024-10-24 12:32:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808210021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:32:09,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:32:09,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:32:09,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424844872] [2024-10-24 12:32:09,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:32:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:32:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:32:09,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:32:09,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:32:09,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2024-10-24 12:32:09,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 145 transitions, 1413 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:32:09,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:32:09,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2024-10-24 12:32:09,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:32:13,744 INFO L124 PetriNetUnfolderBase]: 20357/33449 cut-off events. [2024-10-24 12:32:13,745 INFO L125 PetriNetUnfolderBase]: For 167268/170001 co-relation queries the response was YES. [2024-10-24 12:32:13,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122855 conditions, 33449 events. 20357/33449 cut-off events. For 167268/170001 co-relation queries the response was YES. Maximal size of possible extension queue 1813. Compared 295800 event pairs, 13305 based on Foata normal form. 3101/34402 useless extension candidates. Maximal degree in co-relation 114240. Up to 18446 conditions per place. [2024-10-24 12:32:14,328 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 145 selfloop transitions, 11 changer transitions 15/193 dead transitions. [2024-10-24 12:32:14,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 193 transitions, 2282 flow [2024-10-24 12:32:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:32:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:32:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-10-24 12:32:14,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-10-24 12:32:14,333 INFO L175 Difference]: Start difference. First operand has 98 places, 145 transitions, 1413 flow. Second operand 4 states and 132 transitions. [2024-10-24 12:32:14,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 193 transitions, 2282 flow [2024-10-24 12:32:14,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 193 transitions, 2262 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-10-24 12:32:14,587 INFO L231 Difference]: Finished difference. Result has 101 places, 138 transitions, 1361 flow [2024-10-24 12:32:14,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1361, PETRI_PLACES=101, PETRI_TRANSITIONS=138} [2024-10-24 12:32:14,588 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 51 predicate places. [2024-10-24 12:32:14,588 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 138 transitions, 1361 flow [2024-10-24 12:32:14,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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:32:14,588 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:32:14,589 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:32:14,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 12:32:14,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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:32:14,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:32:14,590 INFO L85 PathProgramCache]: Analyzing trace with hash -126545709, now seen corresponding path program 1 times [2024-10-24 12:32:14,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:32:14,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709617071] [2024-10-24 12:32:14,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:32:14,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:32:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:32:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:32:15,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:32:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709617071] [2024-10-24 12:32:15,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709617071] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:32:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661856732] [2024-10-24 12:32:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:32:15,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:32:15,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:32:15,077 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:32:15,078 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:32:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:32:15,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 12:32:15,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:32:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 12:32:15,585 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:32:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 12:32:15,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661856732] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:32:15,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:32:15,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 25 [2024-10-24 12:32:15,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854317582] [2024-10-24 12:32:15,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:32:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 12:32:15,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:32:15,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 12:32:15,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2024-10-24 12:32:16,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48 [2024-10-24 12:32:16,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 138 transitions, 1361 flow. Second operand has 26 states, 26 states have (on average 15.115384615384615) internal successors, (393), 26 states have internal predecessors, (393), 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:32:16,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:32:16,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48 [2024-10-24 12:32:16,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand