./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU --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 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:08:45,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:08:45,329 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:08:45,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:08:45,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:08:45,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:08:45,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:08:45,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:08:45,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:08:45,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:08:45,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:08:45,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:08:45,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:08:45,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:08:45,394 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:08:45,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:08:45,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:08:45,395 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:08:45,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:08:45,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:08:45,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:08:45,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:08:45,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:08:45,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:08:45,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:08:45,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:08:45,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:08:45,404 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:08:45,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:08:45,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:08:45,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:08:45,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:08:45,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:45,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:08:45,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:08:45,409 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:08:45,409 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:08:45,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:08:45,410 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:08:45,410 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:08:45,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:08:45,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:08:45,411 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 2e9e4bd6e9b16aa5f22ad2335ca34ba741869a12ab5a04a80108cf42ed170c0f [2024-10-31 22:08:45,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:08:45,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:08:45,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:08:45,829 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:08:45,829 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:08:45,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c Unable to find full path for "g++" [2024-10-31 22:08:48,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:08:48,578 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:08:48,580 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c [2024-10-31 22:08:48,595 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/data/69daaeb14/18ab6222c5b344058a527addcd7b8637/FLAG842a5149f [2024-10-31 22:08:48,895 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/data/69daaeb14/18ab6222c5b344058a527addcd7b8637 [2024-10-31 22:08:48,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:08:48,911 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:08:48,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:48,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:08:48,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:08:48,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:48" (1/1) ... [2024-10-31 22:08:48,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5849fbd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:48, skipping insertion in model container [2024-10-31 22:08:48,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:48" (1/1) ... [2024-10-31 22:08:49,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:08:49,425 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c[4345,4358] [2024-10-31 22:08:49,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:49,447 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:08:49,476 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt.wvr.c[4345,4358] [2024-10-31 22:08:49,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:49,509 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:08:49,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49 WrapperNode [2024-10-31 22:08:49,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:49,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:49,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:08:49,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:08:49,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,583 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 311 [2024-10-31 22:08:49,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:49,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:08:49,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:08:49,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:08:49,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,628 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-31 22:08:49,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:08:49,677 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:08:49,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:08:49,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:08:49,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (1/1) ... [2024-10-31 22:08:49,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:49,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:08:49,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:08:49,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:08:49,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:08:49,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 22:08:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 22:08:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 22:08:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 22:08:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-31 22:08:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-31 22:08:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-31 22:08:49,756 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-31 22:08:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:08:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:08:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:08:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:08:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:08:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:08:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:08:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:08:49,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:08:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:08:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:08:49,763 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 22:08:49,912 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:08:49,914 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:08:50,479 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:08:50,480 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:08:51,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:08:51,023 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-31 22:08:51,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:51 BoogieIcfgContainer [2024-10-31 22:08:51,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:08:51,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:08:51,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:08:51,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:08:51,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:08:48" (1/3) ... [2024-10-31 22:08:51,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3562a475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:51, skipping insertion in model container [2024-10-31 22:08:51,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:49" (2/3) ... [2024-10-31 22:08:51,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3562a475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:51, skipping insertion in model container [2024-10-31 22:08:51,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:51" (3/3) ... [2024-10-31 22:08:51,035 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2024-10-31 22:08:51,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:08:51,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:08:51,056 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:08:51,168 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-31 22:08:51,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 128 flow [2024-10-31 22:08:51,357 INFO L124 PetriNetUnfolderBase]: 6/46 cut-off events. [2024-10-31 22:08:51,358 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:08:51,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 6/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 85 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-10-31 22:08:51,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 128 flow [2024-10-31 22:08:51,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 45 transitions, 114 flow [2024-10-31 22:08:51,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:08:51,397 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;@14915f49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:08:51,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-31 22:08:51,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:08:51,425 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2024-10-31 22:08:51,426 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-31 22:08:51,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:51,427 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-31 22:08:51,427 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-31 22:08:51,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash 141731549, now seen corresponding path program 1 times [2024-10-31 22:08:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:51,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833307585] [2024-10-31 22:08:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,466 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-31 22:08:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833307585] [2024-10-31 22:08:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833307585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886025675] [2024-10-31 22:08:52,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:52,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:52,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:52,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:52,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:52,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-10-31 22:08:52,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 114 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-31 22:08:52,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:52,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-10-31 22:08:52,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:53,628 INFO L124 PetriNetUnfolderBase]: 2293/3391 cut-off events. [2024-10-31 22:08:53,628 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-10-31 22:08:53,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6761 conditions, 3391 events. 2293/3391 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 19695 event pairs, 155 based on Foata normal form. 106/3433 useless extension candidates. Maximal degree in co-relation 6597. Up to 1928 conditions per place. [2024-10-31 22:08:53,676 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 56 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2024-10-31 22:08:53,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 312 flow [2024-10-31 22:08:53,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:08:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:08:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-10-31 22:08:53,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.624 [2024-10-31 22:08:53,698 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 114 flow. Second operand 5 states and 156 transitions. [2024-10-31 22:08:53,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 312 flow [2024-10-31 22:08:53,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 284 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-31 22:08:53,720 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 114 flow [2024-10-31 22:08:53,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-10-31 22:08:53,728 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2024-10-31 22:08:53,729 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 114 flow [2024-10-31 22:08:53,729 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-31 22:08:53,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:53,730 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-31 22:08:53,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:08:53,731 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-31 22:08:53,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:53,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1428997414, now seen corresponding path program 1 times [2024-10-31 22:08:53,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:53,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135331740] [2024-10-31 22:08:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:54,142 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-31 22:08:54,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:54,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135331740] [2024-10-31 22:08:54,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135331740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:54,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:54,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:54,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386120702] [2024-10-31 22:08:54,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:54,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:54,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:54,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-10-31 22:08:54,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 114 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-31 22:08:54,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:54,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-10-31 22:08:54,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:55,072 INFO L124 PetriNetUnfolderBase]: 3583/5197 cut-off events. [2024-10-31 22:08:55,072 INFO L125 PetriNetUnfolderBase]: For 536/735 co-relation queries the response was YES. [2024-10-31 22:08:55,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10841 conditions, 5197 events. 3583/5197 cut-off events. For 536/735 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 30881 event pairs, 348 based on Foata normal form. 374/5513 useless extension candidates. Maximal degree in co-relation 3329. Up to 3049 conditions per place. [2024-10-31 22:08:55,115 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 66 selfloop transitions, 7 changer transitions 0/88 dead transitions. [2024-10-31 22:08:55,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 88 transitions, 364 flow [2024-10-31 22:08:55,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:55,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:08:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-10-31 22:08:55,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6233333333333333 [2024-10-31 22:08:55,119 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 114 flow. Second operand 6 states and 187 transitions. [2024-10-31 22:08:55,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 88 transitions, 364 flow [2024-10-31 22:08:55,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 355 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:08:55,122 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 159 flow [2024-10-31 22:08:55,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2024-10-31 22:08:55,123 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2024-10-31 22:08:55,124 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 159 flow [2024-10-31 22:08:55,124 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-31 22:08:55,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:55,124 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-31 22:08:55,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:08:55,125 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-31 22:08:55,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 19976746, now seen corresponding path program 2 times [2024-10-31 22:08:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101330423] [2024-10-31 22:08:55,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:55,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,518 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-31 22:08:55,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:55,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101330423] [2024-10-31 22:08:55,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101330423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:55,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:08:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983460317] [2024-10-31 22:08:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:55,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:08:55,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:55,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:08:55,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:08:55,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 50 [2024-10-31 22:08:55,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 159 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-31 22:08:55,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:55,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 50 [2024-10-31 22:08:55,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:08:57,790 INFO L124 PetriNetUnfolderBase]: 8121/11815 cut-off events. [2024-10-31 22:08:57,790 INFO L125 PetriNetUnfolderBase]: For 5032/5231 co-relation queries the response was YES. [2024-10-31 22:08:57,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28567 conditions, 11815 events. 8121/11815 cut-off events. For 5032/5231 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 76039 event pairs, 1373 based on Foata normal form. 342/11917 useless extension candidates. Maximal degree in co-relation 6163. Up to 3579 conditions per place. [2024-10-31 22:08:57,903 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 85 selfloop transitions, 13 changer transitions 0/113 dead transitions. [2024-10-31 22:08:57,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 113 transitions, 563 flow [2024-10-31 22:08:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:08:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2024-10-31 22:08:57,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.66 [2024-10-31 22:08:57,905 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 159 flow. Second operand 6 states and 198 transitions. [2024-10-31 22:08:57,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 113 transitions, 563 flow [2024-10-31 22:08:57,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:08:57,925 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 271 flow [2024-10-31 22:08:57,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2024-10-31 22:08:57,926 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2024-10-31 22:08:57,927 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 271 flow [2024-10-31 22:08:57,927 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-31 22:08:57,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:08:57,927 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-31 22:08:57,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:08:57,928 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-31 22:08:57,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:57,929 INFO L85 PathProgramCache]: Analyzing trace with hash 148955949, now seen corresponding path program 1 times [2024-10-31 22:08:57,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:57,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042648452] [2024-10-31 22:08:57,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:58,139 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-31 22:08:58,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:58,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042648452] [2024-10-31 22:08:58,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042648452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:58,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:58,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:08:58,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157195172] [2024-10-31 22:08:58,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:58,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:58,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-10-31 22:08:58,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-31 22:08:58,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:08:58,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-10-31 22:08:58,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:09:00,309 INFO L124 PetriNetUnfolderBase]: 6705/10196 cut-off events. [2024-10-31 22:09:00,309 INFO L125 PetriNetUnfolderBase]: For 14340/15261 co-relation queries the response was YES. [2024-10-31 22:09:00,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27734 conditions, 10196 events. 6705/10196 cut-off events. For 14340/15261 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 70919 event pairs, 4142 based on Foata normal form. 864/10313 useless extension candidates. Maximal degree in co-relation 12137. Up to 8400 conditions per place. [2024-10-31 22:09:00,411 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 37 selfloop transitions, 2 changer transitions 16/79 dead transitions. [2024-10-31 22:09:00,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 79 transitions, 424 flow [2024-10-31 22:09:00,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:09:00,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:09:00,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-10-31 22:09:00,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.608 [2024-10-31 22:09:00,417 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 271 flow. Second operand 5 states and 152 transitions. [2024-10-31 22:09:00,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 79 transitions, 424 flow [2024-10-31 22:09:00,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:09:00,446 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 288 flow [2024-10-31 22:09:00,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-10-31 22:09:00,448 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2024-10-31 22:09:00,448 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 288 flow [2024-10-31 22:09:00,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-31 22:09:00,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:09:00,449 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] [2024-10-31 22:09:00,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:09:00,450 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-31 22:09:00,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash 302013025, now seen corresponding path program 1 times [2024-10-31 22:09:00,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:00,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608617299] [2024-10-31 22:09:00,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:01,936 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-31 22:09:01,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:01,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608617299] [2024-10-31 22:09:01,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608617299] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:09:01,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915632116] [2024-10-31 22:09:01,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:01,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:09:01,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:09:01,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:09:01,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:09:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:02,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-31 22:09:02,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:09:02,248 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-31 22:09:02,767 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-31 22:09:02,802 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-31 22:09:02,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:09:03,539 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-31 22:09:03,547 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-31 22:09:03,617 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-31 22:09:03,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915632116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:09:03,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:09:03,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-31 22:09:03,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798099683] [2024-10-31 22:09:03,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:09:03,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-31 22:09:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:03,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-31 22:09:03,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2024-10-31 22:09:03,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-10-31 22:09:03,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 288 flow. Second operand has 18 states, 18 states have (on average 23.77777777777778) internal successors, (428), 18 states have internal predecessors, (428), 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-31 22:09:03,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:09:03,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-10-31 22:09:03,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:09:09,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 44#L58true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 7#L147-4true, 98#true, 22#$Ultimate##0true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:09,602 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-10-31 22:09:09,603 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:09:09,603 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-31 22:09:09,603 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:09:10,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 7#L147-4true, 13#thread1EXITtrue, 22#$Ultimate##0true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:10,038 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-10-31 22:09:10,038 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:09:10,038 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:09:10,038 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-31 22:09:10,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 26#L148true, 44#L58true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 22#$Ultimate##0true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:10,043 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-10-31 22:09:10,043 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:09:10,043 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-31 22:09:10,043 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:09:10,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 26#L148true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 13#thread1EXITtrue, 98#true, 22#$Ultimate##0true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:10,507 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-31 22:09:10,507 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:09:10,508 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-31 22:09:10,508 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:09:10,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 44#L58true, 32#L114true, 16#L96true, 41#thread2EXITtrue, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 7#L147-4true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:10,775 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-10-31 22:09:10,775 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:09:10,775 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-10-31 22:09:10,775 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-31 22:09:10,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 34#L148-1true, Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 98#true, 22#$Ultimate##0true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:10,871 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-31 22:09:10,871 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:09:10,871 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-31 22:09:10,872 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:09:11,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 44#L58true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 35#L75true, 7#L147-4true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,038 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,038 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-31 22:09:11,038 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:09:11,039 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:09:11,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 32#L114true, 16#L96true, 41#thread2EXITtrue, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 7#L147-4true, 98#true, 13#thread1EXITtrue, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,111 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,111 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-31 22:09:11,111 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,111 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:09:11,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 26#L148true, 44#L58true, 32#L114true, 16#L96true, 41#thread2EXITtrue, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,115 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,115 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:09:11,115 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-10-31 22:09:11,115 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-31 22:09:11,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), 35#L75true, Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 7#L147-4true, 13#thread1EXITtrue, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,383 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-31 22:09:11,384 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-31 22:09:11,384 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,384 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:09:11,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 26#L148true, 44#L58true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 35#L75true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,388 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,388 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-31 22:09:11,388 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,388 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:09:11,390 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 44#L58true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 12#L78true, 7#L147-4true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,390 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,390 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-10-31 22:09:11,390 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,390 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-31 22:09:11,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 26#L148true, 32#L114true, 16#L96true, 41#thread2EXITtrue, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 13#thread1EXITtrue, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,440 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-31 22:09:11,440 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:09:11,440 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,440 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-31 22:09:11,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 26#L148true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 35#L75true, 13#thread1EXITtrue, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,574 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-31 22:09:11,575 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,575 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-31 22:09:11,575 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:09:11,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 12#L78true, 7#L147-4true, 98#true, 13#thread1EXITtrue, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,579 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-31 22:09:11,579 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,579 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-31 22:09:11,579 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:09:11,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L148true, 44#L58true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 12#L78true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,584 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-10-31 22:09:11,584 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-10-31 22:09:11,585 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,585 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-10-31 22:09:11,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 32#L114true, 16#L96true, 41#thread2EXITtrue, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 34#L148-1true, Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,632 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-10-31 22:09:11,632 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-10-31 22:09:11,632 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-10-31 22:09:11,632 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-31 22:09:11,726 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 26#L148true, 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), Black: 72#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 12#L78true, 98#true, 13#thread1EXITtrue, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,726 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-31 22:09:11,726 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:09:11,727 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,727 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-31 22:09:11,732 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 34#L148-1true, Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 35#L75true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,732 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-31 22:09:11,732 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,733 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:09:11,733 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-31 22:09:11,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 21#L149true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:11,818 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-31 22:09:11,818 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-10-31 22:09:11,819 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-10-31 22:09:11,819 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-10-31 22:09:11,949 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([862] L92-->L96: Formula: (and (not (= (ite (or (<= v_~total~0_124 |v_thread3Thread1of1ForFork1_plus_#res#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483648))) 1 0) 0)) (= v_~q1_front~0_108 (+ v_~q1_front~0_109 1)) (= |v_thread3Thread1of1ForFork1_plus_#res#1_1| (+ v_~total~0_124 (select (select |v_#memory_int#1_87| v_~q1~0.base_115) (+ (* v_~q1_front~0_109 4) v_~q1~0.offset_115)))) (not (= (ite (or (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| 2147483647) (<= |v_thread3Thread1of1ForFork1_plus_#res#1_1| v_~total~0_124)) 1 0) 0)) (<= 0 (+ v_~total~0_123 2147483648)) (<= v_~total~0_123 2147483647) (not (= (ite (and (< v_~q1_front~0_109 v_~n1~0_80) (<= 0 v_~q1_front~0_109) (< v_~q1_front~0_109 v_~q1_back~0_95)) 1 0) 0)) (= v_~total~0_123 |v_thread3Thread1of1ForFork1_plus_#res#1_1|)) InVars {~q1~0.offset=v_~q1~0.offset_115, ~q1_front~0=v_~q1_front~0_109, ~q1_back~0=v_~q1_back~0_95, ~n1~0=v_~n1~0_80, ~q1~0.base=v_~q1~0.base_115, #memory_int#1=|v_#memory_int#1_87|, ~total~0=v_~total~0_124} 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_115, ~q1_front~0=v_~q1_front~0_108, ~n1~0=v_~n1~0_80, 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_123, thread3Thread1of1ForFork1_plus_~a#1=|v_thread3Thread1of1ForFork1_plus_~a#1_1|, ~q1_back~0=v_~q1_back~0_95, thread3Thread1of1ForFork1_plus_#in~b#1=|v_thread3Thread1of1ForFork1_plus_#in~b#1_1|, ~q1~0.base=v_~q1~0.base_115, 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][216], [Black: 92#(<= ~n1~0 0), Black: 94#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0)), Black: 64#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)), 32#L114true, 16#L96true, Black: 69#(or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0)), 84#(and (<= ~q1_front~0 ~q1_back~0) (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), Black: 72#(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: 70#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 34#L148-1true, Black: 78#(<= ~q1_front~0 ~q1_back~0), Black: 79#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 82#(and (<= (div |thread3Thread1of1ForFork1_~cond~2#1| 256) 0) (<= (+ ~q1_front~0 1) ~q1_back~0) (<= 1 |thread3Thread1of1ForFork1_~cond~2#1|)), 12#L78true, 98#true, 89#true, Black: 91#(<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) |ULTIMATE.start_create_fresh_int_array_~size#1|)]) [2024-10-31 22:09:12,088 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-31 22:09:12,088 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-31 22:09:12,088 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-10-31 22:09:12,088 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-10-31 22:09:12,768 INFO L124 PetriNetUnfolderBase]: 24563/36829 cut-off events. [2024-10-31 22:09:12,768 INFO L125 PetriNetUnfolderBase]: For 49725/52320 co-relation queries the response was YES. [2024-10-31 22:09:12,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99354 conditions, 36829 events. 24563/36829 cut-off events. For 49725/52320 co-relation queries the response was YES. Maximal size of possible extension queue 1829. Compared 272422 event pairs, 746 based on Foata normal form. 2127/38239 useless extension candidates. Maximal degree in co-relation 99333. Up to 11788 conditions per place. [2024-10-31 22:09:13,168 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 244 selfloop transitions, 67 changer transitions 3/338 dead transitions. [2024-10-31 22:09:13,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 338 transitions, 1970 flow [2024-10-31 22:09:13,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-31 22:09:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-31 22:09:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 719 transitions. [2024-10-31 22:09:13,175 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847619047619048 [2024-10-31 22:09:13,175 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 288 flow. Second operand 21 states and 719 transitions. [2024-10-31 22:09:13,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 338 transitions, 1970 flow [2024-10-31 22:09:13,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 338 transitions, 1928 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-10-31 22:09:13,398 INFO L231 Difference]: Finished difference. Result has 90 places, 131 transitions, 900 flow [2024-10-31 22:09:13,398 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=900, PETRI_PLACES=90, PETRI_TRANSITIONS=131} [2024-10-31 22:09:13,399 INFO L277 CegarLoopForPetriNet]: 52 programPoint places, 38 predicate places. [2024-10-31 22:09:13,399 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 131 transitions, 900 flow [2024-10-31 22:09:13,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 23.77777777777778) internal successors, (428), 18 states have internal predecessors, (428), 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-31 22:09:13,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:09:13,401 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, 1] [2024-10-31 22:09:13,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:09:13,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ac5e11c4-0a93-416d-bf38-4d2f162a9d07/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:09:13,605 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-31 22:09:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash 503638260, now seen corresponding path program 1 times [2024-10-31 22:09:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147793205] [2024-10-31 22:09:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat