/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 13:31:43,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 13:31:43,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 13:31:43,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 13:31:43,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 13:31:43,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 13:31:43,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 13:31:43,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 13:31:43,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 13:31:43,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 13:31:43,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 13:31:43,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 13:31:43,807 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 13:31:43,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 13:31:43,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 13:31:43,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 13:31:43,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 13:31:43,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 13:31:43,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 13:31:43,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 13:31:43,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 13:31:43,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 13:31:43,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 13:31:43,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:31:43,810 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:31:43,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:31:43,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 13:31:43,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 13:31:44,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 13:31:44,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 13:31:44,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 13:31:44,017 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 13:31:44,018 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 13:31:44,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i [2025-04-14 13:31:45,257 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c686a6b2/1bf07e5e2ca14bd0a25c2af136cfaf2c/FLAG2bba63711 [2025-04-14 13:31:45,644 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 13:31:45,645 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i [2025-04-14 13:31:45,683 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c686a6b2/1bf07e5e2ca14bd0a25c2af136cfaf2c/FLAG2bba63711 [2025-04-14 13:31:46,390 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c686a6b2/1bf07e5e2ca14bd0a25c2af136cfaf2c [2025-04-14 13:31:46,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 13:31:46,392 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 13:31:46,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 13:31:46,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 13:31:46,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 13:31:46,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:31:46" (1/1) ... [2025-04-14 13:31:46,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@185f6a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:46, skipping insertion in model container [2025-04-14 13:31:46,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:31:46" (1/1) ... [2025-04-14 13:31:46,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 13:31:47,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-04-14 13:31:47,910 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-04-14 13:31:47,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-04-14 13:31:47,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-04-14 13:31:47,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-04-14 13:31:47,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-04-14 13:31:47,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-04-14 13:31:47,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:31:47,947 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 13:31:48,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-04-14 13:31:48,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-04-14 13:31:48,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-04-14 13:31:48,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-04-14 13:31:48,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-04-14 13:31:48,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-04-14 13:31:48,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-04-14 13:31:48,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-04-14 13:31:48,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-04-14 13:31:48,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-04-14 13:31:48,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-04-14 13:31:48,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-04-14 13:31:48,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-04-14 13:31:48,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-04-14 13:31:48,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-04-14 13:31:48,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-04-14 13:31:48,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-04-14 13:31:48,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-04-14 13:31:48,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-04-14 13:31:48,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-04-14 13:31:48,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-04-14 13:31:48,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-04-14 13:31:48,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-04-14 13:31:48,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-04-14 13:31:48,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-04-14 13:31:48,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-04-14 13:31:48,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-04-14 13:31:48,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-04-14 13:31:48,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-04-14 13:31:48,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-04-14 13:31:48,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-04-14 13:31:48,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-04-14 13:31:48,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-04-14 13:31:48,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-04-14 13:31:48,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-04-14 13:31:48,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-04-14 13:31:48,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-04-14 13:31:48,068 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-04-14 13:31:48,068 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-04-14 13:31:48,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-04-14 13:31:48,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-04-14 13:31:48,069 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-04-14 13:31:48,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-04-14 13:31:48,070 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-04-14 13:31:48,071 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-04-14 13:31:48,071 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-04-14 13:31:48,071 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-04-14 13:31:48,072 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-04-14 13:31:48,072 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-04-14 13:31:48,072 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-04-14 13:31:48,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-04-14 13:31:48,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-04-14 13:31:48,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-04-14 13:31:48,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-04-14 13:31:48,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-04-14 13:31:48,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-04-14 13:31:48,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-04-14 13:31:48,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-04-14 13:31:48,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-04-14 13:31:48,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-04-14 13:31:48,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-04-14 13:31:48,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-04-14 13:31:48,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-04-14 13:31:48,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-04-14 13:31:48,077 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-04-14 13:31:48,078 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-04-14 13:31:48,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-04-14 13:31:48,079 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-04-14 13:31:48,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-04-14 13:31:48,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-04-14 13:31:48,080 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-04-14 13:31:48,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-04-14 13:31:48,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-04-14 13:31:48,081 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-04-14 13:31:48,082 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-04-14 13:31:48,082 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-04-14 13:31:48,082 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-04-14 13:31:48,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-04-14 13:31:48,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-04-14 13:31:48,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-04-14 13:31:48,083 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-04-14 13:31:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-04-14 13:31:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-04-14 13:31:48,084 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-04-14 13:31:48,085 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-04-14 13:31:48,085 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-04-14 13:31:48,085 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-04-14 13:31:48,085 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-04-14 13:31:48,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-04-14 13:31:48,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-04-14 13:31:48,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-04-14 13:31:48,086 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-04-14 13:31:48,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-04-14 13:31:48,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-04-14 13:31:48,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-04-14 13:31:48,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-04-14 13:31:48,088 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-04-14 13:31:48,088 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-04-14 13:31:48,088 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-04-14 13:31:48,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-04-14 13:31:48,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-04-14 13:31:48,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-04-14 13:31:48,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-04-14 13:31:48,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-04-14 13:31:48,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-04-14 13:31:48,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-04-14 13:31:48,143 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-04-14 13:31:48,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:31:48,367 INFO L204 MainTranslator]: Completed translation [2025-04-14 13:31:48,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48 WrapperNode [2025-04-14 13:31:48,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 13:31:48,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 13:31:48,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 13:31:48,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 13:31:48,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,494 INFO L138 Inliner]: procedures = 914, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 628 [2025-04-14 13:31:48,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 13:31:48,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 13:31:48,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 13:31:48,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 13:31:48,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,539 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,543 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,553 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 13:31:48,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 13:31:48,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 13:31:48,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 13:31:48,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (1/1) ... [2025-04-14 13:31:48,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:31:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:31:48,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 13:31:48,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 13:31:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 13:31:48,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 13:31:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-14 13:31:48,626 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-14 13:31:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 13:31:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 13:31:48,627 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 13:31:48,772 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 13:31:48,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 13:31:49,458 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 13:31:49,458 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 13:31:49,792 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 13:31:49,792 INFO L312 CfgBuilder]: Removed 20 assume(true) statements. [2025-04-14 13:31:49,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:31:49 BoogieIcfgContainer [2025-04-14 13:31:49,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 13:31:49,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 13:31:49,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 13:31:49,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 13:31:49,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:31:46" (1/3) ... [2025-04-14 13:31:49,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ccb39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:31:49, skipping insertion in model container [2025-04-14 13:31:49,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:31:48" (2/3) ... [2025-04-14 13:31:49,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60ccb39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:31:49, skipping insertion in model container [2025-04-14 13:31:49,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:31:49" (3/3) ... [2025-04-14 13:31:49,798 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-04-14 13:31:49,810 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 13:31:49,811 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_mpmc_check_full.i that has 2 procedures, 125 locations, 178 edges, 1 initial locations, 23 loop locations, and 7 error locations. [2025-04-14 13:31:49,812 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 13:31:49,883 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 13:31:49,921 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:31:49,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 13:31:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:31:49,925 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 13:31:49,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 13:31:50,022 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:31:50,037 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:31:50,044 INFO L340 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=PARTIAL_ORDER_FA, 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;@5334c58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:31:50,044 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 13:31:51,287 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:31:51,287 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:31:51,287 INFO L139 ounterexampleChecker]: Examining path program with hash 1787542133, occurence #1 [2025-04-14 13:31:51,287 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:31:51,287 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:31:51,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:31:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1411605412, now seen corresponding path program 1 times [2025-04-14 13:31:51,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:31:51,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933686390] [2025-04-14 13:31:51,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:31:51,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:31:51,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 13:31:51,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 13:31:51,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:31:51,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:31:51,501 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:31:51,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 13:31:51,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 13:31:51,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:31:51,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:31:51,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:31:51,634 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:31:51,635 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-14 13:31:51,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-14 13:31:51,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-14 13:31:51,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-14 13:31:51,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-14 13:31:51,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-14 13:31:51,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-14 13:31:51,636 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-14 13:31:51,636 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 13:31:51,639 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-14 13:31:51,641 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:31:51,641 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 13:31:51,694 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 13:31:51,699 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:31:51,726 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:31:51,726 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:31:51,726 INFO L340 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=PARTIAL_ORDER_FA, 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;@5334c58f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:31:51,726 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 13:31:58,007 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:31:58,007 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:31:58,007 INFO L139 ounterexampleChecker]: Examining path program with hash -1164545956, occurence #1 [2025-04-14 13:31:58,007 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:31:58,008 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:31:58,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:31:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1986655527, now seen corresponding path program 1 times [2025-04-14 13:31:58,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:31:58,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81759270] [2025-04-14 13:31:58,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:31:58,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:31:58,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 13:31:58,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 13:31:58,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:31:58,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:31:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:31:58,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:31:58,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81759270] [2025-04-14 13:31:58,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81759270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:31:58,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:31:58,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 13:31:58,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160706405] [2025-04-14 13:31:58,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:31:58,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 13:31:58,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:31:58,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 13:31:58,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 13:31:58,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:31:58,146 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:31:58,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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) [2025-04-14 13:31:58,147 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:31:59,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:31:59,898 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 13:31:59,898 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:31:59,898 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:31:59,899 INFO L139 ounterexampleChecker]: Examining path program with hash 295218294, occurence #1 [2025-04-14 13:31:59,899 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:31:59,899 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:31:59,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:31:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1722852705, now seen corresponding path program 1 times [2025-04-14 13:31:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:31:59,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731131972] [2025-04-14 13:31:59,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:31:59,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:31:59,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 13:31:59,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 13:31:59,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:31:59,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:32:00,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:00,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731131972] [2025-04-14 13:32:00,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731131972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:00,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:00,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:32:00,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415415220] [2025-04-14 13:32:00,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:00,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:32:00,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:00,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:32:00,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:32:00,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:00,071 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:00,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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) [2025-04-14 13:32:00,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:00,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:00,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:00,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:00,155 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 13:32:00,155 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:32:00,155 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:32:00,155 INFO L139 ounterexampleChecker]: Examining path program with hash 2064626266, occurence #1 [2025-04-14 13:32:00,155 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:32:00,155 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:32:00,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:32:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1606987198, now seen corresponding path program 1 times [2025-04-14 13:32:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:32:00,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613006979] [2025-04-14 13:32:00,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:32:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:32:00,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 13:32:00,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 13:32:00,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:32:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:32:00,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:00,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613006979] [2025-04-14 13:32:00,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613006979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:00,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:00,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:32:00,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754471701] [2025-04-14 13:32:00,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:00,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:32:00,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:00,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:32:00,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:32:00,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:00,322 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:00,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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) [2025-04-14 13:32:00,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:00,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:00,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:06,801 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:06,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:06,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:06,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 13:32:06,802 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:32:06,802 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:32:06,802 INFO L139 ounterexampleChecker]: Examining path program with hash -872379663, occurence #1 [2025-04-14 13:32:06,802 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:32:06,802 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:32:06,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:32:06,803 INFO L85 PathProgramCache]: Analyzing trace with hash -388059867, now seen corresponding path program 1 times [2025-04-14 13:32:06,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:32:06,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692746313] [2025-04-14 13:32:06,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:32:06,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:32:06,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-04-14 13:32:06,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-04-14 13:32:06,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:32:06,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:32:07,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:07,035 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692746313] [2025-04-14 13:32:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692746313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:32:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564695476] [2025-04-14 13:32:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:07,036 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:32:07,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:07,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:32:07,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:32:07,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:07,036 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:07,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2025-04-14 13:32:07,036 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:07,036 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:07,036 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:07,036 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:07,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:07,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:07,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:07,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:07,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 13:32:07,876 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:32:07,876 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:32:07,876 INFO L139 ounterexampleChecker]: Examining path program with hash -1442859595, occurence #1 [2025-04-14 13:32:07,876 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:32:07,876 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:32:07,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:32:07,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1129147793, now seen corresponding path program 1 times [2025-04-14 13:32:07,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:32:07,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922484321] [2025-04-14 13:32:07,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:32:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:32:07,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-04-14 13:32:07,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-04-14 13:32:07,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:32:07,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:08,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:32:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:08,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922484321] [2025-04-14 13:32:08,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922484321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:08,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:08,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:32:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86910173] [2025-04-14 13:32:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:08,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:32:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:08,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:32:08,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:32:08,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,038 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:08,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:32:08,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:08,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,038 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:08,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,212 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 13:32:08,213 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:32:08,213 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:32:08,213 INFO L139 ounterexampleChecker]: Examining path program with hash 994982089, occurence #1 [2025-04-14 13:32:08,213 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:32:08,213 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:32:08,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:32:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1043309165, now seen corresponding path program 1 times [2025-04-14 13:32:08,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:32:08,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610954887] [2025-04-14 13:32:08,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:32:08,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:32:08,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-04-14 13:32:08,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-04-14 13:32:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:32:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:32:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:08,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610954887] [2025-04-14 13:32:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610954887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:08,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:08,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:32:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514776781] [2025-04-14 13:32:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:08,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:32:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:08,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:32:08,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:32:08,388 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,388 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:08,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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) [2025-04-14 13:32:08,389 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,389 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,389 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:08,389 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,389 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,389 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:08,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 13:32:08,500 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:32:08,500 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:32:08,500 INFO L139 ounterexampleChecker]: Examining path program with hash 2049951276, occurence #1 [2025-04-14 13:32:08,500 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:32:08,500 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:32:08,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:32:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash -240693926, now seen corresponding path program 1 times [2025-04-14 13:32:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:32:08,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449897588] [2025-04-14 13:32:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:32:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:32:08,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-04-14 13:32:08,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 13:32:08,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:32:08,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:32:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:08,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449897588] [2025-04-14 13:32:08,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449897588] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:08,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:08,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:32:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078792122] [2025-04-14 13:32:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:08,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:32:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:08,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:32:08,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:32:08,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,735 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:08,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:32:08,735 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:08,735 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,735 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:08,735 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,735 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,735 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:08,735 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:09,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:09,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:09,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,233 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 13:32:09,233 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:32:09,233 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:32:09,233 INFO L139 ounterexampleChecker]: Examining path program with hash 2131611930, occurence #1 [2025-04-14 13:32:09,233 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:32:09,233 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:32:09,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:32:09,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1187133430, now seen corresponding path program 2 times [2025-04-14 13:32:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:32:09,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951510675] [2025-04-14 13:32:09,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:32:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:32:09,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 106 statements into 2 equivalence classes. [2025-04-14 13:32:09,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 91 of 106 statements. [2025-04-14 13:32:09,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 13:32:09,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:09,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-04-14 13:32:09,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:09,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951510675] [2025-04-14 13:32:09,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951510675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:09,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:09,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:32:09,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349877886] [2025-04-14 13:32:09,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:09,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:32:09,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:09,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:32:09,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:32:09,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:09,412 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:09,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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) [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:09,413 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,235 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 13:32:36,235 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:32:36,236 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:32:36,236 INFO L139 ounterexampleChecker]: Examining path program with hash -1146370784, occurence #1 [2025-04-14 13:32:36,236 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:32:36,236 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:32:36,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:32:36,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2114670102, now seen corresponding path program 1 times [2025-04-14 13:32:36,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:32:36,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845943968] [2025-04-14 13:32:36,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:32:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:32:36,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-04-14 13:32:36,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-04-14 13:32:36,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:32:36,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:32:36,434 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-14 13:32:36,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:32:36,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845943968] [2025-04-14 13:32:36,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845943968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:32:36,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:32:36,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:32:36,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323269883] [2025-04-14 13:32:36,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:32:36,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:32:36,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:32:36,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:32:36,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:32:36,438 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:36,438 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:32:36,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-04-14 13:32:36,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:32:36,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:32:36,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,438 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:32:36,439 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:07,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:07,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 13:33:07,403 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:33:07,403 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:33:07,404 INFO L139 ounterexampleChecker]: Examining path program with hash -1600195855, occurence #1 [2025-04-14 13:33:07,404 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:33:07,404 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:33:07,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:33:07,404 INFO L85 PathProgramCache]: Analyzing trace with hash -907032789, now seen corresponding path program 2 times [2025-04-14 13:33:07,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:33:07,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455415208] [2025-04-14 13:33:07,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:33:07,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:33:07,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 334 statements into 2 equivalence classes. [2025-04-14 13:33:07,461 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 113 of 334 statements. [2025-04-14 13:33:07,461 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 13:33:07,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:08,173 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-04-14 13:33:08,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:33:08,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455415208] [2025-04-14 13:33:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455415208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:33:08,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:33:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 13:33:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162964045] [2025-04-14 13:33:08,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:33:08,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:33:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:33:08,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:33:08,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:33:08,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:08,174 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:33:08,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 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) [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,175 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:08,434 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 13:33:08,434 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:33:08,435 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:33:08,435 INFO L139 ounterexampleChecker]: Examining path program with hash -2078755692, occurence #1 [2025-04-14 13:33:08,435 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:33:08,435 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:33:08,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:33:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 323400116, now seen corresponding path program 1 times [2025-04-14 13:33:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:33:08,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899153607] [2025-04-14 13:33:08,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:33:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:33:08,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-14 13:33:08,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-14 13:33:08,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:33:08,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-14 13:33:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:33:09,220 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899153607] [2025-04-14 13:33:09,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899153607] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:33:09,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:33:09,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 13:33:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861315616] [2025-04-14 13:33:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:33:09,220 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:33:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:33:09,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:33:09,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:33:09,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:09,221 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:33:09,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 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) [2025-04-14 13:33:09,221 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:09,222 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:11,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:11,530 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:11,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:11,531 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 13:33:11,531 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:33:11,531 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:33:11,531 INFO L139 ounterexampleChecker]: Examining path program with hash -1238105594, occurence #1 [2025-04-14 13:33:11,531 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:33:11,531 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:33:11,532 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:33:11,532 INFO L85 PathProgramCache]: Analyzing trace with hash 667481298, now seen corresponding path program 1 times [2025-04-14 13:33:11,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:33:11,532 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176085942] [2025-04-14 13:33:11,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:33:11,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:33:11,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-04-14 13:33:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-04-14 13:33:11,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:33:11,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-04-14 13:33:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:33:14,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176085942] [2025-04-14 13:33:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176085942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:33:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:33:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-14 13:33:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624926311] [2025-04-14 13:33:14,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:33:14,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 13:33:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:33:14,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 13:33:14,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-14 13:33:14,104 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:14,104 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:33:14,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:14,104 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:15,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:15,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 13:33:15,696 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:33:15,696 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:33:15,697 INFO L139 ounterexampleChecker]: Examining path program with hash 606731843, occurence #1 [2025-04-14 13:33:15,697 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:33:15,697 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:33:15,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:33:15,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1692798732, now seen corresponding path program 2 times [2025-04-14 13:33:15,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:33:15,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208844310] [2025-04-14 13:33:15,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:33:15,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:33:15,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 268 statements into 2 equivalence classes. [2025-04-14 13:33:15,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 113 of 268 statements. [2025-04-14 13:33:15,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 13:33:15,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-04-14 13:33:16,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:33:16,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208844310] [2025-04-14 13:33:16,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208844310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:33:16,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:33:16,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-14 13:33:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199434759] [2025-04-14 13:33:16,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:33:16,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 13:33:16,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:33:16,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 13:33:16,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-14 13:33:16,784 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:16,784 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:33:16,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:16,785 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:20,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:20,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:20,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:20,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:33:20,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 13:33:20,994 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:33:20,994 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:33:20,994 INFO L139 ounterexampleChecker]: Examining path program with hash 71296629, occurence #1 [2025-04-14 13:33:20,994 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:33:20,994 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:33:20,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:33:20,994 INFO L85 PathProgramCache]: Analyzing trace with hash 374947878, now seen corresponding path program 1 times [2025-04-14 13:33:20,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:33:20,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410011719] [2025-04-14 13:33:20,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:33:20,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:33:21,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-04-14 13:33:21,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-04-14 13:33:21,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:33:21,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 169 proven. 47 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-04-14 13:33:21,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:33:21,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410011719] [2025-04-14 13:33:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410011719] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:33:21,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792192928] [2025-04-14 13:33:21,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:33:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:33:21,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:33:21,396 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:33:21,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 13:33:21,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-04-14 13:33:21,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-04-14 13:33:21,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:33:21,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:21,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 3109 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-14 13:33:22,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:33:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 169 proven. 47 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-04-14 13:33:22,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:33:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 169 proven. 47 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-04-14 13:33:22,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792192928] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 13:33:22,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 13:33:22,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 15 [2025-04-14 13:33:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385299970] [2025-04-14 13:33:22,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 13:33:22,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 13:33:22,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:33:22,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 13:33:22,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-14 13:33:22,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:22,395 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:33:22,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.733333333333334) internal successors, (251), 15 states have internal predecessors, (251), 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) [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:33:22,395 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:33:23,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:33:23,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 13:33:24,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 13:33:24,162 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:33:24,162 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:33:24,162 INFO L139 ounterexampleChecker]: Examining path program with hash -503955921, occurence #1 [2025-04-14 13:33:24,162 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:33:24,162 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:33:24,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:33:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1253510218, now seen corresponding path program 2 times [2025-04-14 13:33:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:33:24,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753510793] [2025-04-14 13:33:24,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:33:24,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:33:24,194 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 196 statements into 2 equivalence classes. [2025-04-14 13:33:24,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 118 of 196 statements. [2025-04-14 13:33:24,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 13:33:24,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-04-14 13:33:29,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:33:29,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753510793] [2025-04-14 13:33:29,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753510793] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:33:29,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:33:29,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-04-14 13:33:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315627362] [2025-04-14 13:33:29,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:33:29,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 13:33:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:33:29,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 13:33:29,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2025-04-14 13:33:29,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:29,176 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:33:29,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 25 states have internal predecessors, (88), 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) [2025-04-14 13:33:29,176 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:29,176 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:29,176 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:29,176 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:29,176 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:33:29,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:33:35,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:33:35,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:33:35,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 13:33:35,157 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:33:35,157 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:33:35,158 INFO L139 ounterexampleChecker]: Examining path program with hash -830083867, occurence #1 [2025-04-14 13:33:35,158 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:33:35,158 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:33:35,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:33:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash -168102472, now seen corresponding path program 3 times [2025-04-14 13:33:35,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:33:35,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851116620] [2025-04-14 13:33:35,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 13:33:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:33:35,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 211 statements into 4 equivalence classes. [2025-04-14 13:33:35,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 117 of 211 statements. [2025-04-14 13:33:35,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 13:33:35,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:33:41,552 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-04-14 13:33:41,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:33:41,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851116620] [2025-04-14 13:33:41,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851116620] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:33:41,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:33:41,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2025-04-14 13:33:41,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208988578] [2025-04-14 13:33:41,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:33:41,553 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-14 13:33:41,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:33:41,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-14 13:33:41,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2025-04-14 13:33:41,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:41,555 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:33:41,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.4) internal successors, (102), 29 states have internal predecessors, (102), 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) [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:33:41,555 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:34:03,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:34:03,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 13:34:03,553 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:34:03,553 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:34:03,553 INFO L139 ounterexampleChecker]: Examining path program with hash 484021328, occurence #1 [2025-04-14 13:34:03,553 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:34:03,553 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:34:03,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:34:03,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1194249884, now seen corresponding path program 4 times [2025-04-14 13:34:03,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:34:03,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310483622] [2025-04-14 13:34:03,553 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 13:34:03,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:34:03,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 179 statements into 2 equivalence classes. [2025-04-14 13:34:03,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 179 of 179 statements. [2025-04-14 13:34:03,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 13:34:03,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:34:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-14 13:34:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:34:03,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310483622] [2025-04-14 13:34:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310483622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:34:03,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:34:03,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:34:03,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102781029] [2025-04-14 13:34:03,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:34:03,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 13:34:03,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:34:03,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 13:34:03,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 13:34:03,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:03,777 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:34:03,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:34:03,777 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:03,777 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,777 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:03,777 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:34:03,778 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:11,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:34:11,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:34:11,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:34:11,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:34:11,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:34:11,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:11,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 13:34:11,072 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:34:11,072 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:34:11,072 INFO L139 ounterexampleChecker]: Examining path program with hash 1131370630, occurence #1 [2025-04-14 13:34:11,072 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:34:11,072 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:34:11,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:34:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash -159171579, now seen corresponding path program 5 times [2025-04-14 13:34:11,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:34:11,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518966176] [2025-04-14 13:34:11,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 13:34:11,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:34:11,098 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-04-14 13:34:11,571 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements. [2025-04-14 13:34:11,571 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 13:34:11,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:34:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:34:21,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:34:21,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518966176] [2025-04-14 13:34:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518966176] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:34:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:34:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2025-04-14 13:34:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219112587] [2025-04-14 13:34:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:34:21,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-14 13:34:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:34:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-14 13:34:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1222, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 13:34:21,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:21,592 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:34:21,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.324324324324324) internal successors, (123), 36 states have internal predecessors, (123), 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) [2025-04-14 13:34:21,592 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:21,592 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:21,592 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:21,592 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:21,592 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:21,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:36,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:36,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-14 13:34:36,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 13:34:36,933 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:34:36,933 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:34:36,934 INFO L139 ounterexampleChecker]: Examining path program with hash 691347504, occurence #1 [2025-04-14 13:34:36,934 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:34:36,934 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:34:36,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:34:36,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1005427518, now seen corresponding path program 1 times [2025-04-14 13:34:36,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:34:36,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927816531] [2025-04-14 13:34:36,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:34:36,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:34:36,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-04-14 13:34:37,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-04-14 13:34:37,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:34:37,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:34:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:34:51,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:34:51,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927816531] [2025-04-14 13:34:51,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927816531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:34:51,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564360127] [2025-04-14 13:34:51,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:34:51,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:34:51,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:34:51,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:34:51,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 13:34:51,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-04-14 13:34:51,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-04-14 13:34:51,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:34:51,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:34:51,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1587 conjuncts, 763 conjuncts are in the unsatisfiable core [2025-04-14 13:34:51,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:34:52,028 INFO L354 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 11 treesize of output 7 [2025-04-14 13:34:52,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-04-14 13:34:52,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:52,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,134 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:52,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:52,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:52,389 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:52,395 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-04-14 13:34:52,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:52,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 13:34:52,634 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 13:34:52,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 13:34:52,721 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 13:34:52,728 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:52,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 13:34:52,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,768 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:52,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 13:34:52,790 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:52,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,939 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:52,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:52,942 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 13:34:53,360 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-14 13:34:53,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:53,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 13:34:53,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:53,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 13:34:53,655 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:54,138 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-04-14 13:34:54,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:54,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:54,341 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 13:34:54,425 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 13:34:54,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-04-14 13:34:54,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:54,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 13:34:54,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:54,550 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:54,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:54,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 13:34:54,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:34:54,565 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 13:34:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:34:55,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:34:55,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564360127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:34:55,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:34:55,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [52] total 90 [2025-04-14 13:34:55,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606933009] [2025-04-14 13:34:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:34:55,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-14 13:34:55,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:34:55,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-14 13:34:55,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=7945, Unknown=0, NotChecked=0, Total=8190 [2025-04-14 13:34:55,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:55,861 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:34:55,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.925) internal successors, (117), 39 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:34:55,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2025-04-14 13:34:55,862 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:14,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:14,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:14,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 13:35:14,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:35:14,990 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:35:14,990 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:35:14,990 INFO L139 ounterexampleChecker]: Examining path program with hash 685742762, occurence #1 [2025-04-14 13:35:14,990 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:35:14,990 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:35:14,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:35:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash 278259703, now seen corresponding path program 6 times [2025-04-14 13:35:14,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:35:14,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938800030] [2025-04-14 13:35:14,991 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 13:35:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:35:15,022 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 124 statements into 1 equivalence classes. [2025-04-14 13:35:15,208 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-04-14 13:35:15,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-14 13:35:15,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:35:28,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:35:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:35:28,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938800030] [2025-04-14 13:35:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938800030] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:35:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:35:28,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2025-04-14 13:35:28,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2675092] [2025-04-14 13:35:28,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:35:28,135 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-04-14 13:35:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:35:28,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-04-14 13:35:28,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2420, Unknown=0, NotChecked=0, Total=2550 [2025-04-14 13:35:28,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:28,136 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:35:28,136 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.2745098039215685) internal successors, (116), 50 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) [2025-04-14 13:35:28,136 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:28,137 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:46,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:46,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:46,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:46,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:46,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:46,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:46,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:46,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 13:35:46,949 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:35:46,949 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:35:46,949 INFO L139 ounterexampleChecker]: Examining path program with hash 1583619696, occurence #1 [2025-04-14 13:35:46,949 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:35:46,949 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:35:46,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:35:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1369550402, now seen corresponding path program 1 times [2025-04-14 13:35:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:35:46,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916179428] [2025-04-14 13:35:46,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:35:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:35:46,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-04-14 13:35:46,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-04-14 13:35:46,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:35:46,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:35:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:35:47,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:35:47,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916179428] [2025-04-14 13:35:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916179428] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:35:47,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:35:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:35:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94911852] [2025-04-14 13:35:47,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:35:47,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:35:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:35:47,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:35:47,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:35:47,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:47,083 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:35:47,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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) [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:47,083 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:47,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:47,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 13:35:47,203 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:35:47,203 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:35:47,204 INFO L139 ounterexampleChecker]: Examining path program with hash 1779448041, occurence #1 [2025-04-14 13:35:47,204 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:35:47,204 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:35:47,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:35:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash 39409035, now seen corresponding path program 1 times [2025-04-14 13:35:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:35:47,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907747596] [2025-04-14 13:35:47,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:35:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:35:47,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-04-14 13:35:47,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-04-14 13:35:47,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:35:47,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:35:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:35:47,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:35:47,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907747596] [2025-04-14 13:35:47,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907747596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:35:47,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:35:47,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 13:35:47,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117121216] [2025-04-14 13:35:47,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:35:47,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 13:35:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:35:47,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 13:35:47,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-14 13:35:47,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:47,670 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:35:47,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 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) [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:47,671 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:48,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:48,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:48,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:48,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 13:35:48,807 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:35:48,807 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:35:48,808 INFO L139 ounterexampleChecker]: Examining path program with hash 1537068736, occurence #1 [2025-04-14 13:35:48,808 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:35:48,808 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:35:48,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:35:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1557464143, now seen corresponding path program 1 times [2025-04-14 13:35:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:35:48,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410536112] [2025-04-14 13:35:48,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:35:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:35:48,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-04-14 13:35:48,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-04-14 13:35:48,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:35:48,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:35:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:35:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:35:48,939 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410536112] [2025-04-14 13:35:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410536112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:35:48,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:35:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:35:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472466381] [2025-04-14 13:35:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:35:48,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 13:35:48,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:35:48,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 13:35:48,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 13:35:48,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:48,940 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:35:48,940 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:48,940 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:48,941 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:35:49,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 13:35:49,216 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:35:49,216 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:35:49,216 INFO L139 ounterexampleChecker]: Examining path program with hash -389536779, occurence #1 [2025-04-14 13:35:49,216 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:35:49,216 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:35:49,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:35:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash -293930058, now seen corresponding path program 1 times [2025-04-14 13:35:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:35:49,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977546606] [2025-04-14 13:35:49,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:35:49,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:35:49,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-04-14 13:35:49,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-04-14 13:35:49,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:35:49,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:35:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:35:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:35:49,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977546606] [2025-04-14 13:35:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977546606] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:35:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:35:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 13:35:49,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122864999] [2025-04-14 13:35:49,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:35:49,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:35:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:35:49,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:35:49,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:35:49,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:49,350 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:35:49,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:35:49,350 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:49,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:49,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:49,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:35:49,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:49,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 13:35:49,474 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:35:49,474 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:35:49,474 INFO L139 ounterexampleChecker]: Examining path program with hash 1386990276, occurence #1 [2025-04-14 13:35:49,474 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:35:49,474 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:35:49,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:35:49,474 INFO L85 PathProgramCache]: Analyzing trace with hash 560672458, now seen corresponding path program 1 times [2025-04-14 13:35:49,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:35:49,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089461024] [2025-04-14 13:35:49,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:35:49,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:35:49,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-04-14 13:35:50,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-04-14 13:35:50,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:35:50,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:35:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:35:54,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:35:54,151 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089461024] [2025-04-14 13:35:54,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089461024] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:35:54,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:35:54,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-04-14 13:35:54,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538641992] [2025-04-14 13:35:54,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:35:54,152 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 13:35:54,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:35:54,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 13:35:54,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2025-04-14 13:35:54,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:54,152 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:35:54,152 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:35:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:35:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,152 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:35:54,153 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:36:41,928 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:41,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 13:36:41,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 13:36:41,929 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:36:41,930 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:36:41,930 INFO L139 ounterexampleChecker]: Examining path program with hash 1768134501, occurence #1 [2025-04-14 13:36:41,930 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:36:41,930 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:36:41,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:36:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1568999059, now seen corresponding path program 7 times [2025-04-14 13:36:41,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:36:41,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532167436] [2025-04-14 13:36:41,930 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 13:36:41,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:36:41,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-04-14 13:36:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-04-14 13:36:42,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:36:42,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:36:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:36:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:36:54,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532167436] [2025-04-14 13:36:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532167436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:36:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:36:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2025-04-14 13:36:54,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710393525] [2025-04-14 13:36:54,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:36:54,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-04-14 13:36:54,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:36:54,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-04-14 13:36:54,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=3041, Unknown=0, NotChecked=0, Total=3192 [2025-04-14 13:36:54,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:36:54,524 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:36:54,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.175438596491228) internal successors, (124), 56 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-14 13:36:54,524 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:37:15,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:37:15,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 13:37:15,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-04-14 13:37:15,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 13:37:15,291 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:37:15,291 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:37:15,292 INFO L139 ounterexampleChecker]: Examining path program with hash -1825585281, occurence #1 [2025-04-14 13:37:15,292 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:37:15,292 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:37:15,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:37:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1686160210, now seen corresponding path program 2 times [2025-04-14 13:37:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:37:15,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348940294] [2025-04-14 13:37:15,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 13:37:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:37:15,321 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 1 equivalence classes. [2025-04-14 13:37:15,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-04-14 13:37:15,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 13:37:15,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:37:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:37:24,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:37:24,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348940294] [2025-04-14 13:37:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348940294] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:37:24,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:37:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-04-14 13:37:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173137667] [2025-04-14 13:37:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:37:24,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 13:37:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:37:24,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 13:37:24,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2025-04-14 13:37:24,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:37:24,540 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:37:24,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.15625) internal successors, (133), 31 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2025-04-14 13:37:24,540 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2025-04-14 13:37:24,541 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:37:33,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-04-14 13:37:33,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-14 13:37:33,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 13:37:33,922 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 13:37:33,922 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:37:33,922 INFO L139 ounterexampleChecker]: Examining path program with hash -715451335, occurence #1 [2025-04-14 13:37:33,922 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:37:33,922 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:37:33,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:37:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1237262355, now seen corresponding path program 1 times [2025-04-14 13:37:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:37:33,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325345538] [2025-04-14 13:37:33,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:37:33,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:37:33,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-04-14 13:37:34,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-04-14 13:37:34,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:37:34,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:37:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:37:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:37:43,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325345538] [2025-04-14 13:37:43,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325345538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 13:37:43,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284471269] [2025-04-14 13:37:43,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:37:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:37:43,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:37:43,117 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:37:43,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 13:37:43,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-04-14 13:37:43,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-04-14 13:37:43,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:37:43,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:37:43,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 620 conjuncts are in the unsatisfiable core [2025-04-14 13:37:43,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:37:43,654 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2025-04-14 13:37:43,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-14 13:37:43,713 INFO L354 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 19 treesize of output 1 [2025-04-14 13:37:43,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-14 13:37:43,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-14 13:37:43,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:43,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-14 13:37:43,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:43,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-04-14 13:37:44,030 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:37:44,031 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-04-14 13:37:44,037 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-14 13:37:44,094 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 13:37:44,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 13:37:44,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-14 13:37:44,166 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-04-14 13:37:44,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:44,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-14 13:37:44,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:44,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-04-14 13:37:44,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-14 13:37:44,214 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-04-14 13:37:44,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2025-04-14 13:37:44,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-14 13:37:44,692 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-14 13:37:44,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 89 [2025-04-14 13:37:44,700 INFO L325 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2025-04-14 13:37:44,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 51 [2025-04-14 13:37:44,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 50 [2025-04-14 13:37:44,797 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 73 treesize of output 51 [2025-04-14 13:37:44,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:44,901 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2025-04-14 13:37:44,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:44,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2025-04-14 13:37:44,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:44,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2025-04-14 13:37:44,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:44,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 51 [2025-04-14 13:37:45,485 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 53 [2025-04-14 13:37:45,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2025-04-14 13:37:45,690 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-14 13:37:45,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 89 [2025-04-14 13:37:45,697 INFO L325 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2025-04-14 13:37:45,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 56 [2025-04-14 13:37:45,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2025-04-14 13:37:45,786 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:37:45,786 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 59 [2025-04-14 13:37:46,753 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 55 [2025-04-14 13:37:46,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:46,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:46,758 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 13:37:46,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 58 [2025-04-14 13:37:46,990 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-14 13:37:46,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 93 [2025-04-14 13:37:46,997 INFO L325 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2025-04-14 13:37:46,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 66 [2025-04-14 13:37:47,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 55 [2025-04-14 13:37:47,097 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:37:47,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 55 [2025-04-14 13:37:47,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:47,199 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-04-14 13:37:47,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:47,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-14 13:37:47,641 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-14 13:37:47,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 13:37:47,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2025-04-14 13:37:47,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-04-14 13:37:47,734 INFO L354 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 9 treesize of output 3 [2025-04-14 13:37:47,803 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-04-14 13:37:48,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:37:48,102 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 13 [2025-04-14 13:37:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 13:37:48,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:37:48,638 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| Int) (v_ArrVal_4914 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~next~0#1|) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)) v_ArrVal_4914))) (store .cse1 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse1 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18|))) |c_~#g_queue~0.base|))) (< (select .cse0 (+ |c_~#g_queue~0.offset| 8)) (select .cse0 (+ |c_~#g_queue~0.offset| 4)))))) is different from false [2025-04-14 13:37:49,049 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse0 (= (select .cse9 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1|)) (.cse2 (+ |c_~#g_queue~0.offset| 8)) (.cse3 (+ |c_~#g_queue~0.offset| 4)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse5 (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse7 (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1))) (and (or .cse0 (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| Int) (v_ArrVal_4914 (Array Int Int))) (or (let ((.cse1 (select (let ((.cse4 (store |c_#memory_int| .cse6 v_ArrVal_4914))) (store .cse4 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse4 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse5 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18|))) |c_~#g_queue~0.base|))) (< (select .cse1 .cse2) (select .cse1 .cse3))) (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| .cse7)))) (or (not .cse0) (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4914 (Array Int Int))) (or (let ((.cse8 (select (store (store |c_#memory_int| .cse6 v_ArrVal_4914) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse9 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse6 v_ArrVal_4914) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse5 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18|)) |c_~#g_queue~0.base|))) (< (select .cse8 .cse2) (select .cse8 .cse3))) (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| .cse7))))))) is different from false [2025-04-14 13:37:51,555 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (.cse10 (select (select |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_read_~a#1.offset|))) (let ((.cse2 (+ |c_~#g_queue~0.offset| 8)) (.cse3 (+ |c_~#g_queue~0.offset| 4)) (.cse6 (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse7 (+ .cse10 1)) (.cse0 (= (select .cse5 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|) .cse10))) (and (or (not .cse0) (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4914 (Array Int Int))) (or (let ((.cse1 (select (store (store |c_#memory_int| .cse4 v_ArrVal_4914) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse5 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse4 v_ArrVal_4914) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse6 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18|)) |c_~#g_queue~0.base|))) (< (select .cse1 .cse2) (select .cse1 .cse3))) (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| .cse7)))) (or (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| Int) (v_ArrVal_4914 (Array Int Int))) (or (let ((.cse8 (select (let ((.cse9 (store |c_#memory_int| .cse4 v_ArrVal_4914))) (store .cse9 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse9 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse6 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18|))) |c_~#g_queue~0.base|))) (< (select .cse8 .cse2) (select .cse8 .cse3))) (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_18| .cse7))) .cse0)))) is different from false [2025-04-14 13:37:51,563 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_2 Int) (v_ArrVal_4914 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#g_queue~0.base|))) (< (select (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 16)) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse0 |c_~#g_queue~0.offset|) 1)))) is different from false [2025-04-14 13:37:51,775 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_write_~a#1.offset| |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908))) (let ((.cse1 (select .cse0 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse0 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 16)) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) is different from false [2025-04-14 13:37:53,224 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|)) (.cse6 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse3 (select .cse4 .cse6))) (let ((.cse1 (store |c_#memory_int| .cse3 v_ArrVal_4904)) (.cse5 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse3 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse5 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse4 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse5 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse6) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse2 |c_~#g_queue~0.offset|) 1))))))))) is different from false [2025-04-14 13:37:53,487 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4896 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| |c_writerThread1of2ForFork0_vatomic32_write_~v#1|)))) (let ((.cse0 (select .cse8 |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_4896)))) (let ((.cse5 (select .cse3 |c_~#g_queue~0.base|)) (.cse7 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse4 (select .cse5 .cse7))) (let ((.cse1 (store .cse8 .cse4 v_ArrVal_4904)) (.cse6 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store .cse8 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse4 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse6 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse3 .cse4 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store .cse3 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse4 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse6 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse7) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse2 |c_~#g_queue~0.offset|) 1))))))))))) is different from false [2025-04-14 13:37:55,553 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4896 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse11 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|)) (.cse7 (+ |c_~#g_queue~0.offset| 16)) (.cse12 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse10 (+ (select .cse12 |c_~#g_queue~0.offset|) 1)) (.cse6 (select .cse11 .cse7))) (let ((.cse9 (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| .cse10)) .cse6 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (let ((.cse4 (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse6 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse8 (store |c_#memory_int| .cse6 v_ArrVal_4893)) (.cse3 (select .cse4 .cse7))) (let ((.cse0 (store .cse8 .cse3 v_ArrVal_4904)) (.cse5 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse1 (select (store (store .cse0 |c_~#g_queue~0.base| (store (select (store (store .cse8 |c_~#g_queue~0.base| (store (store .cse9 .cse5 .cse10) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse3 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse5 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse0 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_4894))) (store (store .cse2 .cse3 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store .cse2 |c_~#g_queue~0.base| (store (store .cse4 .cse5 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse5 v_ArrVal_4905))) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse7) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse1 |c_~#g_queue~0.offset|) 1)))))) (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse9 |c_~#g_queue~0.offset|) 1))))))) is different from false [2025-04-14 13:37:55,664 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4896 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_4887)) (.cse4 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse11 (select .cse4 |c_~#g_queue~0.base|)) (.cse7 (+ |c_~#g_queue~0.offset| 16)) (.cse12 (select .cse8 |c_~#g_queue~0.base|))) (let ((.cse10 (+ (select .cse12 |c_~#g_queue~0.offset|) 1)) (.cse2 (select .cse11 .cse7))) (let ((.cse9 (select (store (store .cse8 |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| .cse10)) .cse2 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (let ((.cse5 (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse2 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse3 (select .cse5 .cse7))) (let ((.cse0 (store (store |c_#memory_int| .cse2 v_ArrVal_4893) .cse3 v_ArrVal_4904)) (.cse6 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse1 (select (store (store .cse0 |c_~#g_queue~0.base| (store (select (store (store (store .cse8 .cse2 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse9 .cse6 .cse10) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse3 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse6 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse0 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4894) .cse3 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse4 .cse2 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse5 .cse6 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse6 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse7) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse1 |c_~#g_queue~0.offset|) 1)))))) (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse9 |c_~#g_queue~0.offset|) 1)))))))) is different from false [2025-04-14 13:37:55,780 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_4883))) (.cse12 (store |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_write_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_write_~a#1.offset| v_ArrVal_4884)))) (let ((.cse9 (store .cse12 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse5 (store .cse2 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse13 (select .cse5 |c_~#g_queue~0.base|)) (.cse8 (+ |c_~#g_queue~0.offset| 16)) (.cse14 (select .cse9 |c_~#g_queue~0.base|))) (let ((.cse11 (+ (select .cse14 |c_~#g_queue~0.offset|) 1)) (.cse3 (select .cse13 .cse8))) (let ((.cse10 (select (store (store .cse9 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| .cse11)) .cse3 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (let ((.cse6 (select (store (store .cse5 |c_~#g_queue~0.base| (store .cse13 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse3 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse4 (select .cse6 .cse8))) (let ((.cse0 (store (store .cse12 .cse3 v_ArrVal_4893) .cse4 v_ArrVal_4904)) (.cse7 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse1 (select (store (store .cse0 |c_~#g_queue~0.base| (store (select (store (store (store .cse9 .cse3 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse10 .cse7 .cse11) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse4 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse7 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse0 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse2 .cse3 v_ArrVal_4894) .cse4 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse5 .cse3 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse6 .cse7 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse4 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse7 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse8) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse1 |c_~#g_queue~0.offset|) 1)))))) (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse10 |c_~#g_queue~0.offset|) 1))))))))) is different from false [2025-04-14 13:37:55,823 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse16 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse17 (select (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (let ((.cse3 (let ((.cse18 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_4879))) (store .cse18 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse18 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse16 v_ArrVal_4883)))) (.cse12 (let ((.cse15 (store |c_#memory_int| .cse17 v_ArrVal_4880))) (store .cse15 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse15 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse16 v_ArrVal_4884))))) (let ((.cse10 (store .cse12 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse6 (store .cse3 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse13 (select .cse6 |c_~#g_queue~0.base|)) (.cse9 (+ |c_~#g_queue~0.offset| 16)) (.cse14 (select .cse10 |c_~#g_queue~0.base|))) (let ((.cse11 (+ (select .cse14 |c_~#g_queue~0.offset|) 1)) (.cse4 (select .cse13 .cse9))) (let ((.cse0 (select (store (store .cse10 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| .cse11)) .cse4 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse13 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse4 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse1 (store (store .cse12 .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4904)) (.cse8 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store (store .cse10 .cse4 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse0 .cse8 .cse11) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse5 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse3 .cse4 v_ArrVal_4894) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse6 .cse4 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse7 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse2 |c_~#g_queue~0.offset|) 1)))))))))))))) is different from false [2025-04-14 13:37:56,026 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#g_queue~0.offset| 8)) (.cse8 (+ |c_~#g_queue~0.offset| 4)) (.cse9 (+ |c_~#g_queue~0.offset| 16)) (.cse17 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse20 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (and (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse20))) (let ((.cse3 (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_4879))) (store .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883)))) (.cse13 (let ((.cse16 (store |c_#memory_int| .cse18 v_ArrVal_4880))) (store .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884))))) (let ((.cse11 (store .cse13 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse6 (store .cse3 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse14 (select .cse6 |c_~#g_queue~0.base|)) (.cse15 (select .cse11 |c_~#g_queue~0.base|))) (let ((.cse12 (+ (select .cse15 |c_~#g_queue~0.offset|) 1)) (.cse4 (select .cse14 .cse9))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse12)) .cse4 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse4 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse1 (store (store .cse13 .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4904))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store (store .cse11 .cse4 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse0 .cse8 .cse12) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse5 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse3 .cse4 v_ArrVal_4894) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse6 .cse4 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse7 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse2 |c_~#g_queue~0.offset|) 1)))))))))))))) (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.offset| v_DerPreprocessor_5)))) (let ((.cse35 (select (select .cse37 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse20))) (let ((.cse24 (let ((.cse36 (store .cse37 .cse35 v_ArrVal_4879))) (store .cse36 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse36 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883)))) (.cse31 (let ((.cse34 (store (store |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.offset| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~v#1|)) .cse35 v_ArrVal_4880))) (store .cse34 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse34 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884))))) (let ((.cse29 (store .cse31 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse27 (store .cse24 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse32 (select .cse27 |c_~#g_queue~0.base|)) (.cse33 (select .cse29 |c_~#g_queue~0.base|))) (let ((.cse30 (+ (select .cse33 |c_~#g_queue~0.offset|) 1)) (.cse25 (select .cse32 .cse9))) (let ((.cse21 (select (store (store .cse29 |c_~#g_queue~0.base| (store .cse33 |c_~#g_queue~0.offset| .cse30)) .cse25 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse21 |c_~#g_queue~0.offset|) 1)) (let ((.cse28 (select (store (store .cse27 |c_~#g_queue~0.base| (store .cse32 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse25 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse26 (select .cse28 .cse9))) (let ((.cse22 (store (store .cse31 .cse25 v_ArrVal_4893) .cse26 v_ArrVal_4904))) (let ((.cse23 (select (store (store .cse22 |c_~#g_queue~0.base| (store (select (store (store (store .cse29 .cse25 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse21 .cse8 .cse30) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse26 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse22 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse23 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse24 .cse25 v_ArrVal_4894) .cse26 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse27 .cse25 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse28 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse26 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse23 |c_~#g_queue~0.offset|) 1))))))))))))))))) is different from false [2025-04-14 13:37:56,118 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse10 (+ |c_~#g_queue~0.offset| 8)) (.cse8 (+ |c_~#g_queue~0.offset| 4)) (.cse9 (+ |c_~#g_queue~0.offset| 16)) (.cse18 (select .cse33 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse17 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (and (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse3 (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_4879))) (store .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883)))) (.cse13 (let ((.cse16 (store |c_#memory_int| .cse18 v_ArrVal_4880))) (store .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884))))) (let ((.cse11 (store .cse13 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse6 (store .cse3 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse14 (select .cse6 |c_~#g_queue~0.base|)) (.cse15 (select .cse11 |c_~#g_queue~0.base|))) (let ((.cse12 (+ (select .cse15 |c_~#g_queue~0.offset|) 1)) (.cse4 (select .cse14 .cse9))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse12)) .cse4 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse4 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse1 (store (store .cse13 .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4904))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store (store .cse11 .cse4 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse0 .cse8 .cse12) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse5 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse3 .cse4 v_ArrVal_4894) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse6 .cse4 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse7 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse2 |c_~#g_queue~0.offset|) 1))))))))))))) (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_4879) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse33 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse18 v_ArrVal_4879) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883))) (.cse30 (store (store |c_#memory_int| .cse18 v_ArrVal_4880) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1))) .cse18 v_ArrVal_4880) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884)))) (let ((.cse27 (store .cse30 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse25 (store .cse22 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse31 (select .cse25 |c_~#g_queue~0.base|)) (.cse32 (select .cse27 |c_~#g_queue~0.base|))) (let ((.cse29 (+ (select .cse32 |c_~#g_queue~0.offset|) 1)) (.cse23 (select .cse31 .cse9))) (let ((.cse28 (select (store (store .cse27 |c_~#g_queue~0.base| (store .cse32 |c_~#g_queue~0.offset| .cse29)) .cse23 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (let ((.cse26 (select (store (store .cse25 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse23 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse24 (select .cse26 .cse9))) (let ((.cse20 (store (store .cse30 .cse23 v_ArrVal_4893) .cse24 v_ArrVal_4904))) (let ((.cse21 (select (store (store .cse20 |c_~#g_queue~0.base| (store (select (store (store (store .cse27 .cse23 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse28 .cse8 .cse29) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse24 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse20 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse21 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse22 .cse23 v_ArrVal_4894) .cse24 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse25 .cse23 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse26 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse24 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse21 |c_~#g_queue~0.offset|) 1)))))) (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse28 |c_~#g_queue~0.offset|) 1)))))))))))) is different from false [2025-04-14 13:37:56,341 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse10 (+ |c_~#g_queue~0.offset| 8)) (.cse8 (+ |c_~#g_queue~0.offset| 4)) (.cse9 (+ |c_~#g_queue~0.offset| 16)) (.cse18 (select .cse33 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse17 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (and (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse3 (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_4879))) (store .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883)))) (.cse13 (let ((.cse16 (store |c_#memory_int| .cse18 v_ArrVal_4880))) (store .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884))))) (let ((.cse11 (store .cse13 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse6 (store .cse3 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse14 (select .cse6 |c_~#g_queue~0.base|)) (.cse15 (select .cse11 |c_~#g_queue~0.base|))) (let ((.cse12 (+ (select .cse15 |c_~#g_queue~0.offset|) 1)) (.cse4 (select .cse14 .cse9))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse12)) .cse4 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse4 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse1 (store (store .cse13 .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4904))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store (store .cse11 .cse4 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse0 .cse8 .cse12) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse5 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse3 .cse4 v_ArrVal_4894) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse6 .cse4 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse7 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse2 |c_~#g_queue~0.offset|) 1))))))))))))) (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_4879) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse33 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse18 v_ArrVal_4879) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883))) (.cse30 (store (store |c_#memory_int| .cse18 v_ArrVal_4880) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ |c_writerThread1of2ForFork0_vatomic32_read_#t~mem436#1| 1))) .cse18 v_ArrVal_4880) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884)))) (let ((.cse27 (store .cse30 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse25 (store .cse22 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse31 (select .cse25 |c_~#g_queue~0.base|)) (.cse32 (select .cse27 |c_~#g_queue~0.base|))) (let ((.cse29 (+ (select .cse32 |c_~#g_queue~0.offset|) 1)) (.cse23 (select .cse31 .cse9))) (let ((.cse28 (select (store (store .cse27 |c_~#g_queue~0.base| (store .cse32 |c_~#g_queue~0.offset| .cse29)) .cse23 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (let ((.cse26 (select (store (store .cse25 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse23 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse24 (select .cse26 .cse9))) (let ((.cse20 (store (store .cse30 .cse23 v_ArrVal_4893) .cse24 v_ArrVal_4904))) (let ((.cse21 (select (store (store .cse20 |c_~#g_queue~0.base| (store (select (store (store (store .cse27 .cse23 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse28 .cse8 .cse29) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse24 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse20 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse21 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse22 .cse23 v_ArrVal_4894) .cse24 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse25 .cse23 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse26 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse24 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse21 |c_~#g_queue~0.offset|) 1)))))) (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse28 |c_~#g_queue~0.offset|) 1)))))))))))) is different from false [2025-04-14 13:37:56,418 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse10 (+ |c_~#g_queue~0.offset| 8)) (.cse8 (+ |c_~#g_queue~0.offset| 4)) (.cse9 (+ |c_~#g_queue~0.offset| 16)) (.cse18 (select .cse33 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse17 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (and (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse3 (let ((.cse19 (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_4879))) (store .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse19 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883)))) (.cse13 (let ((.cse16 (store |c_#memory_int| .cse18 v_ArrVal_4880))) (store .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884))))) (let ((.cse11 (store .cse13 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse6 (store .cse3 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse14 (select .cse6 |c_~#g_queue~0.base|)) (.cse15 (select .cse11 |c_~#g_queue~0.base|))) (let ((.cse12 (+ (select .cse15 |c_~#g_queue~0.offset|) 1)) (.cse4 (select .cse14 .cse9))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse12)) .cse4 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse4 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse1 (store (store .cse13 .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4904))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store (store .cse11 .cse4 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse0 .cse8 .cse12) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse5 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse3 .cse4 v_ArrVal_4894) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse6 .cse4 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse7 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse2 |c_~#g_queue~0.offset|) 1))))))))))))) (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_$Pointer$.base| .cse18 v_ArrVal_4879) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse33 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse18 v_ArrVal_4879) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4883))) (.cse30 (store (store |c_#memory_int| .cse18 v_ArrVal_4880) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ (select (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_read_~a#1.offset|) 1))) .cse18 v_ArrVal_4880) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse17 v_ArrVal_4884)))) (let ((.cse28 (store .cse30 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse26 (store .cse23 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse31 (select .cse26 |c_~#g_queue~0.base|)) (.cse32 (select .cse28 |c_~#g_queue~0.base|))) (let ((.cse29 (+ (select .cse32 |c_~#g_queue~0.offset|) 1)) (.cse24 (select .cse31 .cse9))) (let ((.cse20 (select (store (store .cse28 |c_~#g_queue~0.base| (store .cse32 |c_~#g_queue~0.offset| .cse29)) .cse24 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse20 |c_~#g_queue~0.offset|) 1)) (let ((.cse27 (select (store (store .cse26 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse24 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse25 (select .cse27 .cse9))) (let ((.cse21 (store (store .cse30 .cse24 v_ArrVal_4893) .cse25 v_ArrVal_4904))) (let ((.cse22 (select (store (store .cse21 |c_~#g_queue~0.base| (store (select (store (store (store .cse28 .cse24 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse20 .cse8 .cse29) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse25 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse21 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse22 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse23 .cse24 v_ArrVal_4894) .cse25 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse26 .cse24 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse27 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse25 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse22 |c_~#g_queue~0.offset|) 1)))))))))))))))) is different from false [2025-04-14 13:37:56,473 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|)) (.cse9 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse10 (+ |c_~#g_queue~0.offset| 8)) (.cse8 (+ |c_~#g_queue~0.offset| 4)) (.cse17 (select .cse18 .cse9))) (and (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| .cse17 v_ArrVal_4880)) (.cse3 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_4879))) (let ((.cse14 (select (store (store .cse3 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse18 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse17 v_ArrVal_4879) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4883)) |c_~#g_val~0.base| v_ArrVal_4888) |c_~#g_queue~0.base|)) (.cse15 (select (store (store .cse13 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (let ((.cse16 (select |c_#memory_int| |c_~#g_queue~0.base|))) (store .cse16 |c_~#g_queue~0.offset| (+ (select .cse16 |c_~#g_queue~0.offset|) 1)))) .cse17 v_ArrVal_4880) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4884)) |c_~#g_val~0.base| v_ArrVal_4887) |c_~#g_queue~0.base|))) (let ((.cse11 (store .cse13 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse12 (+ (select .cse15 |c_~#g_queue~0.offset|) 1)) (.cse4 (select .cse14 .cse9))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse12)) .cse4 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse6 (store .cse3 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse4 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse1 (store (store .cse13 .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4904))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store (store .cse11 .cse4 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse0 .cse8 .cse12) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse5 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse3 .cse4 v_ArrVal_4894) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse6 .cse4 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse7 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse2 |c_~#g_queue~0.offset|) 1))))))))))))) (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| .cse17 v_ArrVal_4880)) (.cse22 (store |c_#memory_$Pointer$.base| .cse17 v_ArrVal_4879))) (let ((.cse30 (select (store (store .cse22 |c_~#g_queue~0.base| (store (select .cse22 |c_~#g_queue~0.base|) .cse8 v_ArrVal_4883)) |c_~#g_val~0.base| v_ArrVal_4888) |c_~#g_queue~0.base|)) (.cse31 (select (store (store .cse29 |c_~#g_queue~0.base| (store (select .cse29 |c_~#g_queue~0.base|) .cse8 v_ArrVal_4884)) |c_~#g_val~0.base| v_ArrVal_4887) |c_~#g_queue~0.base|))) (let ((.cse27 (store .cse29 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse28 (+ (select .cse31 |c_~#g_queue~0.offset|) 1)) (.cse23 (select .cse30 .cse9))) (let ((.cse19 (select (store (store .cse27 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| .cse28)) .cse23 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse19 |c_~#g_queue~0.offset|) 1)) (let ((.cse25 (store .cse22 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse26 (select (store (store .cse25 |c_~#g_queue~0.base| (store .cse30 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse23 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse24 (select .cse26 .cse9))) (let ((.cse20 (store (store .cse29 .cse23 v_ArrVal_4893) .cse24 v_ArrVal_4904))) (let ((.cse21 (select (store (store .cse20 |c_~#g_queue~0.base| (store (select (store (store (store .cse27 .cse23 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse19 .cse8 .cse28) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse24 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse20 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse21 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse22 .cse23 v_ArrVal_4894) .cse24 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse25 .cse23 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse26 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse24 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse21 |c_~#g_queue~0.offset|) 1)))))))))))))))) is different from false [2025-04-14 13:37:56,703 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse10 (+ |c_~#g_queue~0.offset| 8)) (.cse8 (+ |c_~#g_queue~0.offset| 4)) (.cse9 (+ |c_~#g_queue~0.offset| 16))) (and (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4873 (Array Int Int)) (v_ArrVal_4874 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_4874))) (let ((.cse17 (select (select .cse16 |c_~#g_queue~0.base|) .cse9))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_4873) .cse17 v_ArrVal_4880)) (.cse3 (store .cse16 .cse17 v_ArrVal_4879))) (let ((.cse14 (select (store (store .cse3 |c_~#g_queue~0.base| (store (select .cse3 |c_~#g_queue~0.base|) .cse8 v_ArrVal_4883)) |c_~#g_val~0.base| v_ArrVal_4888) |c_~#g_queue~0.base|)) (.cse15 (select (store (store .cse13 |c_~#g_queue~0.base| (store (select .cse13 |c_~#g_queue~0.base|) .cse8 v_ArrVal_4884)) |c_~#g_val~0.base| v_ArrVal_4887) |c_~#g_queue~0.base|))) (let ((.cse11 (store .cse13 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse12 (+ (select .cse15 |c_~#g_queue~0.offset|) 1)) (.cse4 (select .cse14 .cse9))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse12)) .cse4 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse0 |c_~#g_queue~0.offset|) 1)) (let ((.cse6 (store .cse3 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse14 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse4 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse5 (select .cse7 .cse9))) (let ((.cse1 (store (store .cse13 .cse4 v_ArrVal_4893) .cse5 v_ArrVal_4904))) (let ((.cse2 (select (store (store .cse1 |c_~#g_queue~0.base| (store (select (store (store (store .cse11 .cse4 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse0 .cse8 .cse12) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse5 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse3 .cse4 v_ArrVal_4894) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse6 .cse4 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse7 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse2 |c_~#g_queue~0.offset|) 1))))))))))))))) (forall ((v_ArrVal_4908 (Array Int Int)) (v_ArrVal_4909 (Array Int Int)) (v_ArrVal_4884 Int) (v_ArrVal_4896 Int) (v_DerPreprocessor_5 Int) (v_ArrVal_4883 Int) (v_DerPreprocessor_4 Int) (|writerThread2of2ForFork0_vatomic32_write_~v#1| Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4893 (Array Int Int)) (v_ArrVal_4894 (Array Int Int)) (v_ArrVal_4873 (Array Int Int)) (v_ArrVal_4874 (Array Int Int)) (v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4879 (Array Int Int)) (|v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| Int) (v_ArrVal_4903 (Array Int Int)) (v_ArrVal_4905 Int) (v_ArrVal_4914 (Array Int Int)) (v_ArrVal_4904 (Array Int Int))) (let ((.cse34 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_4874))) (let ((.cse35 (select .cse34 |c_~#g_queue~0.base|))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_4873)) (.cse33 (select .cse35 .cse9))) (let ((.cse28 (store .cse31 .cse33 v_ArrVal_4880)) (.cse21 (store .cse34 .cse33 v_ArrVal_4879))) (let ((.cse29 (select (store (store .cse21 |c_~#g_queue~0.base| (store (select (store (store .cse34 |c_~#g_queue~0.base| (store .cse35 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse33 v_ArrVal_4879) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4883)) |c_~#g_val~0.base| v_ArrVal_4888) |c_~#g_queue~0.base|)) (.cse30 (select (store (store .cse28 |c_~#g_queue~0.base| (store (select (store (store .cse31 |c_~#g_queue~0.base| (let ((.cse32 (select .cse31 |c_~#g_queue~0.base|))) (store .cse32 |c_~#g_queue~0.offset| (+ (select .cse32 |c_~#g_queue~0.offset|) 1)))) .cse33 v_ArrVal_4880) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4884)) |c_~#g_val~0.base| v_ArrVal_4887) |c_~#g_queue~0.base|))) (let ((.cse26 (store .cse28 |c_~#g_val~0.base| v_ArrVal_4887)) (.cse27 (+ (select .cse30 |c_~#g_queue~0.offset|) 1)) (.cse22 (select .cse29 .cse9))) (let ((.cse18 (select (store (store .cse26 |c_~#g_queue~0.base| (store .cse30 |c_~#g_queue~0.offset| .cse27)) .cse22 v_ArrVal_4893) |c_~#g_queue~0.base|))) (or (< |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20| (+ (select .cse18 |c_~#g_queue~0.offset|) 1)) (let ((.cse24 (store .cse21 |c_~#g_val~0.base| v_ArrVal_4888))) (let ((.cse25 (select (store (store .cse24 |c_~#g_queue~0.base| (store .cse29 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse22 v_ArrVal_4894) |c_~#g_queue~0.base|))) (let ((.cse23 (select .cse25 .cse9))) (let ((.cse19 (store (store .cse28 .cse22 v_ArrVal_4893) .cse23 v_ArrVal_4904))) (let ((.cse20 (select (store (store .cse19 |c_~#g_queue~0.base| (store (select (store (store (store .cse26 .cse22 v_ArrVal_4893) |c_~#g_queue~0.base| (store (store .cse18 .cse8 .cse27) |c_~#g_queue~0.offset| |v_writerThread2of2ForFork0_vatomic32_cmpxchg_~v#1_20|)) .cse23 v_ArrVal_4904) |c_~#g_queue~0.base|) .cse8 |writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse19 |c_~#g_val~0.base| v_ArrVal_4908) |c_~#g_queue~0.base| (store .cse20 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store (store .cse21 .cse22 v_ArrVal_4894) .cse23 v_ArrVal_4903) |c_~#g_queue~0.base| (store (select (store (store (store .cse24 .cse22 v_ArrVal_4894) |c_~#g_queue~0.base| (store (store .cse25 .cse8 v_ArrVal_4896) |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse23 v_ArrVal_4903) |c_~#g_queue~0.base|) .cse8 v_ArrVal_4905)) |c_~#g_val~0.base| v_ArrVal_4909) |c_~#g_queue~0.base|) .cse9) v_ArrVal_4914) |c_~#g_queue~0.base|) .cse10) (+ (select .cse20 |c_~#g_queue~0.offset|) 1)))))))))))))))))) is different from false [2025-04-14 13:38:27,369 INFO L325 Elim1Store]: treesize reduction 160, result has 46.1 percent of original size [2025-04-14 13:38:27,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 11577 treesize of output 9552 [2025-04-14 13:38:27,725 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:27,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3160020 treesize of output 3159901 [2025-04-14 13:38:27,947 INFO L354 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 149773 treesize of output 149629 [2025-04-14 13:38:28,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149629 treesize of output 149581 [2025-04-14 13:38:28,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149581 treesize of output 149445 [2025-04-14 13:38:28,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149445 treesize of output 149421 [2025-04-14 13:38:28,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149421 treesize of output 149405 [2025-04-14 13:38:28,328 INFO L354 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 149405 treesize of output 149403 [2025-04-14 13:38:28,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149403 treesize of output 149397 [2025-04-14 13:38:28,535 INFO L354 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 149397 treesize of output 149329 [2025-04-14 13:38:28,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149329 treesize of output 149317 [2025-04-14 13:38:28,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149317 treesize of output 149253 [2025-04-14 13:38:28,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149253 treesize of output 149247 [2025-04-14 13:38:28,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149247 treesize of output 149229 [2025-04-14 13:38:29,089 INFO L354 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 149229 treesize of output 149227 [2025-04-14 13:38:29,200 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149227 treesize of output 149219 [2025-04-14 13:38:37,302 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:37,303 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 551 treesize of output 561 [2025-04-14 13:38:37,982 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:37,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 495 treesize of output 499 [2025-04-14 13:38:38,726 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:38,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 545 treesize of output 555 [2025-04-14 13:38:39,679 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:39,680 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 935 treesize of output 933 [2025-04-14 13:38:40,578 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:40,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 706 treesize of output 704 [2025-04-14 13:38:41,952 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:41,953 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 551 treesize of output 561 [2025-04-14 13:38:42,684 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:42,685 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 497 treesize of output 501 [2025-04-14 13:38:43,441 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:43,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 403 treesize of output 409 [2025-04-14 13:38:44,058 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:38:44,059 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 696 treesize of output 694 [2025-04-14 13:41:05,588 WARN L286 SmtUtils]: Spent 2.29m on a formula simplification that was a NOOP. DAG size: 30 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-14 13:41:05,589 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 13:41:05,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 24345 treesize of output 24107 Received shutdown request... [2025-04-14 13:45:39,527 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 13:45:39,529 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 13:45:39,530 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 13:45:39,549 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-14 13:45:39,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 13:45:39,749 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-14 13:45:39,749 WARN L610 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. [2025-04-14 13:45:39,750 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-14 13:45:39,750 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-14 13:45:39,750 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-14 13:45:39,750 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-14 13:45:39,750 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-14 13:45:39,750 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-14 13:45:39,750 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-14 13:45:39,752 INFO L422 BasicCegarLoop]: Path program histogram: [7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 13:45:39,756 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-14 13:45:39,756 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 13:45:39,960 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forcibly destroying the process [2025-04-14 13:45:40,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 137 [2025-04-14 13:45:40,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:45:40 BasicIcfg [2025-04-14 13:45:40,072 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 13:45:40,073 INFO L158 Benchmark]: Toolchain (without parser) took 833680.71ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 89.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-14 13:45:40,073 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 155.2MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:45:40,073 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1974.42ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 71.2MB in the end (delta: 18.1MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2025-04-14 13:45:40,073 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.46ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 61.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-14 13:45:40,074 INFO L158 Benchmark]: Boogie Preprocessor took 67.81ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 57.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 13:45:40,074 INFO L158 Benchmark]: RCFGBuilder took 1228.09ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 56.6MB in the beginning and 128.0MB in the end (delta: -71.4MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. [2025-04-14 13:45:40,074 INFO L158 Benchmark]: TraceAbstraction took 830278.84ms. Allocated memory was 327.2MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 127.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 986.1MB. Max. memory is 8.0GB. [2025-04-14 13:45:40,074 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.71ms. Allocated memory is still 155.2MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1974.42ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 71.2MB in the end (delta: 18.1MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 126.46ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 61.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.81ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 57.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1228.09ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 56.6MB in the beginning and 128.0MB in the end (delta: -71.4MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB. * TraceAbstraction took 830278.84ms. Allocated memory was 327.2MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 127.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 986.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 4308]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] - GenericResultAtLocation [Line: 4310]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] - GenericResultAtLocation [Line: 4315]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] - GenericResultAtLocation [Line: 4317]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] - GenericResultAtLocation [Line: 4323]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] - GenericResultAtLocation [Line: 4325]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] - GenericResultAtLocation [Line: 4331]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] - GenericResultAtLocation [Line: 4333]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] - GenericResultAtLocation [Line: 4339]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] - GenericResultAtLocation [Line: 4341]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] - GenericResultAtLocation [Line: 4347]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] - GenericResultAtLocation [Line: 4349]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] - GenericResultAtLocation [Line: 4355]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] - GenericResultAtLocation [Line: 4357]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] - GenericResultAtLocation [Line: 4363]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] - GenericResultAtLocation [Line: 4365]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] - GenericResultAtLocation [Line: 4370]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] - GenericResultAtLocation [Line: 4372]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] - GenericResultAtLocation [Line: 4377]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] - GenericResultAtLocation [Line: 4379]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] - GenericResultAtLocation [Line: 4384]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] - GenericResultAtLocation [Line: 4386]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] - GenericResultAtLocation [Line: 4391]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] - GenericResultAtLocation [Line: 4393]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] - GenericResultAtLocation [Line: 4398]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] - GenericResultAtLocation [Line: 4400]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] - GenericResultAtLocation [Line: 4405]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] - GenericResultAtLocation [Line: 4408]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] - GenericResultAtLocation [Line: 4414]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] - GenericResultAtLocation [Line: 4417]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] - GenericResultAtLocation [Line: 4423]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] - GenericResultAtLocation [Line: 4426]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] - GenericResultAtLocation [Line: 4432]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] - GenericResultAtLocation [Line: 4435]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] - GenericResultAtLocation [Line: 4441]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] - GenericResultAtLocation [Line: 4444]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] - GenericResultAtLocation [Line: 4450]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] - GenericResultAtLocation [Line: 4453]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] - GenericResultAtLocation [Line: 4460]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] - GenericResultAtLocation [Line: 4463]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] - GenericResultAtLocation [Line: 4470]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] - GenericResultAtLocation [Line: 4473]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] - GenericResultAtLocation [Line: 4480]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] - GenericResultAtLocation [Line: 4483]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] - GenericResultAtLocation [Line: 4490]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] - GenericResultAtLocation [Line: 4493]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] - GenericResultAtLocation [Line: 4500]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] - GenericResultAtLocation [Line: 4503]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] - GenericResultAtLocation [Line: 4510]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] - GenericResultAtLocation [Line: 4513]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] - GenericResultAtLocation [Line: 4519]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] - GenericResultAtLocation [Line: 4522]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] - GenericResultAtLocation [Line: 4528]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] - GenericResultAtLocation [Line: 4531]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] - GenericResultAtLocation [Line: 4537]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] - GenericResultAtLocation [Line: 4540]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] - GenericResultAtLocation [Line: 4546]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] - GenericResultAtLocation [Line: 4549]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] - GenericResultAtLocation [Line: 4555]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] - GenericResultAtLocation [Line: 4558]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] - GenericResultAtLocation [Line: 4564]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] - GenericResultAtLocation [Line: 4567]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] - GenericResultAtLocation [Line: 4573]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] - GenericResultAtLocation [Line: 4576]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] - GenericResultAtLocation [Line: 4582]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] - GenericResultAtLocation [Line: 4585]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] - GenericResultAtLocation [Line: 4591]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] - GenericResultAtLocation [Line: 4594]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] - GenericResultAtLocation [Line: 4600]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] - GenericResultAtLocation [Line: 4603]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] - GenericResultAtLocation [Line: 4609]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] - GenericResultAtLocation [Line: 4612]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] - GenericResultAtLocation [Line: 4618]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] - GenericResultAtLocation [Line: 4621]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] - GenericResultAtLocation [Line: 4627]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] - GenericResultAtLocation [Line: 4630]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] - GenericResultAtLocation [Line: 4636]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] - GenericResultAtLocation [Line: 4639]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] - GenericResultAtLocation [Line: 4645]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] - GenericResultAtLocation [Line: 4648]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] - GenericResultAtLocation [Line: 4654]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] - GenericResultAtLocation [Line: 4656]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] - GenericResultAtLocation [Line: 4662]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] - GenericResultAtLocation [Line: 4664]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] - GenericResultAtLocation [Line: 4670]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] - GenericResultAtLocation [Line: 4672]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] - GenericResultAtLocation [Line: 4678]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] - GenericResultAtLocation [Line: 4680]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] - GenericResultAtLocation [Line: 4686]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] - GenericResultAtLocation [Line: 4688]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] - GenericResultAtLocation [Line: 4694]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] - GenericResultAtLocation [Line: 4696]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] - GenericResultAtLocation [Line: 4702]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] - GenericResultAtLocation [Line: 4704]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] - GenericResultAtLocation [Line: 4710]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] - GenericResultAtLocation [Line: 4712]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] - GenericResultAtLocation [Line: 4718]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] - GenericResultAtLocation [Line: 4720]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] - GenericResultAtLocation [Line: 4726]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] - GenericResultAtLocation [Line: 4728]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 438, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 21, dependent conditional: 16, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 423, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 405, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 405, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1199, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 914, dependent conditional: 0, dependent unconditional: 914, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 423, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 405, unknown conditional: 0, unknown unconditional: 405] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 400, Positive conditional cache size: 0, Positive unconditional cache size: 400, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0, Independence queries for same thread: 15, Persistent sets #1 benchmarks: Persistent set computation time: 1.2s, Number of persistent set computation: 21, Number of trivial persistent sets: 21, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 410, independent: 405, independent conditional: 0, independent unconditional: 405, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 438, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 21, dependent conditional: 16, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 12, independent unconditional: 405, dependent: 6, dependent conditional: 1, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 423, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 423, independent: 417, independent conditional: 0, independent unconditional: 417, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 405, independent: 400, independent conditional: 0, independent unconditional: 400, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 405, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1199, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 914, dependent conditional: 0, dependent unconditional: 914, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 423, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 405, unknown conditional: 0, unknown unconditional: 405] , Statistics on independence cache: Total cache size (in pairs): 405, Positive cache size: 400, Positive conditional cache size: 0, Positive unconditional cache size: 400, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0, Independence queries for same thread: 15 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31804, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 6855, dependent conditional: 6721, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25558, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 609, dependent conditional: 475, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25558, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 609, dependent conditional: 475, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28938, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 3989, dependent conditional: 3855, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28938, independent: 24946, independent conditional: 266, independent unconditional: 24680, dependent: 3989, dependent conditional: 2179, dependent unconditional: 1810, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28938, independent: 24946, independent conditional: 266, independent unconditional: 24680, dependent: 3989, dependent conditional: 2179, dependent unconditional: 1810, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6804, independent: 6416, independent conditional: 59, independent unconditional: 6357, dependent: 385, dependent conditional: 248, dependent unconditional: 137, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6804, independent: 6342, independent conditional: 0, independent unconditional: 6342, dependent: 462, dependent conditional: 0, dependent unconditional: 462, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 462, independent: 74, independent conditional: 59, independent unconditional: 15, dependent: 385, dependent conditional: 248, dependent unconditional: 137, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 462, independent: 74, independent conditional: 59, independent unconditional: 15, dependent: 385, dependent conditional: 248, dependent unconditional: 137, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207925, independent: 19182, independent conditional: 18411, independent unconditional: 771, dependent: 139268, dependent conditional: 115369, dependent unconditional: 23899, unknown: 49475, unknown conditional: 0, unknown unconditional: 49475] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 28938, independent: 18530, independent conditional: 207, independent unconditional: 18323, dependent: 3604, dependent conditional: 1931, dependent unconditional: 1673, unknown: 6804, unknown conditional: 307, unknown unconditional: 6497] , Statistics on independence cache: Total cache size (in pairs): 7209, Positive cache size: 6816, Positive conditional cache size: 59, Positive unconditional cache size: 6757, Negative cache size: 390, Negative conditional cache size: 248, Negative unconditional cache size: 142, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3, Eliminated conditions: 18474, Maximal queried relation: 12, Independence queries for same thread: 6246, Persistent sets #1 benchmarks: Persistent set computation time: 73.6s, Number of persistent set computation: 577, Number of trivial persistent sets: 575, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8019, independent: 7882, independent conditional: 0, independent unconditional: 7882, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 31804, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 6855, dependent conditional: 6721, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25558, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 609, dependent conditional: 475, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25558, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 609, dependent conditional: 475, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28938, independent: 24946, independent conditional: 17064, independent unconditional: 7882, dependent: 3989, dependent conditional: 3855, dependent unconditional: 134, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28938, independent: 24946, independent conditional: 266, independent unconditional: 24680, dependent: 3989, dependent conditional: 2179, dependent unconditional: 1810, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28938, independent: 24946, independent conditional: 266, independent unconditional: 24680, dependent: 3989, dependent conditional: 2179, dependent unconditional: 1810, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6804, independent: 6416, independent conditional: 59, independent unconditional: 6357, dependent: 385, dependent conditional: 248, dependent unconditional: 137, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6804, independent: 6342, independent conditional: 0, independent unconditional: 6342, dependent: 462, dependent conditional: 0, dependent unconditional: 462, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 462, independent: 74, independent conditional: 59, independent unconditional: 15, dependent: 385, dependent conditional: 248, dependent unconditional: 137, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 462, independent: 74, independent conditional: 59, independent unconditional: 15, dependent: 385, dependent conditional: 248, dependent unconditional: 137, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207925, independent: 19182, independent conditional: 18411, independent unconditional: 771, dependent: 139268, dependent conditional: 115369, dependent unconditional: 23899, unknown: 49475, unknown conditional: 0, unknown unconditional: 49475] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 28938, independent: 18530, independent conditional: 207, independent unconditional: 18323, dependent: 3604, dependent conditional: 1931, dependent unconditional: 1673, unknown: 6804, unknown conditional: 307, unknown unconditional: 6497] , Statistics on independence cache: Total cache size (in pairs): 7209, Positive cache size: 6816, Positive conditional cache size: 59, Positive unconditional cache size: 6757, Negative cache size: 390, Negative conditional cache size: 248, Negative unconditional cache size: 142, Unknown cache size: 3, Unknown conditional cache size: 0, Unknown unconditional cache size: 3, Eliminated conditions: 18474, Maximal queried relation: 12, Independence queries for same thread: 6246 - TimeoutResultAtElement [Line: 6045]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - TimeoutResultAtElement [Line: 5941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - TimeoutResultAtElement [Line: 5942]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - TimeoutResultAtElement [Line: 6047]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - TimeoutResultAtElement [Line: 6048]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - TimeoutResultAtElement [Line: 6050]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - TimeoutResultAtElement [Line: 6052]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - TimeoutResultAtElement [Line: 6038]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 125 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-9-2-3-5-4-3-3-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 143 locations, 202 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 4 procedures, 160 locations, 225 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 828.0s, OverallIterations: 28, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 251.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 563, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 85.0s InterpolantComputationTime, 4542 NumberOfCodeBlocks, 3979 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4784 ConstructedInterpolants, 0 QuantifiedInterpolants, 37333 SizeOfPredicates, 204 NumberOfNonLiveVariables, 4696 ConjunctsInSsa, 777 ConjunctsInUnsatCore, 30 InterpolantComputations, 26 PerfectInterpolantSequences, 2246/2388 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown