./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6f232940 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-20 06:08:28,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 06:08:28,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-03-20 06:08:28,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 06:08:28,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 06:08:28,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 06:08:28,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 06:08:28,377 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 06:08:28,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 06:08:28,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 06:08:28,378 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 06:08:28,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 06:08:28,379 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 06:08:28,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 06:08:28,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 06:08:28,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 06:08:28,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-20 06:08:28,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 06:08:28,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 06:08:28,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 06:08:28,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 06:08:28,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 06:08:28,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 06:08:28,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 06:08:28,381 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 06:08:28,381 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 06:08:28,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 06:08:28,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 06:08:28,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 06:08:28,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 06:08:28,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 06:08:28,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 06:08:28,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 06:08:28,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 06:08:28,382 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 06:08:28,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 06:08:28,382 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-20 06:08:28,382 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 06:08:28,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-20 06:08:28,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 06:08:28,388 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 06:08:28,388 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 06:08:28,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-03-20 06:08:28,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 06:08:28,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 06:08:28,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 06:08:28,675 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 06:08:28,675 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 06:08:28,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-20 06:08:30,040 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f8bf4c329/bcf0328eee3e4e84a0ab437d0d420bca/FLAG01168fbdb [2025-03-20 06:08:30,453 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 06:08:30,454 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-20 06:08:30,495 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f8bf4c329/bcf0328eee3e4e84a0ab437d0d420bca/FLAG01168fbdb [2025-03-20 06:08:31,141 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f8bf4c329/bcf0328eee3e4e84a0ab437d0d420bca [2025-03-20 06:08:31,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 06:08:31,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 06:08:31,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 06:08:31,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 06:08:31,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 06:08:31,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:08:31" (1/1) ... [2025-03-20 06:08:31,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23324542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:31, skipping insertion in model container [2025-03-20 06:08:31,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:08:31" (1/1) ... [2025-03-20 06:08:31,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 06:08:32,666 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-03-20 06:08:32,668 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-03-20 06:08:32,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-03-20 06:08:32,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-03-20 06:08:32,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-03-20 06:08:32,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-03-20 06:08:32,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-03-20 06:08:32,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 06:08:32,704 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 06:08:32,806 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-03-20 06:08:32,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-03-20 06:08:32,808 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-03-20 06:08:32,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-03-20 06:08:32,809 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-03-20 06:08:32,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-03-20 06:08:32,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-03-20 06:08:32,810 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-03-20 06:08:32,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-03-20 06:08:32,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-03-20 06:08:32,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-03-20 06:08:32,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-03-20 06:08:32,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-03-20 06:08:32,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-03-20 06:08:32,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-03-20 06:08:32,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-03-20 06:08:32,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-03-20 06:08:32,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-03-20 06:08:32,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-03-20 06:08:32,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-03-20 06:08:32,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-03-20 06:08:32,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-03-20 06:08:32,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-03-20 06:08:32,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-03-20 06:08:32,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-03-20 06:08:32,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-03-20 06:08:32,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-03-20 06:08:32,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-03-20 06:08:32,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-03-20 06:08:32,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-03-20 06:08:32,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-03-20 06:08:32,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-03-20 06:08:32,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-03-20 06:08:32,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-03-20 06:08:32,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-03-20 06:08:32,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-03-20 06:08:32,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-03-20 06:08:32,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-03-20 06:08:32,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-03-20 06:08:32,819 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-03-20 06:08:32,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-03-20 06:08:32,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-03-20 06:08:32,820 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-03-20 06:08:32,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-03-20 06:08:32,821 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-03-20 06:08:32,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-03-20 06:08:32,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-03-20 06:08:32,822 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-03-20 06:08:32,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-03-20 06:08:32,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-03-20 06:08:32,823 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-03-20 06:08:32,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-03-20 06:08:32,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-03-20 06:08:32,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-03-20 06:08:32,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-03-20 06:08:32,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-03-20 06:08:32,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-03-20 06:08:32,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-03-20 06:08:32,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-03-20 06:08:32,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-03-20 06:08:32,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-03-20 06:08:32,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-03-20 06:08:32,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-03-20 06:08:32,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-03-20 06:08:32,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-03-20 06:08:32,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-03-20 06:08:32,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-03-20 06:08:32,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-03-20 06:08:32,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-03-20 06:08:32,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-03-20 06:08:32,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-03-20 06:08:32,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-03-20 06:08:32,865 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-03-20 06:08:32,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-03-20 06:08:32,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-03-20 06:08:32,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-03-20 06:08:32,866 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-03-20 06:08:32,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-03-20 06:08:32,869 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-03-20 06:08:32,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-03-20 06:08:32,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-03-20 06:08:32,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-03-20 06:08:32,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-03-20 06:08:32,870 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-03-20 06:08:32,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-03-20 06:08:32,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-03-20 06:08:32,871 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-03-20 06:08:32,872 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-03-20 06:08:32,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-03-20 06:08:32,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-03-20 06:08:32,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-03-20 06:08:32,873 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-03-20 06:08:32,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-03-20 06:08:32,874 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-03-20 06:08:32,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-03-20 06:08:32,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-03-20 06:08:32,875 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-03-20 06:08:32,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-03-20 06:08:32,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-03-20 06:08:32,876 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-03-20 06:08:32,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-03-20 06:08:32,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-03-20 06:08:32,926 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-03-20 06:08:32,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-03-20 06:08:32,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-03-20 06:08:32,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-03-20 06:08:32,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-03-20 06:08:32,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 06:08:33,134 INFO L204 MainTranslator]: Completed translation [2025-03-20 06:08:33,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33 WrapperNode [2025-03-20 06:08:33,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 06:08:33,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 06:08:33,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 06:08:33,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 06:08:33,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,234 INFO L138 Inliner]: procedures = 914, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 628 [2025-03-20 06:08:33,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 06:08:33,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 06:08:33,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 06:08:33,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 06:08:33,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,246 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,291 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 06:08:33,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 06:08:33,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 06:08:33,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 06:08:33,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (1/1) ... [2025-03-20 06:08:33,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 06:08:33,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:08:33,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-20 06:08:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-20 06:08:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 06:08:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-20 06:08:33,349 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-20 06:08:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-20 06:08:33,351 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 06:08:33,499 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 06:08:33,500 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 06:08:34,207 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 06:08:34,207 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 06:08:34,667 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 06:08:34,668 INFO L312 CfgBuilder]: Removed 20 assume(true) statements. [2025-03-20 06:08:34,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:08:34 BoogieIcfgContainer [2025-03-20 06:08:34,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 06:08:34,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 06:08:34,670 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 06:08:34,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 06:08:34,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 06:08:31" (1/3) ... [2025-03-20 06:08:34,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cb2fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:08:34, skipping insertion in model container [2025-03-20 06:08:34,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:08:33" (2/3) ... [2025-03-20 06:08:34,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cb2fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:08:34, skipping insertion in model container [2025-03-20 06:08:34,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:08:34" (3/3) ... [2025-03-20 06:08:34,676 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-03-20 06:08:34,687 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 06:08:34,689 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-03-20 06:08:34,689 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 06:08:34,775 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-20 06:08:34,811 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:08:34,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 06:08:34,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:08:34,813 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-20 06:08:34,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-20 06:08:34,921 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 06:08:34,931 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 06:08:34,939 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;@19f77767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:08:34,939 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-20 06:08:36,214 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-03-20 06:08:36,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:08:36,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1411605412, now seen corresponding path program 1 times [2025-03-20 06:08:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:08:36,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50881520] [2025-03-20 06:08:36,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:08:36,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:08:36,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 06:08:36,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 06:08:36,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:08:36,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 06:08:36,418 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 06:08:36,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 06:08:36,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 06:08:36,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:08:36,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 06:08:36,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-20 06:08:36,578 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 06:08:36,579 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-20 06:08:36,580 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-20 06:08:36,580 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-20 06:08:36,580 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-20 06:08:36,580 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-20 06:08:36,581 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-20 06:08:36,581 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-20 06:08:36,581 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-20 06:08:36,581 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-20 06:08:36,586 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-20 06:08:36,588 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 06:08:36,588 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-20 06:08:36,676 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-20 06:08:36,686 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:08:36,720 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 06:08:36,720 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 06:08:36,720 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;@19f77767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:08:36,720 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-20 06:08:43,515 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-03-20 06:08:43,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:08:43,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1986655527, now seen corresponding path program 1 times [2025-03-20 06:08:43,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:08:43,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047194571] [2025-03-20 06:08:43,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:08:43,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:08:43,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-20 06:08:43,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-20 06:08:43,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:08:43,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:08:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:08:43,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:08:43,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047194571] [2025-03-20 06:08:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047194571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:08:43,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:08:43,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 06:08:43,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240966041] [2025-03-20 06:08:43,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:08:43,642 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 06:08:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:08:43,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 06:08:43,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 06:08:43,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:43,656 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:08:43,660 INFO L481 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-03-20 06:08:43,661 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,247 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,248 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-20 06:08:45,248 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-03-20 06:08:45,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:08:45,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1722852705, now seen corresponding path program 1 times [2025-03-20 06:08:45,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:08:45,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650689957] [2025-03-20 06:08:45,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:08:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:08:45,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-20 06:08:45,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-20 06:08:45,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:08:45,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:08:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:08:45,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:08:45,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650689957] [2025-03-20 06:08:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650689957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:08:45,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:08:45,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:08:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704242484] [2025-03-20 06:08:45,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:08:45,439 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:08:45,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:08:45,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:08:45,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:08:45,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,440 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:08:45,440 INFO L481 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-03-20 06:08:45,440 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,440 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:08:45,514 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-20 06:08:45,514 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-03-20 06:08:45,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:08:45,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1606987198, now seen corresponding path program 1 times [2025-03-20 06:08:45,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:08:45,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120594635] [2025-03-20 06:08:45,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:08:45,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:08:45,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-20 06:08:45,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-20 06:08:45,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:08:45,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:08:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:08:45,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:08:45,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120594635] [2025-03-20 06:08:45,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120594635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:08:45,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:08:45,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-20 06:08:45,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719863118] [2025-03-20 06:08:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:08:45,673 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 06:08:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:08:45,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 06:08:45,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-20 06:08:45,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,674 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:08:45,674 INFO L481 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-03-20 06:08:45,674 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:08:45,674 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:08:45,674 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:18,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:18,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:18,160 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:18,160 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-20 06:09:18,160 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-03-20 06:09:18,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:09:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1553125445, now seen corresponding path program 1 times [2025-03-20 06:09:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:09:18,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265654780] [2025-03-20 06:09:18,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:09:18,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:09:18,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-20 06:09:18,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-20 06:09:18,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:09:18,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:09:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-20 06:09:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:09:18,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265654780] [2025-03-20 06:09:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265654780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:09:18,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:09:18,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:09:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206405739] [2025-03-20 06:09:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:09:18,464 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:09:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:09:18,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:09:18,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:09:18,465 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:18,465 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:09:18,465 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 06:09:18,465 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:18,465 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:18,465 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:18,465 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:47,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:47,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:47,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:47,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:47,584 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-20 06:09:47,584 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-03-20 06:09:47,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:09:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1035342151, now seen corresponding path program 1 times [2025-03-20 06:09:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:09:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880862083] [2025-03-20 06:09:47,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:09:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:09:47,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-20 06:09:47,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-20 06:09:47,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:09:47,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:09:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-20 06:09:47,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:09:47,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880862083] [2025-03-20 06:09:47,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880862083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:09:47,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:09:47,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:09:47,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085275100] [2025-03-20 06:09:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:09:47,883 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:09:47,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:09:47,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:09:47,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:09:47,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:47,885 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:09:47,885 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-03-20 06:09:47,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:47,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:47,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:47,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:47,885 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:48,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:48,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:48,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,061 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-20 06:09:48,061 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-03-20 06:09:48,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:09:48,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2046002807, now seen corresponding path program 1 times [2025-03-20 06:09:48,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:09:48,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256225311] [2025-03-20 06:09:48,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:09:48,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:09:48,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-20 06:09:48,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-20 06:09:48,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:09:48,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:09:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-20 06:09:48,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:09:48,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256225311] [2025-03-20 06:09:48,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256225311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:09:48,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:09:48,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:09:48,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339305001] [2025-03-20 06:09:48,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:09:48,361 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:09:48,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:09:48,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:09:48,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:09:48,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:48,363 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:09:48,363 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 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-03-20 06:09:48,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:48,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:48,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,363 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:48,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:48,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:48,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,826 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:48,826 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-20 06:09:48,826 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-20 06:09:48,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:09:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash -505767851, now seen corresponding path program 2 times [2025-03-20 06:09:48,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:09:48,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27393695] [2025-03-20 06:09:48,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 06:09:48,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:09:48,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 295 statements into 2 equivalence classes. [2025-03-20 06:09:48,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 141 of 295 statements. [2025-03-20 06:09:48,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:09:48,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:09:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-20 06:09:49,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:09:49,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27393695] [2025-03-20 06:09:49,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27393695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:09:49,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:09:49,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:09:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411511883] [2025-03-20 06:09:49,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:09:49,021 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:09:49,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:09:49,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:09:49,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:09:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:49,023 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:09:49,023 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-20 06:09:49,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:49,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:49,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,023 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:49,141 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-20 06:09:49,141 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-03-20 06:09:49,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:09:49,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1720943832, now seen corresponding path program 1 times [2025-03-20 06:09:49,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:09:49,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154787568] [2025-03-20 06:09:49,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:09:49,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:09:49,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-20 06:09:49,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-20 06:09:49,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:09:49,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:09:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-20 06:09:50,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:09:50,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154787568] [2025-03-20 06:09:50,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154787568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:09:50,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:09:50,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-20 06:09:50,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110571322] [2025-03-20 06:09:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:09:50,375 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 06:09:50,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:09:50,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 06:09:50,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-20 06:09:50,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:50,375 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:09:50,376 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:50,376 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:09:51,153 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-20 06:09:51,153 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-03-20 06:09:51,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:09:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1740243234, now seen corresponding path program 1 times [2025-03-20 06:09:51,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:09:51,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559161491] [2025-03-20 06:09:51,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:09:51,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:09:51,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-20 06:09:51,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-20 06:09:51,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:09:51,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:09:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-20 06:09:51,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:09:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559161491] [2025-03-20 06:09:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559161491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:09:51,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:09:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-20 06:09:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882138396] [2025-03-20 06:09:51,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:09:51,984 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 06:09:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:09:51,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 06:09:51,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-20 06:09:51,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:51,984 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:09:51,985 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:09:51,985 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:09:52,268 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:09:52,268 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-20 06:09:52,268 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-03-20 06:09:52,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:09:52,269 INFO L85 PathProgramCache]: Analyzing trace with hash -995174848, now seen corresponding path program 1 times [2025-03-20 06:09:52,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:09:52,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222451925] [2025-03-20 06:09:52,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:09:52,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:09:52,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-20 06:09:52,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-20 06:09:52,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:09:52,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:10:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:10:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:10:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222451925] [2025-03-20 06:10:12,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222451925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 06:10:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693212978] [2025-03-20 06:10:12,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:10:12,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:10:12,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:10:12,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:10:12,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-20 06:10:13,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-20 06:10:13,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-20 06:10:13,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:10:13,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:10:13,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 2171 conjuncts, 845 conjuncts are in the unsatisfiable core [2025-03-20 06:10:13,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:10:13,453 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 13 treesize of output 9 [2025-03-20 06:10:13,459 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-03-20 06:10:13,542 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-03-20 06:10:13,548 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-03-20 06:10:13,703 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 32 treesize of output 34 [2025-03-20 06:10:13,710 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-03-20 06:10:13,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:13,889 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-03-20 06:10:13,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:13,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:13,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:13,899 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-03-20 06:10:14,065 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 29 treesize of output 13 [2025-03-20 06:10:14,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2025-03-20 06:10:14,158 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-20 06:10:14,158 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-03-20 06:10:14,229 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-03-20 06:10:14,240 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 43 treesize of output 32 [2025-03-20 06:10:14,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:14,281 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-03-20 06:10:14,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:14,285 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 43 treesize of output 32 [2025-03-20 06:10:14,297 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-03-20 06:10:14,299 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 43 treesize of output 32 [2025-03-20 06:10:14,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:14,467 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 43 treesize of output 32 [2025-03-20 06:10:14,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:14,476 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-03-20 06:10:15,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:15,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:15,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:15,286 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2025-03-20 06:10:15,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 25 treesize of output 13 [2025-03-20 06:10:15,400 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-03-20 06:10:15,404 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 43 treesize of output 32 [2025-03-20 06:10:15,492 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:10:15,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 54 treesize of output 47 [2025-03-20 06:10:15,498 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-03-20 06:10:15,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:15,841 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-03-20 06:10:15,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-03-20 06:10:15,845 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 43 treesize of output 32 [2025-03-20 06:10:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 06:10:16,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 06:10:16,902 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~exp~2#1| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1|)) (.cse1 (+ |c_~#g_queue~0.offset| 8)) (.cse2 (+ |c_~#g_queue~0.offset| 4)) (.cse4 (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse5 (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (and (or (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~next~0#1|) (let ((.cse0 (select (let ((.cse3 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse5) v_ArrVal_1539))) (store .cse3 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse3 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse4 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse0 .cse1) (select .cse0 .cse2))))) .cse6) (or (not .cse6) (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_DerPreprocessor_1 Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~next~0#1|) (let ((.cse7 (select (let ((.cse8 (store (store |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.offset| v_DerPreprocessor_2)) (select (select (store |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_cmpxchg_~a#1.offset| v_DerPreprocessor_1)) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse5) v_ArrVal_1539))) (store .cse8 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse8 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse4 |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse7 .cse1) (select .cse7 .cse2)))))))) is different from false [2025-03-20 06:10:16,915 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse0 (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (store (store |c_#memory_int| .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |c_~#g_queue~0.base|))) (< (select .cse0 (+ |c_~#g_queue~0.offset| 8)) (select .cse0 (+ |c_~#g_queue~0.offset| 4)))) (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)))) is different from false [2025-03-20 06:10:16,936 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| (+ |c_writerThread2of2ForFork0_vatomic32_read_#t~mem436#1| 1)) (let ((.cse0 (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (store (store |c_#memory_int| .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |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-03-20 06:10:16,951 WARN L849 $PredicateComparison]: unable to prove that (forall ((|v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (or (< |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10| (+ (select (select |c_#memory_int| |c_writerThread2of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread2of2ForFork0_vatomic32_read_~a#1.offset|) 1)) (let ((.cse0 (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (store (store |c_#memory_int| .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select |c_#memory_int| |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_2)) .cse1 v_ArrVal_1539) |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ |c_writerThread2of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4) |v_writerThread2of2ForFork0_vatomic32_write_~v#1_10|))) |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-03-20 06:10:16,957 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_2 Int) (v_ArrVal_1539 (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_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse0 |c_~#g_queue~0.offset|) 1)))) is different from false [2025-03-20 06:10:17,001 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1539 (Array Int Int))) (let ((.cse0 (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_1534)))) (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 |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_1531)) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 16)) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) is different from false [2025-03-20 06:10:18,995 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse7 (select .cse1 |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse7 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse0 1)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse5 (select .cse4 |c_~#g_queue~0.base|)) (.cse6 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse2 (select .cse5 .cse6))) (let ((.cse3 (select (store (store .cse1 |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse2 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 .cse2 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse3 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse2 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse6) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse3 |c_~#g_queue~0.offset|) 1)))))) (= (mod (select .cse7 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse0 (* 4294967295 (select .cse7 (+ |c_~#g_queue~0.offset| 12)))) 4294967296))))))) is different from false [2025-03-20 06:10:19,195 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse2 (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| |c_writerThread2of2ForFork0_vatomic32_write_~v#1|)) |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse0 (select .cse2 |c_~#g_queue~0.base|))) (let ((.cse1 (select .cse0 |c_~#g_queue~0.offset|))) (or (= (mod (select .cse0 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* 4294967295 (select .cse0 (+ |c_~#g_queue~0.offset| 12))) .cse1) 4294967296)) (let ((.cse5 (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_1522)) |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.base|)) (.cse7 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse3 (select .cse6 .cse7))) (let ((.cse4 (select (store (store .cse2 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse3 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse2 .cse3 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse4 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse5 |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse4 |c_~#g_queue~0.offset|) 1)))))) (< v_ArrVal_1528 (+ .cse1 1))))))) is different from false [2025-03-20 06:10:21,627 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|)) (.cse8 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse11 (select .cse10 .cse8))) (let ((.cse9 (store |c_#memory_int| .cse11 v_ArrVal_1517)) (.cse5 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse1 (select (store (store .cse9 |c_~#g_queue~0.base| (let ((.cse12 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse13 (+ (select .cse12 |c_~#g_queue~0.offset|) 1))) (store (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| .cse13)) .cse11 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse5 .cse13)))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse1 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse0 1)) (= (mod (select .cse1 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse0 (* 4294967295 (select .cse1 (+ |c_~#g_queue~0.offset| 12)))) 4294967296)) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse11 v_ArrVal_1518))) (let ((.cse7 (select (store (store .cse6 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse10 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse11 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse5 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse2 (store .cse9 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse3 (select .cse7 .cse8))) (let ((.cse4 (select (store (store .cse2 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse3 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse2 .cse3 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse6 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse8) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse4 |c_~#g_queue~0.offset|) 1))))))))))))) is different from false [2025-03-20 06:10:23,411 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse17 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse5 (select .cse17 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store |c_#memory_int| .cse16 v_ArrVal_1517)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse4 (select .cse5 |c_~#g_queue~0.offset|))) (let ((.cse0 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse4 1))) (store (select (store (store .cse17 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| .cse18)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse2 (select .cse0 |c_~#g_queue~0.offset|)) (.cse3 (+ |c_~#g_queue~0.offset| 12)) (.cse1 (+ |c_~#g_queue~0.offset| 20))) (or (= (mod (select .cse0 .cse1) 4294967296) (mod (+ .cse2 (* (select .cse0 .cse3) 4294967295)) 4294967296)) (< v_ArrVal_1528 (+ .cse2 1)) (not (= (mod (+ .cse4 (* 4294967295 (select .cse5 .cse3))) 4294967296) (mod (select .cse5 .cse1) 4294967296))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))))))))) is different from false [2025-03-20 06:10:23,784 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse17 (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_1510)))) (let ((.cse20 (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_1509))) (.cse14 (store .cse17 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse18 (store .cse20 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse1 (select .cse18 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store .cse20 .cse16 v_ArrVal_1517)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse3 (select .cse1 |c_~#g_queue~0.offset|))) (let ((.cse5 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse19 (+ .cse3 1))) (store (select (store (store .cse18 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| .cse19)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse19))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse4 (+ |c_~#g_queue~0.offset| 12)) (.cse0 (select .cse5 |c_~#g_queue~0.offset|)) (.cse2 (+ |c_~#g_queue~0.offset| 20))) (or (< v_ArrVal_1528 (+ 1 .cse0)) (not (= (mod (select .cse1 .cse2) 4294967296) (mod (+ .cse3 (* 4294967295 (select .cse1 .cse4))) 4294967296))) (= (mod (+ (* (select .cse5 .cse4) 4294967295) .cse0) 4294967296) (mod (select .cse5 .cse2) 4294967296)) (let ((.cse10 (store .cse17 .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1))))))))))))))) is different from false [2025-03-20 06:10:23,859 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse22 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse23 (select (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (let ((.cse17 (let ((.cse24 (store |c_#memory_$Pointer$.base| .cse23 v_ArrVal_1505))) (store .cse24 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse24 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse22 v_ArrVal_1510))))) (let ((.cse20 (let ((.cse21 (store |c_#memory_int| .cse23 v_ArrVal_1506))) (store .cse21 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse21 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse22 v_ArrVal_1509)))) (.cse14 (store .cse17 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse18 (store .cse20 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse5 (select .cse18 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store .cse20 .cse16 v_ArrVal_1517)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse4 (select .cse5 |c_~#g_queue~0.offset|))) (let ((.cse1 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse19 (+ .cse4 1))) (store (select (store (store .cse18 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| .cse19)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse19))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse1 |c_~#g_queue~0.offset|)) (.cse2 (+ |c_~#g_queue~0.offset| 12)) (.cse3 (+ |c_~#g_queue~0.offset| 20))) (or (= (mod (+ .cse0 (* 4294967295 (select .cse1 .cse2))) 4294967296) (mod (select .cse1 .cse3) 4294967296)) (< v_ArrVal_1528 (+ .cse0 1)) (not (= (mod (+ .cse4 (* (select .cse5 .cse2) 4294967295)) 4294967296) (mod (select .cse5 .cse3) 4294967296))) (let ((.cse10 (store .cse17 .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))))))))))) is different from false [2025-03-20 06:10:24,426 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse25 (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base|))) (let ((.cse0 (= |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~exp~2#1| (select .cse25 |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.offset|))) (.cse18 (+ |c_~#g_queue~0.offset| 12)) (.cse19 (+ |c_~#g_queue~0.offset| 20)) (.cse8 (+ |c_~#g_queue~0.offset| 8)) (.cse4 (+ |c_~#g_queue~0.offset| 4)) (.cse7 (+ |c_~#g_queue~0.offset| 16)) (.cse24 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse29 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse28 (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 ((.cse26 (select (select .cse28 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse29))) (let ((.cse14 (let ((.cse27 (store .cse28 .cse26 v_ArrVal_1505))) (store .cse27 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse27 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse22 (let ((.cse23 (store (store |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.base| (store .cse25 |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~a#1.offset| |c_writerThread1of2ForFork0_vatomic32_cmpxchg_~v#1|)) .cse26 v_ArrVal_1506))) (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse11 (store .cse14 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse12 (select .cse11 |c_~#g_queue~0.base|)) (.cse20 (store .cse22 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse17 (select .cse20 |c_~#g_queue~0.base|)) (.cse13 (select .cse12 .cse7))) (let ((.cse10 (store .cse22 .cse13 v_ArrVal_1517)) (.cse16 (select .cse17 |c_~#g_queue~0.offset|))) (let ((.cse9 (select (store (store .cse10 |c_~#g_queue~0.base| (let ((.cse21 (+ .cse16 1))) (store (select (store (store .cse20 |c_~#g_queue~0.base| (store .cse17 |c_~#g_queue~0.offset| .cse21)) .cse13 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse4 .cse21))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse15 (select .cse9 |c_~#g_queue~0.offset|))) (or (let ((.cse5 (store .cse14 .cse13 v_ArrVal_1518))) (let ((.cse6 (select (store (store .cse5 |c_~#g_queue~0.base| (store (select (store (store .cse11 |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse13 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse4 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse1 (store .cse10 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse2 (select .cse6 .cse7))) (let ((.cse3 (select (store (store .cse1 |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse2 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 .cse2 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse5 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse2 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse8) (+ (select .cse3 |c_~#g_queue~0.offset|) 1)))))) (< v_ArrVal_1528 (+ .cse15 1)) (not (= (mod (+ .cse16 (* (select .cse17 .cse18) 4294967295)) 4294967296) (mod (select .cse17 .cse19) 4294967296))) (= (mod (+ (* 4294967295 (select .cse9 .cse18)) .cse15) 4294967296) (mod (select .cse9 .cse19) 4294967296)))))))))))))) (or .cse0 (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse29))) (let ((.cse43 (let ((.cse49 (store |c_#memory_$Pointer$.base| .cse48 v_ArrVal_1505))) (store .cse49 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse49 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse46 (let ((.cse47 (store |c_#memory_int| .cse48 v_ArrVal_1506))) (store .cse47 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse47 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse40 (store .cse43 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse41 (select .cse40 |c_~#g_queue~0.base|)) (.cse44 (store .cse46 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse33 (select .cse44 |c_~#g_queue~0.base|)) (.cse42 (select .cse41 .cse7))) (let ((.cse39 (store .cse46 .cse42 v_ArrVal_1517)) (.cse32 (select .cse33 |c_~#g_queue~0.offset|))) (let ((.cse31 (select (store (store .cse39 |c_~#g_queue~0.base| (let ((.cse45 (+ .cse32 1))) (store (select (store (store .cse44 |c_~#g_queue~0.base| (store .cse33 |c_~#g_queue~0.offset| .cse45)) .cse42 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse4 .cse45))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse30 (select .cse31 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse30 (* 4294967295 (select .cse31 .cse18))) 4294967296) (mod (select .cse31 .cse19) 4294967296)) (< v_ArrVal_1528 (+ .cse30 1)) (not (= (mod (+ .cse32 (* (select .cse33 .cse18) 4294967295)) 4294967296) (mod (select .cse33 .cse19) 4294967296))) (let ((.cse37 (store .cse43 .cse42 v_ArrVal_1518))) (let ((.cse38 (select (store (store .cse37 |c_~#g_queue~0.base| (store (select (store (store .cse40 |c_~#g_queue~0.base| (store .cse41 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse42 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse4 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse34 (store .cse39 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse35 (select .cse38 .cse7))) (let ((.cse36 (select (store (store .cse34 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse35 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse34 .cse35 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse36 .cse4 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse37 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse38 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse35 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse8) (+ (select .cse36 |c_~#g_queue~0.offset|) 1)))))))))))))))))))) is different from false [2025-03-20 06:10:24,824 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (.cse25 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse2 (+ |c_~#g_queue~0.offset| 12)) (.cse3 (+ |c_~#g_queue~0.offset| 20)) (.cse13 (+ |c_~#g_queue~0.offset| 8)) (.cse9 (+ |c_~#g_queue~0.offset| 4)) (.cse12 (+ |c_~#g_queue~0.offset| 16)) (.cse24 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse22 (select .cse25 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse26 (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (and (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505) |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 .cse25 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse22 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510)))) (let ((.cse21 (store (store |c_#memory_int| .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1))) .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509))) (.cse15 (store .cse18 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse16 (select .cse15 |c_~#g_queue~0.base|)) (.cse19 (store .cse21 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse4 (select .cse19 |c_~#g_queue~0.base|)) (.cse17 (select .cse16 .cse12))) (let ((.cse14 (store .cse21 .cse17 v_ArrVal_1517)) (.cse5 (select .cse4 |c_~#g_queue~0.offset|))) (let ((.cse1 (select (store (store .cse14 |c_~#g_queue~0.base| (let ((.cse20 (+ .cse5 1))) (store (select (store (store .cse19 |c_~#g_queue~0.base| (store .cse4 |c_~#g_queue~0.offset| .cse20)) .cse17 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse20))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse1 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse0 (* 4294967295 (select .cse1 .cse2))) 4294967296) (mod (select .cse1 .cse3) 4294967296)) (< v_ArrVal_1528 (+ .cse0 1)) (not (= (mod (+ (* (select .cse4 .cse2) 4294967295) .cse5) 4294967296) (mod (select .cse4 .cse3) 4294967296))) (let ((.cse10 (store .cse18 .cse17 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store .cse15 |c_~#g_queue~0.base| (store .cse16 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse17 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse14 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse13) (+ (select .cse8 |c_~#g_queue~0.offset|) 1))))))))))))))) (not .cse26)) (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse40 (let ((.cse45 (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505))) (store .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse43 (let ((.cse44 (store |c_#memory_int| .cse22 v_ArrVal_1506))) (store .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse37 (store .cse40 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse38 (select .cse37 |c_~#g_queue~0.base|)) (.cse41 (store .cse43 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse30 (select .cse41 |c_~#g_queue~0.base|)) (.cse39 (select .cse38 .cse12))) (let ((.cse36 (store .cse43 .cse39 v_ArrVal_1517)) (.cse29 (select .cse30 |c_~#g_queue~0.offset|))) (let ((.cse28 (select (store (store .cse36 |c_~#g_queue~0.base| (let ((.cse42 (+ .cse29 1))) (store (select (store (store .cse41 |c_~#g_queue~0.base| (store .cse30 |c_~#g_queue~0.offset| .cse42)) .cse39 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse42))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse27 (select .cse28 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse27 (* 4294967295 (select .cse28 .cse2))) 4294967296) (mod (select .cse28 .cse3) 4294967296)) (< v_ArrVal_1528 (+ .cse27 1)) (not (= (mod (+ .cse29 (* (select .cse30 .cse2) 4294967295)) 4294967296) (mod (select .cse30 .cse3) 4294967296))) (let ((.cse34 (store .cse40 .cse39 v_ArrVal_1518))) (let ((.cse35 (select (store (store .cse34 |c_~#g_queue~0.base| (store (select (store (store .cse37 |c_~#g_queue~0.base| (store .cse38 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse39 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse31 (store .cse36 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse32 (select .cse35 .cse12))) (let ((.cse33 (select (store (store .cse31 |c_~#g_queue~0.base| (store .cse28 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse32 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse31 .cse32 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse33 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse34 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse35 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse32 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse13) (+ (select .cse33 |c_~#g_queue~0.offset|) 1))))))))))))))) .cse26)))) is different from false [2025-03-20 06:10:25,282 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse44 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (.cse45 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse4 (+ |c_~#g_queue~0.offset| 20)) (.cse3 (+ |c_~#g_queue~0.offset| 12)) (.cse14 (+ |c_~#g_queue~0.offset| 8)) (.cse10 (+ |c_~#g_queue~0.offset| 4)) (.cse13 (+ |c_~#g_queue~0.offset| 16)) (.cse25 (select .cse45 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse24 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse0 (= |c_writerThread1of2ForFork0_vatomic32_read_#t~mem436#1| (select .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (and (or .cse0 (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse19 (let ((.cse26 (store |c_#memory_$Pointer$.base| .cse25 v_ArrVal_1505))) (store .cse26 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse26 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510))))) (let ((.cse22 (let ((.cse23 (store |c_#memory_int| .cse25 v_ArrVal_1506))) (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509)))) (.cse16 (store .cse19 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse17 (select .cse16 |c_~#g_queue~0.base|)) (.cse20 (store .cse22 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse6 (select .cse20 |c_~#g_queue~0.base|)) (.cse18 (select .cse17 .cse13))) (let ((.cse15 (store .cse22 .cse18 v_ArrVal_1517)) (.cse5 (select .cse6 |c_~#g_queue~0.offset|))) (let ((.cse2 (select (store (store .cse15 |c_~#g_queue~0.base| (let ((.cse21 (+ .cse5 1))) (store (select (store (store .cse20 |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| .cse21)) .cse18 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse10 .cse21))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse1 (select .cse2 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse1 (* 4294967295 (select .cse2 .cse3))) 4294967296) (mod (select .cse2 .cse4) 4294967296)) (< v_ArrVal_1528 (+ .cse1 1)) (not (= (mod (+ .cse5 (* (select .cse6 .cse3) 4294967295)) 4294967296) (mod (select .cse6 .cse4) 4294967296))) (let ((.cse11 (store .cse19 .cse18 v_ArrVal_1518))) (let ((.cse12 (select (store (store .cse11 |c_~#g_queue~0.base| (store (select (store (store .cse16 |c_~#g_queue~0.base| (store .cse17 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse18 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse10 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse7 (store .cse15 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse8 (select .cse12 .cse13))) (let ((.cse9 (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse8 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse7 .cse8 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse9 .cse10 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse11 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse8 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse13) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse14) (+ (select .cse9 |c_~#g_queue~0.offset|) 1)))))))))))))))) (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_$Pointer$.base| .cse25 v_ArrVal_1505) |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 .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse25 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1510)))) (let ((.cse43 (store (store |c_#memory_int| .cse25 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse44 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ |c_writerThread1of2ForFork0_vatomic32_read_#t~mem436#1| 1))) .cse25 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse24 v_ArrVal_1509))) (.cse37 (store .cse40 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse38 (select .cse37 |c_~#g_queue~0.base|)) (.cse41 (store .cse43 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse27 (select .cse41 |c_~#g_queue~0.base|)) (.cse39 (select .cse38 .cse13))) (let ((.cse36 (store .cse43 .cse39 v_ArrVal_1517)) (.cse28 (select .cse27 |c_~#g_queue~0.offset|))) (let ((.cse30 (select (store (store .cse36 |c_~#g_queue~0.base| (let ((.cse42 (+ .cse28 1))) (store (select (store (store .cse41 |c_~#g_queue~0.base| (store .cse27 |c_~#g_queue~0.offset| .cse42)) .cse39 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse10 .cse42))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse29 (select .cse30 |c_~#g_queue~0.offset|))) (or (not (= (mod (select .cse27 .cse4) 4294967296) (mod (+ .cse28 (* 4294967295 (select .cse27 .cse3))) 4294967296))) (< v_ArrVal_1528 (+ .cse29 1)) (= (mod (select .cse30 .cse4) 4294967296) (mod (+ (* 4294967295 (select .cse30 .cse3)) .cse29) 4294967296)) (let ((.cse34 (store .cse40 .cse39 v_ArrVal_1518))) (let ((.cse35 (select (store (store .cse34 |c_~#g_queue~0.base| (store (select (store (store .cse37 |c_~#g_queue~0.base| (store .cse38 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse39 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse10 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse31 (store .cse36 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse32 (select .cse35 .cse13))) (let ((.cse33 (select (store (store .cse31 |c_~#g_queue~0.base| (store .cse30 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse32 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse31 .cse32 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse33 .cse10 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse34 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse35 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse32 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse13) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse14) (+ (select .cse33 |c_~#g_queue~0.offset|) 1))))))))))))))) (not .cse0))))) is different from false [2025-03-20 06:10:25,424 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse26 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|)) (.cse24 (select (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_read_~a#1.offset|)) (.cse23 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse27 (= .cse24 (select .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse3 (+ |c_~#g_queue~0.offset| 12)) (.cse1 (+ |c_~#g_queue~0.offset| 20)) (.cse11 (+ |c_~#g_queue~0.offset| 8)) (.cse7 (+ |c_~#g_queue~0.offset| 4)) (.cse10 (+ |c_~#g_queue~0.offset| 16)) (.cse25 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4)) (.cse22 (select .cse26 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)))) (and (or (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505) |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 .cse26 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_5)) .cse22 v_ArrVal_1505) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1510)))) (let ((.cse21 (store (store |c_#memory_int| .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse23 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| (+ .cse24 1))) .cse22 v_ArrVal_1506) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1509))) (.cse14 (store .cse17 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse15 (select .cse14 |c_~#g_queue~0.base|)) (.cse19 (store .cse21 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse0 (select .cse19 |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse10))) (let ((.cse13 (store .cse21 .cse16 v_ArrVal_1517)) (.cse2 (select .cse0 |c_~#g_queue~0.offset|))) (let ((.cse12 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse20 (+ .cse2 1))) (store (select (store (store .cse19 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| .cse20)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse7 .cse20))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse18 (select .cse12 |c_~#g_queue~0.offset|))) (or (not (= (mod (select .cse0 .cse1) 4294967296) (mod (+ .cse2 (* 4294967295 (select .cse0 .cse3))) 4294967296))) (let ((.cse8 (store .cse17 .cse16 v_ArrVal_1518))) (let ((.cse9 (select (store (store .cse8 |c_~#g_queue~0.base| (store (select (store (store .cse14 |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse4 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse5 (select .cse9 .cse10))) (let ((.cse6 (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse12 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse5 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse4 .cse5 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse8 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse10) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse11) (+ (select .cse6 |c_~#g_queue~0.offset|) 1)))))) (= (mod (+ (* 4294967295 (select .cse12 .cse3)) .cse18) 4294967296) (mod (select .cse12 .cse1) 4294967296)) (< v_ArrVal_1528 (+ .cse18 1))))))))))) (not .cse27)) (or .cse27 (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse41 (let ((.cse46 (store |c_#memory_$Pointer$.base| .cse22 v_ArrVal_1505))) (store .cse46 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse46 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1510))))) (let ((.cse44 (let ((.cse45 (store |c_#memory_int| .cse22 v_ArrVal_1506))) (store .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select .cse45 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse25 v_ArrVal_1509)))) (.cse38 (store .cse41 |c_~#g_val~0.base| v_ArrVal_1512))) (let ((.cse39 (select .cse38 |c_~#g_queue~0.base|)) (.cse42 (store .cse44 |c_~#g_val~0.base| v_ArrVal_1511))) (let ((.cse31 (select .cse42 |c_~#g_queue~0.base|)) (.cse40 (select .cse39 .cse10))) (let ((.cse37 (store .cse44 .cse40 v_ArrVal_1517)) (.cse30 (select .cse31 |c_~#g_queue~0.offset|))) (let ((.cse29 (select (store (store .cse37 |c_~#g_queue~0.base| (let ((.cse43 (+ .cse30 1))) (store (select (store (store .cse42 |c_~#g_queue~0.base| (store .cse31 |c_~#g_queue~0.offset| .cse43)) .cse40 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse7 .cse43))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse28 (select .cse29 |c_~#g_queue~0.offset|))) (or (= (mod (+ .cse28 (* 4294967295 (select .cse29 .cse3))) 4294967296) (mod (select .cse29 .cse1) 4294967296)) (< v_ArrVal_1528 (+ .cse28 1)) (not (= (mod (+ .cse30 (* (select .cse31 .cse3) 4294967295)) 4294967296) (mod (select .cse31 .cse1) 4294967296))) (let ((.cse35 (store .cse41 .cse40 v_ArrVal_1518))) (let ((.cse36 (select (store (store .cse35 |c_~#g_queue~0.base| (store (select (store (store .cse38 |c_~#g_queue~0.base| (store .cse39 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse40 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse32 (store .cse37 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse33 (select .cse36 .cse10))) (let ((.cse34 (select (store (store .cse32 |c_~#g_queue~0.base| (store .cse29 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse33 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse32 .cse33 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse34 .cse7 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse35 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse36 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse33 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse10) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse11) (+ (select .cse34 |c_~#g_queue~0.offset|) 1))))))))))))))))))) is different from false [2025-03-20 06:10:25,499 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse21 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|)) (.cse6 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse20 (select .cse21 .cse6))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse20 v_ArrVal_1505)) (.cse3 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse10 (select (store (store .cse9 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse21 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse20 v_ArrVal_1505) |c_~#g_queue~0.base|) .cse3 v_ArrVal_1510)) |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base|)) (.cse17 (store |c_#memory_int| .cse20 v_ArrVal_1506))) (let ((.cse16 (select (store (store .cse17 |c_~#g_queue~0.base| (store (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (let ((.cse19 (select |c_#memory_int| |c_~#g_queue~0.base|))) (store .cse19 |c_~#g_queue~0.offset| (+ (select .cse19 |c_~#g_queue~0.offset|) 1)))) .cse20 v_ArrVal_1506) |c_~#g_queue~0.base|) .cse3 v_ArrVal_1509)) |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base|)) (.cse11 (select .cse10 .cse6))) (let ((.cse8 (store .cse17 .cse11 v_ArrVal_1517)) (.cse15 (select .cse16 |c_~#g_queue~0.offset|))) (let ((.cse7 (select (store (store .cse8 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse15 1))) (store (select (store (store (store .cse17 |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base| (store .cse16 |c_~#g_queue~0.offset| .cse18)) .cse11 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse3 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse12 (select .cse7 |c_~#g_queue~0.offset|)) (.cse14 (+ |c_~#g_queue~0.offset| 12)) (.cse13 (+ |c_~#g_queue~0.offset| 20))) (or (let ((.cse4 (store .cse9 .cse11 v_ArrVal_1518))) (let ((.cse5 (select (store (store .cse4 |c_~#g_queue~0.base| (store (select (store (store (store .cse9 |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base| (store .cse10 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse11 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse3 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse0 (store .cse8 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse1 (select .cse5 .cse6))) (let ((.cse2 (select (store (store .cse0 |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse1 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse0 .cse1 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse2 .cse3 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse4 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse1 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse6) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse2 |c_~#g_queue~0.offset|) 1)))))) (< v_ArrVal_1528 (+ .cse12 1)) (= (mod (select .cse7 .cse13) 4294967296) (mod (+ .cse12 (* (select .cse7 .cse14) 4294967295)) 4294967296)) (not (= (mod (+ .cse15 (* 4294967295 (select .cse16 .cse14))) 4294967296) (mod (select .cse16 .cse13) 4294967296))))))))))))) is different from false [2025-03-20 06:10:26,963 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1499))) (let ((.cse23 (select .cse22 |c_~#g_queue~0.base|)) (.cse10 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse21 (select .cse23 .cse10))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse21 v_ArrVal_1505)) (.cse7 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse13 (select (store (store .cse12 |c_~#g_queue~0.base| (store (select (store (store .cse22 |c_~#g_queue~0.base| (store .cse23 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse21 v_ArrVal_1505) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1510)) |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base|)) (.cse17 (store |c_#memory_int| .cse21 v_ArrVal_1506))) (let ((.cse15 (select (store (store .cse17 |c_~#g_queue~0.base| (store (select (store (let ((.cse19 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1500))) (store .cse19 |c_~#g_queue~0.base| (let ((.cse20 (select .cse19 |c_~#g_queue~0.base|))) (store .cse20 |c_~#g_queue~0.offset| (+ (select .cse20 |c_~#g_queue~0.offset|) 1))))) .cse21 v_ArrVal_1506) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1509)) |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base|)) (.cse14 (select .cse13 .cse10))) (let ((.cse11 (store .cse17 .cse14 v_ArrVal_1517)) (.cse16 (select .cse15 |c_~#g_queue~0.offset|))) (let ((.cse0 (select (store (store .cse11 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse16 1))) (store (select (store (store (store .cse17 |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| .cse18)) .cse14 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse7 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse3 (+ |c_~#g_queue~0.offset| 20)) (.cse1 (+ |c_~#g_queue~0.offset| 12)) (.cse2 (select .cse0 |c_~#g_queue~0.offset|))) (or (= (mod (+ (* 4294967295 (select .cse0 .cse1)) .cse2) 4294967296) (mod (select .cse0 .cse3) 4294967296)) (let ((.cse8 (store .cse12 .cse14 v_ArrVal_1518))) (let ((.cse9 (select (store (store .cse8 |c_~#g_queue~0.base| (store (select (store (store (store .cse12 |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base| (store .cse13 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse14 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse7 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse4 (store .cse11 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse5 (select .cse9 .cse10))) (let ((.cse6 (select (store (store .cse4 |c_~#g_queue~0.base| (store .cse0 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse5 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse4 .cse5 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse6 .cse7 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse8 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse5 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse10) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse6 |c_~#g_queue~0.offset|) 1)))))) (not (= (mod (select .cse15 .cse3) 4294967296) (mod (+ (* 4294967295 (select .cse15 .cse1)) .cse16) 4294967296))) (< v_ArrVal_1528 (+ .cse2 1))))))))))))) is different from false [2025-03-20 06:10:27,504 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int)) (v_ArrVal_1528 Int) (v_ArrVal_1509 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1512 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1511 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1498 (Array Int Int)) (v_ArrVal_1497 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1510 Int) (v_ArrVal_1534 Int) (v_ArrVal_1522 Int) (v_ArrVal_1518 (Array Int Int)) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1506 (Array Int Int)) (v_ArrVal_1517 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1497))) (let ((.cse23 (store .cse25 |c_~#g_val~0.base| v_ArrVal_1499))) (let ((.cse24 (select .cse23 |c_~#g_queue~0.base|)) (.cse12 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse22 (select .cse24 .cse12))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1498)) (.cse14 (store .cse25 .cse22 v_ArrVal_1505)) (.cse9 (+ |c_~#g_queue~0.offset| 4))) (let ((.cse15 (select (store (store .cse14 |c_~#g_queue~0.base| (store (select (store (store .cse23 |c_~#g_queue~0.base| (store .cse24 |c_~#g_queue~0.offset| v_DerPreprocessor_5)) .cse22 v_ArrVal_1505) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1510)) |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base|)) (.cse17 (store .cse21 .cse22 v_ArrVal_1506))) (let ((.cse1 (select (store (store .cse17 |c_~#g_queue~0.base| (store (select (store (let ((.cse19 (store .cse21 |c_~#g_val~0.base| v_ArrVal_1500))) (store .cse19 |c_~#g_queue~0.base| (let ((.cse20 (select .cse19 |c_~#g_queue~0.base|))) (store .cse20 |c_~#g_queue~0.offset| (+ (select .cse20 |c_~#g_queue~0.offset|) 1))))) .cse22 v_ArrVal_1506) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1509)) |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base|)) (.cse16 (select .cse15 .cse12))) (let ((.cse13 (store .cse17 .cse16 v_ArrVal_1517)) (.cse3 (select .cse1 |c_~#g_queue~0.offset|))) (let ((.cse5 (select (store (store .cse13 |c_~#g_queue~0.base| (let ((.cse18 (+ .cse3 1))) (store (select (store (store (store .cse17 |c_~#g_val~0.base| v_ArrVal_1511) |c_~#g_queue~0.base| (store .cse1 |c_~#g_queue~0.offset| .cse18)) .cse16 v_ArrVal_1517) |c_~#g_queue~0.base|) .cse9 .cse18))) |c_~#g_val~0.base| v_ArrVal_1524) |c_~#g_queue~0.base|))) (let ((.cse4 (+ |c_~#g_queue~0.offset| 12)) (.cse0 (select .cse5 |c_~#g_queue~0.offset|)) (.cse2 (+ |c_~#g_queue~0.offset| 20))) (or (< v_ArrVal_1528 (+ .cse0 1)) (not (= (mod (select .cse1 .cse2) 4294967296) (mod (+ .cse3 (* (select .cse1 .cse4) 4294967295)) 4294967296))) (= (mod (+ (* 4294967295 (select .cse5 .cse4)) .cse0) 4294967296) (mod (select .cse5 .cse2) 4294967296)) (let ((.cse10 (store .cse14 .cse16 v_ArrVal_1518))) (let ((.cse11 (select (store (store .cse10 |c_~#g_queue~0.base| (store (select (store (store (store .cse14 |c_~#g_val~0.base| v_ArrVal_1512) |c_~#g_queue~0.base| (store .cse15 |c_~#g_queue~0.offset| v_DerPreprocessor_4)) .cse16 v_ArrVal_1518) |c_~#g_queue~0.base|) .cse9 v_ArrVal_1522)) |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base|))) (let ((.cse6 (store .cse13 |c_~#g_val~0.base| v_ArrVal_1524)) (.cse7 (select .cse11 .cse12))) (let ((.cse8 (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse7 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse6 .cse7 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse8 .cse9 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store (store .cse10 |c_~#g_val~0.base| v_ArrVal_1523) |c_~#g_queue~0.base| (store .cse11 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse7 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse12) v_ArrVal_1539) |c_~#g_queue~0.base|) (+ |c_~#g_queue~0.offset| 8)) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))))))))))))) is different from false [2025-03-20 06:10:33,075 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:10:33,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 8370 treesize of output 5646 [2025-03-20 06:10:33,436 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:10:33,438 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 479169 treesize of output 475511 [2025-03-20 06:10:36,052 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:10:36,054 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 153883 treesize of output 152893 [2025-03-20 06:10:36,504 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 2068 treesize of output 1884 [2025-03-20 06:10:36,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2274 treesize of output 2154 [2025-03-20 06:10:36,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 1804 treesize of output 1740 [2025-03-20 06:10:36,631 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 2090 treesize of output 1994 [2025-03-20 06:10:36,739 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2330 treesize of output 2270 [2025-03-20 06:10:36,792 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 387 [2025-03-20 06:10:36,838 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 1596 treesize of output 1444 [2025-03-20 06:10:36,885 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 0 case distinctions, treesize of input 370 treesize of output 330 [2025-03-20 06:10:36,928 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 1213 treesize of output 1149 [2025-03-20 06:10:36,974 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 1380 treesize of output 1304 [2025-03-20 06:10:37,026 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 1304 treesize of output 1152 [2025-03-20 06:10:37,070 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 182 treesize of output 150 [2025-03-20 06:10:40,235 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 53 treesize of output 45 [2025-03-20 06:10:40,281 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 370084 treesize of output 368804 [2025-03-20 06:10:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2025-03-20 06:10:42,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693212978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-20 06:10:42,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-20 06:10:42,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 25, 59] total 142 [2025-03-20 06:10:42,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881004254] [2025-03-20 06:10:42,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-20 06:10:42,160 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 143 states [2025-03-20 06:10:42,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:10:42,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2025-03-20 06:10:42,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=884, Invalid=14356, Unknown=88, NotChecked=4978, Total=20306 [2025-03-20 06:10:42,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:10:42,169 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:10:42,170 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 143 states, 143 states have (on average 3.3216783216783217) internal successors, (475), 142 states have internal predecessors, (475), 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-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:10:42,170 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:12:29,781 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_~#g_queue~0.offset| 8)) (.cse0 (select |c_#memory_int| |c_~#g_queue~0.base|)) (.cse5 (+ |c_~#g_queue~0.offset| 4))) (and (not (= (select .cse0 4) (select .cse0 8))) (= |c_~#g_queue~0.offset| 0) (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse10 (select .cse2 |c_~#g_queue~0.base|))) (let ((.cse1 (select .cse10 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse1 1)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse7 (select .cse6 |c_~#g_queue~0.base|)) (.cse8 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse3 (select .cse7 .cse8))) (let ((.cse4 (select (store (store .cse2 |c_~#g_queue~0.base| (store .cse10 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse3 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse2 .cse3 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse4 .cse5 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse6 |c_~#g_queue~0.base| (store .cse7 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse3 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse8) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse9) (+ (select .cse4 |c_~#g_queue~0.offset|) 1)))))) (= (mod (select .cse10 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse1 (* 4294967295 (select .cse10 (+ |c_~#g_queue~0.offset| 12)))) 4294967296))))))) (< (select .cse0 .cse9) (select .cse0 .cse5)))) is different from false [2025-03-20 06:12:30,932 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#g_queue~0.offset| 16)) (.cse4 (+ |c_~#g_queue~0.offset| 8))) (and (let ((.cse5 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.offset|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse2 .cse3))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse0 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse1 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse0 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) (< v_ArrVal_1528 (+ .cse6 1)))) (= (mod (select .cse5 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* (select .cse5 (+ |c_~#g_queue~0.offset| 12)) 4294967295) .cse6) 4294967296))))) (let ((.cse12 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (< v_ArrVal_1528 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse9 (select .cse10 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse11 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_int| .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_ArrVal_1528)) .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1534)))) (let ((.cse8 (select .cse7 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse8 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1529) |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 .cse10 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_3)) .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1531)) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))) (= (mod (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (* 4294967295 (select (select |c_#memory_int| |c_writerThread1of2ForFork0_vatomic32_read_~a#1.base|) |c_writerThread1of2ForFork0_vatomic32_read_~a#1.offset|))) 4294967296) (mod (select .cse12 (+ 20 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)) 4294967296)) (not (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))))))) is different from false [2025-03-20 06:12:30,939 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#g_queue~0.offset| 16)) (.cse4 (+ |c_~#g_queue~0.offset| 8))) (and (let ((.cse5 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.offset|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse2 .cse3))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse0 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse1 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse0 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) (< v_ArrVal_1528 (+ .cse6 1)))) (= (mod (select .cse5 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* (select .cse5 (+ |c_~#g_queue~0.offset| 12)) 4294967295) .cse6) 4294967296))))) (let ((.cse12 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (< v_ArrVal_1528 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse9 (select .cse10 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse11 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_int| .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_ArrVal_1528)) .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1534)))) (let ((.cse8 (select .cse7 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse8 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1529) |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 .cse10 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_3)) .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1531)) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))) (= (mod (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (* |c_writerThread1of2ForFork0_vatomic32_read_#t~mem436#1| 4294967295)) 4294967296) (mod (select .cse12 (+ 20 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|)) 4294967296)) (not (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))))))) is different from false [2025-03-20 06:12:30,946 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_~#g_queue~0.offset| 16)) (.cse4 (+ |c_~#g_queue~0.offset| 8))) (and (let ((.cse5 (select |c_#memory_int| |c_~#g_queue~0.base|))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.offset|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse2 .cse3))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#g_queue~0.base| (store .cse5 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse0 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store |c_#memory_int| .cse0 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse1 (+ |c_~#g_queue~0.offset| 4) v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| |c_~#g_queue~0.base| (store .cse2 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse0 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse1 |c_~#g_queue~0.offset|) 1))))) (< v_ArrVal_1528 (+ .cse6 1)))) (= (mod (select .cse5 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ (* (select .cse5 (+ |c_~#g_queue~0.offset| 12)) 4294967295) .cse6) 4294967296))))) (let ((.cse12 (select |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (or (forall ((v_ArrVal_1528 Int) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1531 Int) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (or (< v_ArrVal_1528 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| 1)) (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|))) (let ((.cse9 (select .cse10 (+ 16 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))) (.cse11 (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| 4))) (let ((.cse7 (store (store |c_#memory_int| .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store (select (store (store |c_#memory_int| |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base| (store .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_ArrVal_1528)) .cse9 v_ArrVal_1530) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1534)))) (let ((.cse8 (select .cse7 |c_~#g_queue~0.base|))) (< (select (select (store (store .cse7 |c_~#g_queue~0.base| (store .cse8 |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_1529) |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 .cse10 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset| v_DerPreprocessor_3)) .cse9 v_ArrVal_1529) |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.base|) .cse11 v_ArrVal_1531)) |c_~#g_queue~0.base|) .cse3) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse4) (+ (select .cse8 |c_~#g_queue~0.offset|) 1)))))))) (= (mod (+ |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (* |c_writerThread1of2ForFork0_bounded_mpmc_enq_#t~ret763#1| 4294967295)) 4294967296) (mod |c_writerThread1of2ForFork0_bounded_mpmc_enq_#t~mem764#1| 4294967296)) (not (= |c_writerThread1of2ForFork0_bounded_mpmc_enq_~curr~0#1| (select .cse12 |c_writerThread1of2ForFork0_bounded_mpmc_enq_~q#1.offset|))))))) is different from false [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:12:33,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:12:33,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-03-20 06:12:33,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-20 06:12:33,751 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-20 06:12:33,751 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-03-20 06:12:33,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:12:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1539042895, now seen corresponding path program 2 times [2025-03-20 06:12:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:12:33,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552707234] [2025-03-20 06:12:33,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 06:12:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:12:33,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 392 statements into 2 equivalence classes. [2025-03-20 06:12:33,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 110 of 392 statements. [2025-03-20 06:12:33,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:12:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:12:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2025-03-20 06:12:37,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:12:37,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552707234] [2025-03-20 06:12:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552707234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:12:37,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:12:37,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-20 06:12:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999276483] [2025-03-20 06:12:37,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:12:37,461 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-20 06:12:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:12:37,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-20 06:12:37,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-20 06:12:37,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:12:37,462 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:12:37,462 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.647058823529412) internal successors, (79), 16 states have internal predecessors, (79), 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-03-20 06:12:37,462 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:12:37,462 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:37,462 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:12:37,462 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:37,462 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:37,462 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:37,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:12:37,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:12:37,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:12:37,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 145 states. [2025-03-20 06:12:37,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:01,203 WARN L538 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-20 06:13:17,451 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_~#g_queue~0.offset| 8)) (.cse4 (+ |c_~#g_queue~0.offset| 4))) (and (forall ((v_ArrVal_1528 Int) (v_ArrVal_1524 (Array Int Int)) (v_ArrVal_1523 (Array Int Int)) (v_ArrVal_1530 (Array Int Int)) (v_ArrVal_1534 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_1529 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#g_val~0.base| v_ArrVal_1524))) (let ((.cse9 (select .cse1 |c_~#g_queue~0.base|))) (let ((.cse0 (select .cse9 |c_~#g_queue~0.offset|))) (or (< v_ArrVal_1528 (+ .cse0 1)) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_~#g_val~0.base| v_ArrVal_1523))) (let ((.cse6 (select .cse5 |c_~#g_queue~0.base|)) (.cse7 (+ |c_~#g_queue~0.offset| 16))) (let ((.cse2 (select .cse6 .cse7))) (let ((.cse3 (select (store (store .cse1 |c_~#g_queue~0.base| (store .cse9 |c_~#g_queue~0.offset| v_ArrVal_1528)) .cse2 v_ArrVal_1530) |c_~#g_queue~0.base|))) (< (select (select (store (store (store .cse1 .cse2 v_ArrVal_1530) |c_~#g_queue~0.base| (store (store .cse3 .cse4 v_ArrVal_1534) |c_~#g_queue~0.offset| v_DerPreprocessor_2)) (select (select (store (store .cse5 |c_~#g_queue~0.base| (store .cse6 |c_~#g_queue~0.offset| v_DerPreprocessor_3)) .cse2 v_ArrVal_1529) |c_~#g_queue~0.base|) .cse7) v_ArrVal_1539) |c_~#g_queue~0.base|) .cse8) (+ (select .cse3 |c_~#g_queue~0.offset|) 1)))))) (= (mod (select .cse9 (+ |c_~#g_queue~0.offset| 20)) 4294967296) (mod (+ .cse0 (* 4294967295 (select .cse9 (+ |c_~#g_queue~0.offset| 12)))) 4294967296))))))) (let ((.cse10 (select |c_#memory_int| |c_~#g_queue~0.base|))) (< (select .cse10 .cse8) (select .cse10 .cse4))))) is different from false [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:18,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-03-20 06:13:18,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 06:13:18,013 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-20 06:13:18,013 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-03-20 06:13:18,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:13:18,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1107115512, now seen corresponding path program 3 times [2025-03-20 06:13:18,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:13:18,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360233284] [2025-03-20 06:13:18,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 06:13:18,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:13:18,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 4 equivalence classes. [2025-03-20 06:13:18,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 101 of 195 statements. [2025-03-20 06:13:18,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-20 06:13:18,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:13:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-20 06:13:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:13:23,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360233284] [2025-03-20 06:13:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360233284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:13:23,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:13:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-20 06:13:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134626868] [2025-03-20 06:13:23,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:13:23,877 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-20 06:13:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:13:23,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-20 06:13:23,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2025-03-20 06:13:23,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:23,878 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:13:23,878 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.6363636363636362) internal successors, (120), 32 states have internal predecessors, (120), 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-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 06:13:23,878 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:28,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 06:13:28,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:13:28,955 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-20 06:13:28,955 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-03-20 06:13:28,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:13:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1540291066, now seen corresponding path program 4 times [2025-03-20 06:13:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:13:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919199340] [2025-03-20 06:13:28,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 06:13:28,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:13:29,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 272 statements into 2 equivalence classes. [2025-03-20 06:13:29,035 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 272 of 272 statements. [2025-03-20 06:13:29,036 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-20 06:13:29,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:13:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-20 06:13:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:13:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919199340] [2025-03-20 06:13:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919199340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:13:29,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:13:29,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-20 06:13:29,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802040707] [2025-03-20 06:13:29,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:13:29,313 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 06:13:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-20 06:13:29,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 06:13:29,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-20 06:13:29,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:29,314 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:13:29,314 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 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-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 178 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:13:29,314 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2025-03-20 06:13:29,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-20 06:13:29,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:13:29,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:13:29,639 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-20 06:13:29,639 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-03-20 06:13:29,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:13:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash -518318493, now seen corresponding path program 5 times [2025-03-20 06:13:29,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-20 06:13:29,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802819265] [2025-03-20 06:13:29,639 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 06:13:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-20 06:13:29,666 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-03-20 06:13:29,679 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 156 statements. [2025-03-20 06:13:29,679 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:13:29,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:13:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 06:13:30,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-20 06:13:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802819265] [2025-03-20 06:13:30,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802819265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-20 06:13:30,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595360473] [2025-03-20 06:13:30,512 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 06:13:30,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:13:30,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:13:30,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:13:30,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-20 06:13:30,725 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-03-20 06:13:30,799 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 156 statements. [2025-03-20 06:13:30,799 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:13:30,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:13:30,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 179 conjuncts are in the unsatisfiable core [2025-03-20 06:13:30,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:13:31,376 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-20 06:13:31,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 06:13:32,061 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:13:32,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 160 [2025-03-20 06:15:33,988 WARN L286 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-20 06:18:14,461 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-03-20 06:18:14,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2025-03-20 06:18:14,462 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-03-20 06:18:14,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-20 06:18:14,662 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-20 06:18:14,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-03-20 06:18:14,836 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:294) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.pushInner(QuantifierPusher.java:274) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:196) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 92 more [2025-03-20 06:18:14,842 INFO L158 Benchmark]: Toolchain (without parser) took 583697.79ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 81.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-20 06:18:14,842 INFO L158 Benchmark]: CDTParser took 0.93ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 06:18:14,842 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1989.52ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 81.2MB in the beginning and 105.2MB in the end (delta: -24.0MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. [2025-03-20 06:18:14,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.33ms. Allocated memory is still 226.5MB. Free memory was 105.2MB in the beginning and 95.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-20 06:18:14,843 INFO L158 Benchmark]: Boogie Preprocessor took 62.62ms. Allocated memory is still 226.5MB. Free memory was 95.3MB in the beginning and 91.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-20 06:18:14,843 INFO L158 Benchmark]: RCFGBuilder took 1367.31ms. Allocated memory is still 226.5MB. Free memory was 91.6MB in the beginning and 132.5MB in the end (delta: -40.9MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2025-03-20 06:18:14,843 INFO L158 Benchmark]: TraceAbstraction took 580171.76ms. Allocated memory was 226.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 130.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 965.0MB. Max. memory is 16.1GB. [2025-03-20 06:18:14,844 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.93ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1989.52ms. Allocated memory was 117.4MB in the beginning and 226.5MB in the end (delta: 109.1MB). Free memory was 81.2MB in the beginning and 105.2MB in the end (delta: -24.0MB). Peak memory consumption was 91.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.33ms. Allocated memory is still 226.5MB. Free memory was 105.2MB in the beginning and 95.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.62ms. Allocated memory is still 226.5MB. Free memory was 95.3MB in the beginning and 91.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1367.31ms. Allocated memory is still 226.5MB. Free memory was 91.6MB in the beginning and 132.5MB in the end (delta: -40.9MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * TraceAbstraction took 580171.76ms. Allocated memory was 226.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 130.4MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 965.0MB. Max. memory is 16.1GB. * 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: 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] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 397, independent conditional: 0, independent unconditional: 397, 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: 402, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 1231, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 970, dependent conditional: 0, dependent unconditional: 970, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 410, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 397, Positive conditional cache size: 0, Positive unconditional cache size: 397, 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, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 1.3s, Number of persistent set computation: 21, Number of trivial persistent sets: 21, Underlying independence relation: ThreadSeparatingIndependenceRelation.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] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 402, independent: 397, independent conditional: 0, independent unconditional: 397, 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: 402, independent: 395, independent conditional: 0, independent unconditional: 395, 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: 1231, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 970, dependent conditional: 0, dependent unconditional: 970, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 410, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 402, unknown conditional: 0, unknown unconditional: 402] , Statistics on independence cache: Total cache size (in pairs): 402, Positive cache size: 397, Positive conditional cache size: 0, Positive unconditional cache size: 397, 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, Independence queries for same thread: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6f23294-m [2025-03-20 06:18:16,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-20 06:18:16,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2025-03-20 06:18:16,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-20 06:18:16,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-20 06:18:16,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-20 06:18:16,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-20 06:18:16,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-20 06:18:16,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-20 06:18:16,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-20 06:18:16,591 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-20 06:18:16,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-20 06:18:16,591 INFO L153 SettingsManager]: * Use SBE=true [2025-03-20 06:18:16,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-20 06:18:16,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-20 06:18:16,592 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-20 06:18:16,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 06:18:16,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Refinement strategy for commutativity condition synthesis=FOX [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-03-20 06:18:16,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-20 06:18:16,594 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-20 06:18:16,594 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-03-20 06:18:16,594 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-20 06:18:16,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-03-20 06:18:16,594 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-03-20 06:18:16,594 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-03-20 06:18:16,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f024b1564d266942c6fb6d9d8e063348b6cc44533a81967df0d35639486bddfe Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-03-20 06:18:16,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-20 06:18:16,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-20 06:18:16,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-20 06:18:16,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-20 06:18:16,819 INFO L274 PluginConnector]: CDTParser initialized [2025-03-20 06:18:16,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-20 06:18:18,087 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f15581bf0/60853e24e145477c92a281e7243d0e45/FLAG845d3eab4 [2025-03-20 06:18:18,401 INFO L389 CDTParser]: Found 1 translation units. [2025-03-20 06:18:18,403 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i [2025-03-20 06:18:18,434 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f15581bf0/60853e24e145477c92a281e7243d0e45/FLAG845d3eab4 [2025-03-20 06:18:19,138 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/f15581bf0/60853e24e145477c92a281e7243d0e45 [2025-03-20 06:18:19,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-20 06:18:19,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-20 06:18:19,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-20 06:18:19,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-20 06:18:19,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-20 06:18:19,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:18:19" (1/1) ... [2025-03-20 06:18:19,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee6919e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:19, skipping insertion in model container [2025-03-20 06:18:19,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 06:18:19" (1/1) ... [2025-03-20 06:18:19,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-20 06:18:20,643 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-03-20 06:18:20,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-03-20 06:18:20,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-03-20 06:18:20,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-03-20 06:18:20,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-03-20 06:18:20,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-03-20 06:18:20,678 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-03-20 06:18:20,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 06:18:20,689 INFO L200 MainTranslator]: Completed pre-run [2025-03-20 06:18:20,775 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4308] [2025-03-20 06:18:20,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4310] [2025-03-20 06:18:20,776 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4315] [2025-03-20 06:18:20,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4317] [2025-03-20 06:18:20,777 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4323] [2025-03-20 06:18:20,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4325] [2025-03-20 06:18:20,778 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4331] [2025-03-20 06:18:20,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4333] [2025-03-20 06:18:20,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4339] [2025-03-20 06:18:20,779 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4341] [2025-03-20 06:18:20,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4347] [2025-03-20 06:18:20,780 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4349] [2025-03-20 06:18:20,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4355] [2025-03-20 06:18:20,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4357] [2025-03-20 06:18:20,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4363] [2025-03-20 06:18:20,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4365] [2025-03-20 06:18:20,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4370] [2025-03-20 06:18:20,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4372] [2025-03-20 06:18:20,782 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4377] [2025-03-20 06:18:20,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4379] [2025-03-20 06:18:20,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4384] [2025-03-20 06:18:20,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4386] [2025-03-20 06:18:20,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4391] [2025-03-20 06:18:20,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4393] [2025-03-20 06:18:20,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4398] [2025-03-20 06:18:20,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4400] [2025-03-20 06:18:20,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4405] [2025-03-20 06:18:20,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4408] [2025-03-20 06:18:20,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4414] [2025-03-20 06:18:20,785 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4417] [2025-03-20 06:18:20,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4423] [2025-03-20 06:18:20,786 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4426] [2025-03-20 06:18:20,787 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4432] [2025-03-20 06:18:20,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4435] [2025-03-20 06:18:20,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4441] [2025-03-20 06:18:20,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4444] [2025-03-20 06:18:20,788 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4450] [2025-03-20 06:18:20,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4453] [2025-03-20 06:18:20,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4460] [2025-03-20 06:18:20,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4463] [2025-03-20 06:18:20,789 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4470] [2025-03-20 06:18:20,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4473] [2025-03-20 06:18:20,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4480] [2025-03-20 06:18:20,790 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4483] [2025-03-20 06:18:20,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4490] [2025-03-20 06:18:20,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4493] [2025-03-20 06:18:20,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4500] [2025-03-20 06:18:20,791 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4503] [2025-03-20 06:18:20,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4510] [2025-03-20 06:18:20,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4513] [2025-03-20 06:18:20,792 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4519] [2025-03-20 06:18:20,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4522] [2025-03-20 06:18:20,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4528] [2025-03-20 06:18:20,793 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4531] [2025-03-20 06:18:20,794 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4537] [2025-03-20 06:18:20,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4540] [2025-03-20 06:18:20,795 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4546] [2025-03-20 06:18:20,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4549] [2025-03-20 06:18:20,796 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4555] [2025-03-20 06:18:20,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4558] [2025-03-20 06:18:20,824 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4564] [2025-03-20 06:18:20,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4567] [2025-03-20 06:18:20,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4573] [2025-03-20 06:18:20,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4576] [2025-03-20 06:18:20,825 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4582] [2025-03-20 06:18:20,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4585] [2025-03-20 06:18:20,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4591] [2025-03-20 06:18:20,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4594] [2025-03-20 06:18:20,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4600] [2025-03-20 06:18:20,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4603] [2025-03-20 06:18:20,826 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4609] [2025-03-20 06:18:20,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4612] [2025-03-20 06:18:20,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4618] [2025-03-20 06:18:20,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4621] [2025-03-20 06:18:20,827 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4627] [2025-03-20 06:18:20,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4630] [2025-03-20 06:18:20,830 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4636] [2025-03-20 06:18:20,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4639] [2025-03-20 06:18:20,831 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4645] [2025-03-20 06:18:20,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4648] [2025-03-20 06:18:20,832 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4654] [2025-03-20 06:18:20,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4656] [2025-03-20 06:18:20,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4662] [2025-03-20 06:18:20,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4664] [2025-03-20 06:18:20,833 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4670] [2025-03-20 06:18:20,834 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4672] [2025-03-20 06:18:20,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4678] [2025-03-20 06:18:20,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4680] [2025-03-20 06:18:20,835 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4686] [2025-03-20 06:18:20,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4688] [2025-03-20 06:18:20,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4694] [2025-03-20 06:18:20,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4696] [2025-03-20 06:18:20,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4702] [2025-03-20 06:18:20,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4704] [2025-03-20 06:18:20,836 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4710] [2025-03-20 06:18:20,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4712] [2025-03-20 06:18:20,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4718] [2025-03-20 06:18:20,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4720] [2025-03-20 06:18:20,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4726] [2025-03-20 06:18:20,837 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4728] [2025-03-20 06:18:20,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193617,193630] [2025-03-20 06:18:20,881 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[193693,193706] [2025-03-20 06:18:20,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196266,196279] [2025-03-20 06:18:20,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196373,196386] [2025-03-20 06:18:20,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196444,196457] [2025-03-20 06:18:20,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196555,196568] [2025-03-20 06:18:20,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/bounded_mpmc_check_full.i[196668,196681] [2025-03-20 06:18:20,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-20 06:18:21,151 INFO L204 MainTranslator]: Completed translation [2025-03-20 06:18:21,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21 WrapperNode [2025-03-20 06:18:21,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-20 06:18:21,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-20 06:18:21,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-20 06:18:21,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-20 06:18:21,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,222 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,267 INFO L138 Inliner]: procedures = 922, calls = 950, calls flagged for inlining = 815, calls inlined = 57, statements flattened = 625 [2025-03-20 06:18:21,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-20 06:18:21,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-20 06:18:21,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-20 06:18:21,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-20 06:18:21,276 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,309 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-20 06:18:21,337 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-20 06:18:21,337 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-20 06:18:21,337 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-20 06:18:21,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (1/1) ... [2025-03-20 06:18:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-20 06:18:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:18:21,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-20 06:18:21,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-20 06:18:21,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2025-03-20 06:18:21,389 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-03-20 06:18:21,389 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-03-20 06:18:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2025-03-20 06:18:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2025-03-20 06:18:21,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-20 06:18:21,391 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-20 06:18:21,551 INFO L234 CfgBuilder]: Building ICFG [2025-03-20 06:18:21,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-20 06:18:22,407 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-20 06:18:22,407 INFO L283 CfgBuilder]: Performing block encoding [2025-03-20 06:18:22,777 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-20 06:18:22,777 INFO L312 CfgBuilder]: Removed 20 assume(true) statements. [2025-03-20 06:18:22,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:18:22 BoogieIcfgContainer [2025-03-20 06:18:22,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-20 06:18:22,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-20 06:18:22,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-20 06:18:22,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-20 06:18:22,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 06:18:19" (1/3) ... [2025-03-20 06:18:22,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aef563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:18:22, skipping insertion in model container [2025-03-20 06:18:22,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 06:18:21" (2/3) ... [2025-03-20 06:18:22,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43aef563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 06:18:22, skipping insertion in model container [2025-03-20 06:18:22,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 06:18:22" (3/3) ... [2025-03-20 06:18:22,784 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_mpmc_check_full.i [2025-03-20 06:18:22,795 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-20 06:18:22,796 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-03-20 06:18:22,797 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-20 06:18:22,883 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-20 06:18:22,929 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:18:22,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-03-20 06:18:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:18:22,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-03-20 06:18:22,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-03-20 06:18:23,018 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 06:18:23,024 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 06:18:23,032 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;@5f9855af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:18:23,032 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-20 06:18:24,476 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-03-20 06:18:24,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:18:24,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1610699210, now seen corresponding path program 1 times [2025-03-20 06:18:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:18:24,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [725745287] [2025-03-20 06:18:24,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:18:24,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:18:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:18:24,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:18:24,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-20 06:18:24,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 06:18:31,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 06:18:31,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:18:31,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 06:18:31,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-20 06:18:31,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-20 06:18:38,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-20 06:18:38,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:18:38,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-20 06:18:38,893 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-20 06:18:38,894 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-20 06:18:38,895 INFO L791 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-03-20 06:18:38,896 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-03-20 06:18:38,897 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-03-20 06:18:38,897 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-20 06:18:38,897 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-20 06:18:38,897 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-20 06:18:38,897 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-20 06:18:38,897 INFO L791 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-20 06:18:38,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-20 06:18:39,098 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:18:39,102 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-20 06:18:39,104 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-20 06:18:39,104 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-20 06:18:39,160 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-20 06:18:39,165 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:18:39,199 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-03-20 06:18:39,199 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-03-20 06:18:39,200 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;@5f9855af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-20 06:18:39,200 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-20 06:18:44,423 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-03-20 06:18:44,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:18:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash 461241574, now seen corresponding path program 1 times [2025-03-20 06:18:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:18:44,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411513342] [2025-03-20 06:18:44,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:18:44,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:18:44,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:18:44,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:18:44,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-20 06:18:44,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-20 06:18:44,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-20 06:18:44,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:18:44,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:18:44,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-20 06:18:44,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:18:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:18:44,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:18:44,576 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:18:44,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411513342] [2025-03-20 06:18:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411513342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:18:44,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:18:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-20 06:18:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574023835] [2025-03-20 06:18:44,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:18:44,579 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-20 06:18:44,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:18:44,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-20 06:18:44,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-20 06:18:44,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:44,592 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:18:44,593 INFO L481 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-03-20 06:18:44,593 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:47,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:47,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-20 06:18:47,660 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:18:47,660 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-03-20 06:18:47,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:18:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 73229052, now seen corresponding path program 1 times [2025-03-20 06:18:47,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:18:47,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275105946] [2025-03-20 06:18:47,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:18:47,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:18:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:18:47,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:18:47,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-20 06:18:47,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-20 06:18:47,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-20 06:18:47,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:18:47,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:18:47,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 06:18:47,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:18:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:18:47,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:18:47,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:18:47,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275105946] [2025-03-20 06:18:47,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275105946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:18:47,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:18:47,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:18:47,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915544335] [2025-03-20 06:18:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:18:47,826 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:18:47,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:18:47,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:18:47,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:18:47,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:47,828 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:18:47,828 INFO L481 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-03-20 06:18:47,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:47,828 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:48,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:48,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:18:48,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-20 06:18:48,222 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:18:48,222 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-03-20 06:18:48,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:18:48,223 INFO L85 PathProgramCache]: Analyzing trace with hash -551822207, now seen corresponding path program 1 times [2025-03-20 06:18:48,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:18:48,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115235203] [2025-03-20 06:18:48,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:18:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:18:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:18:48,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:18:48,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-20 06:18:48,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-20 06:18:48,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-20 06:18:48,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:18:48,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:18:48,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-20 06:18:48,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:18:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:18:48,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:18:48,398 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:18:48,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115235203] [2025-03-20 06:18:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115235203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:18:48,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:18:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-20 06:18:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809214538] [2025-03-20 06:18:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:18:48,399 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-20 06:18:48,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:18:48,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-20 06:18:48,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-20 06:18:48,400 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:48,400 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:18:48,400 INFO L481 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-03-20 06:18:48,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:18:48,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:18:48,400 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:08,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:08,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:08,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:08,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-20 06:19:09,132 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:09,132 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-03-20 06:19:09,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 408823164, now seen corresponding path program 1 times [2025-03-20 06:19:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070614524] [2025-03-20 06:19:09,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:19:09,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:09,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:09,136 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:09,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-20 06:19:09,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-20 06:19:09,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-20 06:19:09,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:19:09,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:09,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 1116 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 06:19:09,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-20 06:19:09,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:09,512 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070614524] [2025-03-20 06:19:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070614524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:19:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786613337] [2025-03-20 06:19:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:09,513 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:19:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:09,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:19:09,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:19:09,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:09,519 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:09,519 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 06:19:09,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:09,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:09,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:09,519 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:25,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:25,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:25,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:25,525 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:25,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-20 06:19:25,726 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:25,726 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-03-20 06:19:25,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash 800125844, now seen corresponding path program 1 times [2025-03-20 06:19:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854934667] [2025-03-20 06:19:25,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:19:25,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:25,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:25,731 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:25,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-20 06:19:25,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-20 06:19:26,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-20 06:19:26,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:19:26,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:26,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 1232 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 06:19:26,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-20 06:19:26,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:26,157 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:26,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854934667] [2025-03-20 06:19:26,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854934667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:26,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:26,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:19:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607845886] [2025-03-20 06:19:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:26,158 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:19:26,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:26,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:19:26,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:19:26,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:26,161 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:26,161 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 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-03-20 06:19:26,161 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:26,161 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:26,161 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:26,161 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:26,161 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:26,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:26,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:26,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:26,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:26,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:26,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-20 06:19:27,014 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:27,015 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-03-20 06:19:27,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:27,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2059574604, now seen corresponding path program 1 times [2025-03-20 06:19:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:27,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207884483] [2025-03-20 06:19:27,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:19:27,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:27,019 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:27,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-20 06:19:27,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-20 06:19:27,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-20 06:19:27,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:19:27,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:27,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 06:19:27,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-20 06:19:27,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:27,497 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:27,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207884483] [2025-03-20 06:19:27,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207884483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:27,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:19:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839987401] [2025-03-20 06:19:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:27,497 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:19:27,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:27,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:19:27,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:19:27,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:27,498 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:27,498 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 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-03-20 06:19:27,498 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:27,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:27,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:27,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:27,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:27,499 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:29,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:29,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:29,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-20 06:19:29,396 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:29,397 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-20 06:19:29,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash 463928874, now seen corresponding path program 2 times [2025-03-20 06:19:29,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:29,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448052981] [2025-03-20 06:19:29,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 06:19:29,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:29,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:29,400 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:29,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-20 06:19:29,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 295 statements into 2 equivalence classes. [2025-03-20 06:19:29,756 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 141 of 295 statements. [2025-03-20 06:19:29,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:19:29,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:29,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 806 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-20 06:19:29,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:29,793 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-03-20 06:19:29,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:29,793 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:29,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448052981] [2025-03-20 06:19:29,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448052981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:29,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:29,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:19:29,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245165080] [2025-03-20 06:19:29,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:29,794 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:19:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:29,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:19:29,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:19:29,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:29,795 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:29,795 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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-03-20 06:19:29,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:29,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:29,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:29,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:30,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:30,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:30,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:30,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:30,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:30,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:30,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:30,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-20 06:19:30,367 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:30,368 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-03-20 06:19:30,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:30,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1498592830, now seen corresponding path program 1 times [2025-03-20 06:19:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6358415] [2025-03-20 06:19:30,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:19:30,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:30,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:30,370 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:30,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-20 06:19:30,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-20 06:19:30,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-20 06:19:30,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:19:30,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:30,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-20 06:19:30,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:30,984 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 7 treesize of output 3 [2025-03-20 06:19:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-20 06:19:31,007 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:31,007 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:31,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6358415] [2025-03-20 06:19:31,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6358415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:31,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:31,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-20 06:19:31,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955836909] [2025-03-20 06:19:31,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:31,008 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 06:19:31,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:31,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 06:19:31,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-20 06:19:31,008 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:31,009 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:31,009 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 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-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:31,009 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:33,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:33,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:33,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:33,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:33,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:33,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:33,788 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:33,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:33,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-20 06:19:33,989 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:33,989 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-03-20 06:19:33,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:33,990 INFO L85 PathProgramCache]: Analyzing trace with hash -776801026, now seen corresponding path program 1 times [2025-03-20 06:19:33,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:33,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [489161847] [2025-03-20 06:19:33,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:19:33,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:33,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:33,992 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:33,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-20 06:19:34,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-20 06:19:34,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-20 06:19:34,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:19:34,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:34,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-20 06:19:34,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:34,491 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 7 treesize of output 3 [2025-03-20 06:19:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-20 06:19:34,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:34,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:34,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489161847] [2025-03-20 06:19:34,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489161847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:34,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:34,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-20 06:19:34,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306414854] [2025-03-20 06:19:34,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:34,511 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-20 06:19:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:34,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-20 06:19:34,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-20 06:19:34,512 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:34,512 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:34,512 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 06:19:34,512 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:34,512 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:34,512 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:34,512 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:34,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:34,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:34,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:34,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:34,513 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:35,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:35,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:35,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-20 06:19:35,815 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:35,816 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-03-20 06:19:35,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1495700518, now seen corresponding path program 1 times [2025-03-20 06:19:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1824193879] [2025-03-20 06:19:35,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:19:35,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:35,819 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:35,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-20 06:19:36,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-20 06:19:36,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-20 06:19:36,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:19:36,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:36,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 1163 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-20 06:19:36,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:37,460 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:19:37,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 40 treesize of output 16 [2025-03-20 06:19:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-20 06:19:37,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:37,505 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824193879] [2025-03-20 06:19:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824193879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-20 06:19:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798737109] [2025-03-20 06:19:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:37,505 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-20 06:19:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:37,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-20 06:19:37,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-20 06:19:37,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:37,506 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:37,506 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.65) internal successors, (113), 19 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:37,506 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:45,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:45,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:45,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:45,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:45,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:45,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:45,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:45,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:45,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:45,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-20 06:19:45,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-20 06:19:46,105 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:46,106 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-03-20 06:19:46,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1902951616, now seen corresponding path program 1 times [2025-03-20 06:19:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:46,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1402948056] [2025-03-20 06:19:46,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:19:46,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:46,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:46,109 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:46,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-20 06:19:46,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-20 06:19:46,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-20 06:19:46,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:19:46,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:46,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-20 06:19:46,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:19:46,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:46,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:46,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402948056] [2025-03-20 06:19:46,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402948056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:46,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:46,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-20 06:19:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458780611] [2025-03-20 06:19:46,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:46,321 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-20 06:19:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:46,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-20 06:19:46,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-20 06:19:46,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:46,322 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:46,322 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-03-20 06:19:46,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:49,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-20 06:19:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:19:49,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-20 06:19:50,171 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:50,172 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-03-20 06:19:50,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash -843844180, now seen corresponding path program 2 times [2025-03-20 06:19:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [998028143] [2025-03-20 06:19:50,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 06:19:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:50,174 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:50,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-20 06:19:50,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 1 equivalence classes. [2025-03-20 06:19:50,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-20 06:19:50,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:19:50,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:50,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-20 06:19:50,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:19:50,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:50,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998028143] [2025-03-20 06:19:50,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998028143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:50,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:19:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198106347] [2025-03-20 06:19:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:50,603 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:19:50,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:50,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:19:50,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:19:50,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:50,603 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:50,603 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 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-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:50,603 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:50,604 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-03-20 06:19:50,604 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:19:50,604 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-03-20 06:19:51,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:19:51,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:51,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-20 06:19:51,244 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:51,244 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-03-20 06:19:51,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:19:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1294582369, now seen corresponding path program 3 times [2025-03-20 06:19:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:19:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327837807] [2025-03-20 06:19:51,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 06:19:51,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:19:51,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:19:51,247 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:19:51,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-20 06:19:51,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 140 statements into 2 equivalence classes. [2025-03-20 06:19:52,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 125 of 140 statements. [2025-03-20 06:19:52,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-20 06:19:52,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:19:52,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-20 06:19:52,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:19:52,456 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:19:52,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 40 treesize of output 16 [2025-03-20 06:19:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-20 06:19:52,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:19:52,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:19:52,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327837807] [2025-03-20 06:19:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327837807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:19:52,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:19:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-20 06:19:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351471486] [2025-03-20 06:19:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:19:52,491 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-20 06:19:52,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:19:52,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-20 06:19:52,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-20 06:19:52,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:52,491 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:19:52,491 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.285714285714286) internal successors, (102), 13 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-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:19:52,491 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2025-03-20 06:19:52,492 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:19:52,492 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:19:52,492 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:01,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:01,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:01,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-20 06:20:01,696 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:01,697 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-03-20 06:20:01,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash 236861697, now seen corresponding path program 1 times [2025-03-20 06:20:01,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:01,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270708765] [2025-03-20 06:20:01,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:20:01,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:01,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:01,700 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:01,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-20 06:20:01,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-20 06:20:02,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-20 06:20:02,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:20:02,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:20:02,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1423 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-20 06:20:02,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:20:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 99 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-20 06:20:02,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-20 06:20:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-20 06:20:02,600 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:20:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270708765] [2025-03-20 06:20:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270708765] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-20 06:20:02,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-20 06:20:02,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2025-03-20 06:20:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199381174] [2025-03-20 06:20:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:20:02,601 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-20 06:20:02,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:20:02,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-20 06:20:02,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-20 06:20:02,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:02,601 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:20:02,601 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 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-03-20 06:20:02,601 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:02,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:03,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:03,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:03,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-20 06:20:03,516 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:03,516 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-03-20 06:20:03,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:03,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1516617899, now seen corresponding path program 2 times [2025-03-20 06:20:03,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:03,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654870836] [2025-03-20 06:20:03,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 06:20:03,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:03,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:03,519 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:03,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-20 06:20:03,723 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 145 statements into 2 equivalence classes. [2025-03-20 06:20:03,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 145 statements. [2025-03-20 06:20:03,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:20:03,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:20:03,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-20 06:20:03,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:20:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-20 06:20:03,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:20:03,980 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:20:03,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654870836] [2025-03-20 06:20:03,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654870836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:20:03,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:20:03,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-20 06:20:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664279428] [2025-03-20 06:20:03,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:20:03,981 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-20 06:20:03,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:20:03,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-20 06:20:03,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-20 06:20:03,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:03,983 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:20:03,983 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 06:20:03,983 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:03,983 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,983 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:03,983 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,983 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:03,984 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:05,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:05,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:05,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-20 06:20:06,004 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:06,004 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-03-20 06:20:06,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash -245297150, now seen corresponding path program 4 times [2025-03-20 06:20:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1968679817] [2025-03-20 06:20:06,005 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 06:20:06,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:06,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:06,007 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:06,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-20 06:20:06,232 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 162 statements into 2 equivalence classes. [2025-03-20 06:20:06,308 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 131 of 162 statements. [2025-03-20 06:20:06,308 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-20 06:20:06,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:20:06,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-20 06:20:06,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:20:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:20:06,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:20:06,474 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:20:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968679817] [2025-03-20 06:20:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968679817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:20:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:20:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-20 06:20:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590342407] [2025-03-20 06:20:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:20:06,474 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-20 06:20:06,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:20:06,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-20 06:20:06,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-20 06:20:06,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:06,475 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:20:06,475 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 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-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:06,475 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:09,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:09,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:09,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:09,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:09,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:09,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:09,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:09,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:09,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-20 06:20:09,237 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:09,237 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-03-20 06:20:09,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2113608689, now seen corresponding path program 5 times [2025-03-20 06:20:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:09,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444784692] [2025-03-20 06:20:09,238 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-20 06:20:09,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:09,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:09,240 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:09,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-20 06:20:09,445 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 124 statements into 1 equivalence classes. [2025-03-20 06:20:10,042 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-20 06:20:10,042 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:20:10,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:20:10,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-03-20 06:20:10,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:20:10,413 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 8 treesize of output 1 [2025-03-20 06:20:10,673 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 27 treesize of output 18 [2025-03-20 06:20:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:20:11,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:20:11,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:20:11,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444784692] [2025-03-20 06:20:11,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444784692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:20:11,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:20:11,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-20 06:20:11,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470035459] [2025-03-20 06:20:11,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:20:11,001 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-20 06:20:11,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:20:11,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-20 06:20:11,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-20 06:20:11,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:11,002 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:20:11,002 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.647058823529412) internal successors, (113), 16 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:11,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:17,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:17,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-20 06:20:17,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-20 06:20:17,203 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:17,203 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-03-20 06:20:17,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash -78160636, now seen corresponding path program 1 times [2025-03-20 06:20:17,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:17,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063473529] [2025-03-20 06:20:17,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-20 06:20:17,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:17,206 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:17,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-20 06:20:17,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-20 06:20:17,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-20 06:20:17,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-20 06:20:17,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:20:17,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-20 06:20:17,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:20:18,257 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-20 06:20:18,257 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 40 treesize of output 16 [2025-03-20 06:20:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-20 06:20:18,293 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:20:18,293 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:20:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063473529] [2025-03-20 06:20:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063473529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:20:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:20:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-20 06:20:18,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710879938] [2025-03-20 06:20:18,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:20:18,293 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-20 06:20:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:20:18,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-20 06:20:18,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-20 06:20:18,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:18,294 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:20:18,294 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 13 states have internal predecessors, (98), 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-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-03-20 06:20:18,294 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:24,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:24,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:24,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:24,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:24,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:24,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:24,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-20 06:20:24,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-20 06:20:24,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-20 06:20:24,578 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:24,579 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-03-20 06:20:24,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:24,579 INFO L85 PathProgramCache]: Analyzing trace with hash -617917164, now seen corresponding path program 2 times [2025-03-20 06:20:24,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:24,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936515837] [2025-03-20 06:20:24,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-20 06:20:24,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:24,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:24,581 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:24,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-20 06:20:24,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-03-20 06:20:25,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 101 of 132 statements. [2025-03-20 06:20:25,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-20 06:20:25,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:20:25,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-20 06:20:25,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:20:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 06:20:25,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:20:25,794 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:20:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936515837] [2025-03-20 06:20:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936515837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:20:25,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:20:25,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-20 06:20:25,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013942372] [2025-03-20 06:20:25,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:20:25,795 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-20 06:20:25,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:20:25,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-20 06:20:25,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-20 06:20:25,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:25,795 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:20:25,795 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 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-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2025-03-20 06:20:25,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-20 06:20:31,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-20 06:20:31,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-20 06:20:31,397 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:31,397 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-03-20 06:20:31,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:31,397 INFO L85 PathProgramCache]: Analyzing trace with hash 176072640, now seen corresponding path program 3 times [2025-03-20 06:20:31,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:31,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59783425] [2025-03-20 06:20:31,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-20 06:20:31,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:31,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:31,400 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:31,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-20 06:20:31,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 132 statements into 2 equivalence classes. [2025-03-20 06:20:32,096 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 101 of 132 statements. [2025-03-20 06:20:32,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-20 06:20:32,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-20 06:20:32,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-20 06:20:32,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-20 06:20:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-20 06:20:32,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-20 06:20:32,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-20 06:20:32,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59783425] [2025-03-20 06:20:32,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59783425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-20 06:20:32,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-20 06:20:32,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-20 06:20:32,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021611329] [2025-03-20 06:20:32,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-20 06:20:32,554 INFO L557 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-20 06:20:32,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-20 06:20:32,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-20 06:20:32,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-20 06:20:32,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:32,556 INFO L480 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-03-20 06:20:32,556 INFO L481 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.571428571428571) internal successors, (92), 13 states have internal predecessors, (92), 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-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2025-03-20 06:20:32,556 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-20 06:20:38,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-20 06:20:38,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-20 06:20:38,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-20 06:20:38,269 WARN L461 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:38,269 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-03-20 06:20:38,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-03-20 06:20:38,270 INFO L85 PathProgramCache]: Analyzing trace with hash -357614760, now seen corresponding path program 4 times [2025-03-20 06:20:38,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-20 06:20:38,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926273045] [2025-03-20 06:20:38,270 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-20 06:20:38,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-20 06:20:38,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-03-20 06:20:38,272 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-20 06:20:38,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-20 06:20:38,506 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 132 statements into 2 equivalence classes. Killed by 15