/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/libvsync/hclhlock.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 16:55:45,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 16:55:45,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 16:55:45,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 16:55:45,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 16:55:45,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 16:55:45,998 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 16:55:45,998 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 16:55:45,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 16:55:45,998 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 16:55:45,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 16:55:45,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 16:55:45,998 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 16:55:45,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 16:55:45,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 16:55:45,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 16:55:45,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 16:55:45,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:55:45,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:55:45,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:55:46,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 16:55:46,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 16:55:46,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 16:55:46,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 16:55:46,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 16:55:46,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 16:55:46,219 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 16:55:46,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/libvsync/hclhlock.i [2025-04-14 16:55:47,469 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef81ef2a/10721a7faa084142a2118b9c8d65cd95/FLAGf9014fc58 [2025-04-14 16:55:47,820 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 16:55:47,820 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i [2025-04-14 16:55:47,859 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef81ef2a/10721a7faa084142a2118b9c8d65cd95/FLAGf9014fc58 [2025-04-14 16:55:48,520 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ef81ef2a/10721a7faa084142a2118b9c8d65cd95 [2025-04-14 16:55:48,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 16:55:48,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 16:55:48,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 16:55:48,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 16:55:48,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 16:55:48,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:55:48" (1/1) ... [2025-04-14 16:55:48,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa07477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:48, skipping insertion in model container [2025-04-14 16:55:48,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:55:48" (1/1) ... [2025-04-14 16:55:48,582 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 16:55:49,788 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172094,172107] [2025-04-14 16:55:49,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172145,172158] [2025-04-14 16:55:49,789 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172202,172215] [2025-04-14 16:55:49,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172763,172776] [2025-04-14 16:55:49,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172814,172827] [2025-04-14 16:55:49,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174060,174073] [2025-04-14 16:55:49,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174118,174131] [2025-04-14 16:55:49,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174622,174635] [2025-04-14 16:55:49,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174679,174692] [2025-04-14 16:55:49,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174746,174759] [2025-04-14 16:55:49,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[175274,175287] [2025-04-14 16:55:49,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[175341,175354] [2025-04-14 16:55:49,811 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[175944,175957] [2025-04-14 16:55:49,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[198494,198507] [2025-04-14 16:55:49,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[198561,198574] [2025-04-14 16:55:49,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:55:49,994 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 16:55:50,092 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-04-14 16:55:50,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-04-14 16:55:50,094 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-04-14 16:55:50,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-04-14 16:55:50,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-04-14 16:55:50,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-04-14 16:55:50,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-04-14 16:55:50,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-04-14 16:55:50,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-04-14 16:55:50,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-04-14 16:55:50,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-04-14 16:55:50,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-04-14 16:55:50,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-04-14 16:55:50,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-04-14 16:55:50,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-04-14 16:55:50,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-04-14 16:55:50,097 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-04-14 16:55:50,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-04-14 16:55:50,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-04-14 16:55:50,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-04-14 16:55:50,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-04-14 16:55:50,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-04-14 16:55:50,098 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-04-14 16:55:50,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-04-14 16:55:50,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-04-14 16:55:50,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-04-14 16:55:50,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-04-14 16:55:50,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-04-14 16:55:50,099 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-04-14 16:55:50,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-04-14 16:55:50,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-04-14 16:55:50,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-04-14 16:55:50,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-04-14 16:55:50,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-04-14 16:55:50,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-04-14 16:55:50,101 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-04-14 16:55:50,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-04-14 16:55:50,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-04-14 16:55:50,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-04-14 16:55:50,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-04-14 16:55:50,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-04-14 16:55:50,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-04-14 16:55:50,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-04-14 16:55:50,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-04-14 16:55:50,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-04-14 16:55:50,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-04-14 16:55:50,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-04-14 16:55:50,104 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-04-14 16:55:50,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-04-14 16:55:50,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-04-14 16:55:50,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-04-14 16:55:50,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-04-14 16:55:50,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-04-14 16:55:50,106 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-04-14 16:55:50,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-04-14 16:55:50,107 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-04-14 16:55:50,108 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-04-14 16:55:50,108 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-04-14 16:55:50,108 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-04-14 16:55:50,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-04-14 16:55:50,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-04-14 16:55:50,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-04-14 16:55:50,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-04-14 16:55:50,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-04-14 16:55:50,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-04-14 16:55:50,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-04-14 16:55:50,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-04-14 16:55:50,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-04-14 16:55:50,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-04-14 16:55:50,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-04-14 16:55:50,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-04-14 16:55:50,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-04-14 16:55:50,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-04-14 16:55:50,114 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-04-14 16:55:50,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-04-14 16:55:50,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-04-14 16:55:50,115 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-04-14 16:55:50,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-04-14 16:55:50,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-04-14 16:55:50,116 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-04-14 16:55:50,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-04-14 16:55:50,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-04-14 16:55:50,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-04-14 16:55:50,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-04-14 16:55:50,117 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-04-14 16:55:50,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-04-14 16:55:50,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-04-14 16:55:50,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-04-14 16:55:50,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-04-14 16:55:50,118 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-04-14 16:55:50,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-04-14 16:55:50,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-04-14 16:55:50,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-04-14 16:55:50,119 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-04-14 16:55:50,121 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-04-14 16:55:50,122 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-04-14 16:55:50,122 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-04-14 16:55:50,122 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-04-14 16:55:50,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-04-14 16:55:50,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-04-14 16:55:50,167 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172094,172107] [2025-04-14 16:55:50,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172145,172158] [2025-04-14 16:55:50,168 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172202,172215] [2025-04-14 16:55:50,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172763,172776] [2025-04-14 16:55:50,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[172814,172827] [2025-04-14 16:55:50,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174060,174073] [2025-04-14 16:55:50,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174118,174131] [2025-04-14 16:55:50,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174622,174635] [2025-04-14 16:55:50,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174679,174692] [2025-04-14 16:55:50,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[174746,174759] [2025-04-14 16:55:50,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[175274,175287] [2025-04-14 16:55:50,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[175341,175354] [2025-04-14 16:55:50,181 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[175944,175957] [2025-04-14 16:55:50,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[198494,198507] [2025-04-14 16:55:50,193 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/libvsync/hclhlock.i[198561,198574] [2025-04-14 16:55:50,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:55:50,378 INFO L204 MainTranslator]: Completed translation [2025-04-14 16:55:50,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50 WrapperNode [2025-04-14 16:55:50,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 16:55:50,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 16:55:50,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 16:55:50,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 16:55:50,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,479 INFO L138 Inliner]: procedures = 921, calls = 957, calls flagged for inlining = 833, calls inlined = 67, statements flattened = 799 [2025-04-14 16:55:50,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 16:55:50,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 16:55:50,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 16:55:50,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 16:55:50,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 16:55:50,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 16:55:50,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 16:55:50,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 16:55:50,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (1/1) ... [2025-04-14 16:55:50,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:55:50,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:50,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 16:55:50,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 16:55:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-04-14 16:55:50,576 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 16:55:50,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 16:55:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 16:55:50,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 16:55:50,579 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 16:55:50,726 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 16:55:50,727 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 16:55:51,038 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-04-14 16:55:51,038 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-04-14 16:55:51,515 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-10: havoc vatomic32_read_rlx_#t~ret112#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-20: havoc vatomic32_read_rlx_#t~ret112#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-30: havoc vatomic32_read_rlx_#t~ret112#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-10: havoc vatomic32_read_acq_#t~ret113#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-10: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-04-14 16:55:51,516 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-04-14 16:55:51,517 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 16:55:51,517 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 16:55:51,875 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 16:55:51,875 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 16:55:51,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:55:51 BoogieIcfgContainer [2025-04-14 16:55:51,875 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 16:55:51,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 16:55:51,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 16:55:51,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 16:55:51,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:55:48" (1/3) ... [2025-04-14 16:55:51,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132bb5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:55:51, skipping insertion in model container [2025-04-14 16:55:51,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:55:50" (2/3) ... [2025-04-14 16:55:51,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132bb5a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:55:51, skipping insertion in model container [2025-04-14 16:55:51,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:55:51" (3/3) ... [2025-04-14 16:55:51,883 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-04-14 16:55:51,894 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 16:55:51,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 225 locations, 364 edges, 1 initial locations, 42 loop locations, and 17 error locations. [2025-04-14 16:55:51,896 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 16:55:52,058 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 16:55:52,098 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:52,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 16:55:52,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:52,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 16:55:52,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 16:55:52,213 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:55:52,224 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == runThread1of1ForFork0 ======== [2025-04-14 16:55:52,229 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;@3a483b52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:55:52,229 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-14 16:55:52,461 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:52,461 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:52,462 INFO L139 ounterexampleChecker]: Examining path program with hash 1451364945, occurence #1 [2025-04-14 16:55:52,462 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:52,462 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:52,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1548152014, now seen corresponding path program 1 times [2025-04-14 16:55:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:52,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919783816] [2025-04-14 16:55:52,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:52,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-14 16:55:52,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-14 16:55:52,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:52,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:55:52,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:52,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919783816] [2025-04-14 16:55:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919783816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:52,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:52,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:55:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648577470] [2025-04-14 16:55:52,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:52,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:55:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:52,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:55:52,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:55:52,699 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:52,700 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:52,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:52,700 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:52,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:52,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 16:55:52,882 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting runErr5ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:52,882 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:52,882 INFO L139 ounterexampleChecker]: Examining path program with hash 909486329, occurence #1 [2025-04-14 16:55:52,882 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:52,882 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:52,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash -250088678, now seen corresponding path program 1 times [2025-04-14 16:55:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:52,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400572573] [2025-04-14 16:55:52,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:52,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-14 16:55:52,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-14 16:55:52,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:52,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:55:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:52,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400572573] [2025-04-14 16:55:52,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400572573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:52,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:52,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:52,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782926486] [2025-04-14 16:55:52,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:52,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:52,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:52,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:52,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:52,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:52,992 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:52,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:52,992 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:52,992 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:53,037 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 16:55:53,038 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting runErr10ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:53,038 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:53,038 INFO L139 ounterexampleChecker]: Examining path program with hash 1816801666, occurence #1 [2025-04-14 16:55:53,038 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:53,038 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:53,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:53,038 INFO L85 PathProgramCache]: Analyzing trace with hash 691321377, now seen corresponding path program 1 times [2025-04-14 16:55:53,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:53,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300459422] [2025-04-14 16:55:53,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:53,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:53,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 16:55:53,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 16:55:53,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:53,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:55:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:53,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300459422] [2025-04-14 16:55:53,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300459422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:53,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:53,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:53,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605472671] [2025-04-14 16:55:53,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:53,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:55:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:53,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:55:53,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:55:53,219 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,219 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:53,220 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:53,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:53,220 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:53,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,279 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 16:55:53,279 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting runErr9ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:53,279 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:53,279 INFO L139 ounterexampleChecker]: Examining path program with hash -881815066, occurence #1 [2025-04-14 16:55:53,279 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:53,279 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:53,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:53,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1359985688, now seen corresponding path program 1 times [2025-04-14 16:55:53,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:53,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192736096] [2025-04-14 16:55:53,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:53,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-14 16:55:53,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 16:55:53,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:53,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:55:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:53,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192736096] [2025-04-14 16:55:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192736096] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711591793] [2025-04-14 16:55:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:53,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:55:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:53,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:55:53,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:55:53,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,412 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:53,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:53,412 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,412 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:53,412 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,412 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:53,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 16:55:53,607 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting runErr5ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:53,607 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:53,608 INFO L139 ounterexampleChecker]: Examining path program with hash -1904589753, occurence #1 [2025-04-14 16:55:53,608 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:53,608 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:53,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash 954869558, now seen corresponding path program 1 times [2025-04-14 16:55:53,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:53,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309550430] [2025-04-14 16:55:53,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:53,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-04-14 16:55:53,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-04-14 16:55:53,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:53,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:55:53,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:53,819 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309550430] [2025-04-14 16:55:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309550430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701574354] [2025-04-14 16:55:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:53,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:55:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:55:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:55:53,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,820 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:53,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:53,820 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,820 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:53,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,821 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:53,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:53,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,919 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:53,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 16:55:53,919 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting runErr4ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:53,919 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:53,919 INFO L139 ounterexampleChecker]: Examining path program with hash 949196268, occurence #1 [2025-04-14 16:55:53,919 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:53,919 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:53,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash 953779698, now seen corresponding path program 1 times [2025-04-14 16:55:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:53,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560948894] [2025-04-14 16:55:53,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:53,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-14 16:55:53,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-14 16:55:53,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:53,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:55:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:54,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560948894] [2025-04-14 16:55:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560948894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:54,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:54,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:54,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152952660] [2025-04-14 16:55:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:54,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:54,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:54,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:54,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:54,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,071 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:54,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:54,071 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,072 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,072 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,072 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,072 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,072 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 16:55:54,174 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting runErr4ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:54,174 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:54,174 INFO L139 ounterexampleChecker]: Examining path program with hash 393229931, occurence #1 [2025-04-14 16:55:54,174 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:54,175 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:54,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 456162571, now seen corresponding path program 1 times [2025-04-14 16:55:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:54,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044269961] [2025-04-14 16:55:54,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:54,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-14 16:55:54,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-14 16:55:54,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:54,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:55:54,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:54,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044269961] [2025-04-14 16:55:54,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044269961] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:55:54,311 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832446229] [2025-04-14 16:55:54,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:54,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:55:54,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:54,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:55:54,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 16:55:54,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-14 16:55:54,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-14 16:55:54,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:54,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:54,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 16:55:54,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:55:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:55:54,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:55:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 16:55:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832446229] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 16:55:54,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:55:54,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-04-14 16:55:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518174153] [2025-04-14 16:55:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:54,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:54,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:54,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-14 16:55:54,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,559 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:54,559 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:54,559 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,559 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,559 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,559 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,559 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,559 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,559 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:54,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:54,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:54,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 16:55:54,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-14 16:55:54,949 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting runErr4ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:54,949 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:54,949 INFO L139 ounterexampleChecker]: Examining path program with hash 1982565916, occurence #1 [2025-04-14 16:55:54,949 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:54,949 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:54,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1264951612, now seen corresponding path program 1 times [2025-04-14 16:55:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:54,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643530519] [2025-04-14 16:55:54,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:54,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-14 16:55:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-14 16:55:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:54,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 16:55:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:55,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643530519] [2025-04-14 16:55:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643530519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:55:55,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817904674] [2025-04-14 16:55:55,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:55,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:55:55,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:55,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:55:55,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 16:55:55,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-04-14 16:55:55,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-04-14 16:55:55,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:55,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:55,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 16:55:55,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:55:55,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 16:55:55,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:55:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 16:55:55,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817904674] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:55:55,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:55:55,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 10 [2025-04-14 16:55:55,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513663301] [2025-04-14 16:55:55,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:55:55,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 16:55:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:55,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 16:55:55,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-14 16:55:55,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:55,484 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:55,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.0) internal successors, (150), 10 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:55,484 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:55,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:55,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:55,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:55,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:55,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:55,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:55,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:55,783 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:55:55,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 16:55:55,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:55:55,984 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting runErr4ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:55,984 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:55,985 INFO L139 ounterexampleChecker]: Examining path program with hash 1982565916, occurence #2 [2025-04-14 16:55:55,985 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:55:55,985 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 16:55:55,985 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,985 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 16:55:55,985 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,985 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 16:55:55,985 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 23 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,986 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 16:55:55,986 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 39 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 46 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 49 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 50 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 52 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 55 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 57 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 59 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 60 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 63 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 66 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,987 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 69 [2025-04-14 16:55:55,987 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 70 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 72 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 74 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 75 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 76 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 78 [2025-04-14 16:55:55,988 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 82 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 103 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 111 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 121 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 122 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 124 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 127 [2025-04-14 16:55:55,988 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:55,988 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:55:55,989 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:55,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash -924407683, now seen corresponding path program 2 times [2025-04-14 16:55:55,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:55,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645626282] [2025-04-14 16:55:55,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:55:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:56,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 136 statements into 2 equivalence classes. [2025-04-14 16:55:56,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-04-14 16:55:56,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:55:56,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:56,461 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-04-14 16:55:56,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:56,462 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645626282] [2025-04-14 16:55:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645626282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:56,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:56,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:55:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237348808] [2025-04-14 16:55:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:56,462 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:55:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:56,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:55:56,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:55:56,463 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:56,463 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:56,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:55:56,463 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:55:56,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:56,547 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 16:55:56,547 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting runErr4ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:56,548 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:56,549 INFO L139 ounterexampleChecker]: Examining path program with hash 467527306, occurence #1 [2025-04-14 16:55:56,549 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:55:56,549 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:56,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash -299012497, now seen corresponding path program 1 times [2025-04-14 16:55:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:56,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96741519] [2025-04-14 16:55:56,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:56,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-04-14 16:55:56,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-04-14 16:55:56,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:56,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-04-14 16:55:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:57,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96741519] [2025-04-14 16:55:57,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96741519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:55:57,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:55:57,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 16:55:57,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509721725] [2025-04-14 16:55:57,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:55:57,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 16:55:57,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:55:57,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 16:55:57,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 16:55:57,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:57,109 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:55:57,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:55:57,109 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:55:57,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:55:57,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 16:55:57,310 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting runErr4ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:55:57,310 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:55:57,310 INFO L139 ounterexampleChecker]: Examining path program with hash 467527306, occurence #2 [2025-04-14 16:55:57,310 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:55:57,310 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 16:55:57,310 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,310 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 16:55:57,310 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,310 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 16:55:57,310 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,310 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 16:55:57,310 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,310 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:55:57,310 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,310 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 16:55:57,310 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,310 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 36 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 44 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 46 [2025-04-14 16:55:57,311 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,311 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 49 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 51 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 54 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 58 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 61 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 62 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 64 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 66 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 67 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 68 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 70 [2025-04-14 16:55:57,312 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 74 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 81 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 95 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,312 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 103 [2025-04-14 16:55:57,312 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,313 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 113 [2025-04-14 16:55:57,313 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,313 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 114 [2025-04-14 16:55:57,313 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,313 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 116 [2025-04-14 16:55:57,313 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,313 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 119 [2025-04-14 16:55:57,313 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:55:57,313 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:55:57,313 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:55:57,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:55:57,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1888496594, now seen corresponding path program 1 times [2025-04-14 16:55:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:55:57,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314995671] [2025-04-14 16:55:57,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:55:57,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-14 16:55:57,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-14 16:55:57,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:57,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 42 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 16:55:57,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:55:57,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314995671] [2025-04-14 16:55:57,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314995671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:55:57,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882462130] [2025-04-14 16:55:57,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:55:57,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:55:57,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:55:57,888 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:55:57,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 16:55:58,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-04-14 16:55:58,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-04-14 16:55:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:55:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:55:58,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 247 conjuncts are in the unsatisfiable core [2025-04-14 16:55:58,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:55:58,272 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-14 16:55:58,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-14 16:55:58,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-04-14 16:55:59,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,307 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 16:55:59,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,349 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2025-04-14 16:55:59,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,896 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 39 treesize of output 28 [2025-04-14 16:55:59,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:55:59,991 INFO L325 Elim1Store]: treesize reduction 79, result has 28.8 percent of original size [2025-04-14 16:55:59,991 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 65 [2025-04-14 16:56:00,174 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 16:56:00,436 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 16:56:01,061 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-04-14 16:56:01,066 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-04-14 16:56:01,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:01,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:01,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-04-14 16:56:01,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:01,736 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-14 16:56:01,736 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2025-04-14 16:56:02,077 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 67 treesize of output 55 [2025-04-14 16:56:02,401 INFO L325 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2025-04-14 16:56:02,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 83 [2025-04-14 16:56:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:56:02,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:56:05,279 WARN L849 $PredicateComparison]: unable to prove that (or (and (= |c_runThread1of1ForFork0_~j~0#1| 0) (<= (mod (+ |c_runThread1of1ForFork0_~tid~0#1| 1) 4294967296) 0)) (let ((.cse12 (mod |c_runThread1of1ForFork0_~tid~0#1| 4294967296))) (let ((.cse13 (* .cse12 8))) (let ((.cse6 (< 2147483647 .cse12)) (.cse5 (+ |c_~#tnode~0.offset| 4 .cse13)) (.cse3 (select |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.base|)) (.cse9 (+ |c_~#tnode~0.offset| (- 34359738364) .cse13)) (.cse7 (< .cse12 2147483648)) (.cse1 (= 0 |c_runThread1of1ForFork0_hclhlock_acquire_~pred~0#1.offset|)) (.cse0 (= |c_runThread1of1ForFork0_hclhlock_acquire_~pred~0#1.base| 0))) (and (or (not .cse0) (not .cse1) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) (+ |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| 4)))) (and (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_prenex_5 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int))) (or (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= (select (select (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.base| (store .cse3 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse4)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse4 v_prenex_4))) (store .cse2 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse2 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_prenex_5))) |c_~#tnode~0.base|) .cse5) 0)))) .cse6) (or .cse7 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_923 (Array Int Int)) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_ArrVal_924 Int)) (or (not (= (select (select (let ((.cse8 (store (store (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.base| (store .cse3 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse4)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse4 v_ArrVal_923))) (store .cse8 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse8 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_ArrVal_924))) |c_~#tnode~0.base|) .cse9) 0)) (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|))))))) (or (and (or .cse6 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_prenex_5 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) (select .cse3 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset|) v_prenex_4))) (store .cse10 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse10 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_prenex_5))) |c_~#tnode~0.base|) .cse5) 0)) (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|)))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_923 (Array Int Int)) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_ArrVal_924 Int)) (or (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) (select .cse3 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset|) v_ArrVal_923))) (store .cse11 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse11 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_ArrVal_924))) |c_~#tnode~0.base|) .cse9) 0)) (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|))) .cse7)) (and .cse1 .cse0))))))) is different from false [2025-04-14 16:56:05,349 WARN L849 $PredicateComparison]: unable to prove that (or (and (= |c_runThread1of1ForFork0_~j~0#1| 0) (<= (mod (+ |c_runThread1of1ForFork0_~tid~0#1| 1) 4294967296) 0)) (let ((.cse12 (mod |c_runThread1of1ForFork0_~tid~0#1| 4294967296))) (let ((.cse13 (* .cse12 8))) (let ((.cse1 (= 0 |c_runThread1of1ForFork0_hclhlock_acquire_~pred~0#1.offset|)) (.cse0 (= |c_runThread1of1ForFork0_hclhlock_acquire_~pred~0#1.base| 0)) (.cse7 (< .cse12 2147483648)) (.cse9 (+ |c_~#tnode~0.offset| (- 34359738364) .cse13)) (.cse4 (select |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base|)) (.cse6 (+ |c_~#tnode~0.offset| 4 .cse13)) (.cse2 (< 2147483647 .cse12))) (and (or (not .cse0) (not .cse1) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) (+ |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| 4)))) (and (or .cse2 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_prenex_5 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int))) (or (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= (select (select (let ((.cse3 (store (store (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| (store .cse4 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse5)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse5 v_prenex_4))) (store .cse3 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse3 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_prenex_5))) |c_~#tnode~0.base|) .cse6) 0))))) (or .cse7 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_923 (Array Int Int)) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_ArrVal_924 Int)) (or (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= 0 (select (select (let ((.cse8 (store (store (store |c_#memory_$Pointer$.base| |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| (store .cse4 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse5)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse5 v_ArrVal_923))) (store .cse8 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse8 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_ArrVal_924))) |c_~#tnode~0.base|) .cse9))))))))) (or (and .cse1 .cse0) (and (or .cse7 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_923 (Array Int Int)) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_ArrVal_924 Int)) (or (not (= (select (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) (select .cse4 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset|) v_ArrVal_923))) (store .cse10 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse10 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_ArrVal_924))) |c_~#tnode~0.base|) .cse9) 0)) (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|)))) (or (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_prenex_5 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int))) (or (not (= (select (select (let ((.cse11 (store (store |c_#memory_$Pointer$.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) (select .cse4 |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset|) v_prenex_4))) (store .cse11 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base| (store (select .cse11 |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.base|) |c_runThread1of1ForFork0_hclhlock_acquire_~tnode#1.offset| v_prenex_5))) |c_~#tnode~0.base|) .cse6) 0)) (< |c_runThread1of1ForFork0_hclhlock_acquire_~lock#1.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|))) .cse2)))))))) is different from false [2025-04-14 16:56:06,758 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_916 (Array Int Int)) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int))) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= (let ((.cse2 (+ |c_~#tnode~0.offset| 4))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse1 (select (select .cse0 |c_~#tnode~0.base|) .cse2))) (store (store (store .cse0 |c_~#lock~0.base| (store (select .cse0 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse1)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse1 v_prenex_4))) |c_~#tnode~0.base|) .cse2)) 0)))) is different from false [2025-04-14 16:56:06,788 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int))) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= (let ((.cse2 (+ |c_~#tnode~0.offset| 4))) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) (+ |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 4) v_ArrVal_913) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse1 (select (select .cse0 |c_~#tnode~0.base|) .cse2))) (store (store (store .cse0 |c_~#lock~0.base| (store (select .cse0 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse1)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse1 v_prenex_4))) |c_~#tnode~0.base|) .cse2)) 0)))) is different from false [2025-04-14 16:56:06,800 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int))) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= (let ((.cse2 (+ |c_~#tnode~0.offset| 4))) (select (select (let ((.cse0 (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_~a#1.base| v_ArrVal_912))) (store .cse3 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select .cse3 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) (+ |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 4) v_ArrVal_913) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse1 (select (select .cse0 |c_~#tnode~0.base|) .cse2))) (store (store (store .cse0 |c_~#lock~0.base| (store (select .cse0 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse1)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse1 v_prenex_4))) |c_~#tnode~0.base|) .cse2)) 0)))) is different from false [2025-04-14 16:56:06,845 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_vatomic32_write_~a#1.base_58| Int)) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= (let ((.cse2 (+ |c_~#tnode~0.offset| 4))) (select (select (let ((.cse0 (store (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| v_ArrVal_912))) (store .cse3 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select .cse3 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) (+ |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 4) v_ArrVal_913) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse1 (select (select .cse0 |c_~#tnode~0.base|) .cse2))) (store (store (store .cse0 |c_~#lock~0.base| (store (select .cse0 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse1)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse1 v_prenex_4))) |c_~#tnode~0.base|) .cse2)) 0)) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.base|))) is different from false [2025-04-14 16:56:09,227 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:09,228 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 368 treesize of output 231 [2025-04-14 16:56:09,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:09,456 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 656855 treesize of output 654075 [2025-04-14 16:56:10,811 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:10,813 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:10,823 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 17408 treesize of output 16960 [2025-04-14 16:56:11,525 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:11,525 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:11,530 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 11976 treesize of output 11544 [2025-04-14 16:56:11,700 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 11856 treesize of output 11128 [2025-04-14 16:56:12,016 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 11104 treesize of output 10280 [2025-04-14 16:56:12,190 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 10280 treesize of output 9864 [2025-04-14 16:56:15,642 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 15 treesize of output 9 [2025-04-14 16:56:16,480 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:16,481 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:16,508 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:16,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1074 treesize of output 1014 [2025-04-14 16:56:17,733 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 6 refuted. 18 times theorem prover too weak. 0 trivial. 35 not checked. [2025-04-14 16:56:17,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882462130] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:56:17,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:56:17,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 39, 40] total 86 [2025-04-14 16:56:17,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344470303] [2025-04-14 16:56:17,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:56:17,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2025-04-14 16:56:17,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:17,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2025-04-14 16:56:17,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=5813, Unknown=78, NotChecked=966, Total=7310 [2025-04-14 16:56:17,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:17,738 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:17,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 4.395348837209302) internal successors, (378), 86 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:56:17,738 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,351 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-04-14 16:56:25,954 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse21 (+ |c_ULTIMATE.start_init_~i~4#1| 1))) (let ((.cse25 (mod |c_ULTIMATE.start_init_~i~4#1| 4294967296)) (.cse12 (mod .cse21 4294967296))) (let ((.cse0 (< 2 .cse12)) (.cse1 (+ |c_~#tnode~0.offset| (* .cse12 8))) (.cse13 (< 2 .cse25)) (.cse17 (+ |c_~#tnode~0.offset| (* .cse25 8))) (.cse6 (+ |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 4)) (.cse4 (+ |c_~#tnode~0.offset| 4)) (.cse7 (select |c_#memory_$Pointer$.base| 4))) (and (= 4 |c_~#tnode~0.base|) (or .cse0 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| Int) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_vatomic32_write_~a#1.base_58| Int)) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (< |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| .cse1) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| |c_~#qnode~0.base|) (not (= (select (select (let ((.cse2 (store (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) .cse6 |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.base|) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0)) |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| v_ArrVal_912))) (store .cse5 |c_~#tnode~0.base| (store (store (select .cse5 |c_~#tnode~0.base|) (+ 4 |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46|) v_ArrVal_913) |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse3 (select (select .cse2 |c_~#tnode~0.base|) .cse4))) (store (store (store .cse2 |c_~#lock~0.base| (store (select .cse2 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse3)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse3 v_prenex_4))) |c_~#tnode~0.base|) .cse4) 0))))) (= |c_~#tnode~0.offset| 0) (= |c_~#qnode~0.offset| 0) (= (select .cse7 4) 5) (or (forall ((|v_ULTIMATE.start_vatomic32_write_~a#1.base_60| Int) (v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| Int) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_909 (Array Int Int)) (|v_ULTIMATE.start_vatomic32_write_~a#1.base_58| Int)) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (< |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| .cse1) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| |c_~#qnode~0.base|) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_60| |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.base|) (not (= (select (select (let ((.cse8 (store (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_vatomic32_write_~a#1.base_60| v_ArrVal_909))) (store .cse11 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select .cse11 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) .cse6 |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.base|) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0))) |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| v_ArrVal_912))) (store .cse10 |c_~#tnode~0.base| (store (store (select .cse10 |c_~#tnode~0.base|) (+ 4 |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46|) v_ArrVal_913) |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse9 (select (select .cse8 |c_~#tnode~0.base|) .cse4))) (store (store (store .cse8 |c_~#lock~0.base| (store (select .cse8 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse9)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse9 v_prenex_4))) |c_~#tnode~0.base|) .cse4) 0)))) .cse0) (= |c_~#qnode~0.base| 5) (or .cse0 (< 2 (mod (+ 2 |c_ULTIMATE.start_init_~i~4#1|) 4294967296)) (and (= |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| |c_~#tnode~0.base|) (not (= |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.base| |c_~#tnode~0.base|)) (<= (+ 1 |c_~#tnode~0.base|) |c_~#qnode~0.base|) (not (= |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.base| 0)) (= |c_~#tnode~0.offset| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset|) (<= 1 .cse12) (<= (+ |c_~#lock~0.base| 1) |c_~#tnode~0.base|) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| |c_~#tnode~0.base|)))) (or .cse13 .cse0 (forall ((|v_ULTIMATE.start_vatomic32_write_~a#1.base_60| Int) (v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| Int) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (|v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_47| Int) (v_prenex_4 (Array Int Int)) (v_ArrVal_909 (Array Int Int)) (|v_ULTIMATE.start_vatomic32_write_~a#1.base_58| Int)) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (< |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| .cse1) (not (= (select (select (let ((.cse14 (store (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_vatomic32_write_~a#1.base_60| v_ArrVal_909))) (store (store .cse16 |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| v_ArrVal_912) |c_~#tnode~0.base| (store (store (select (store (store .cse16 |c_~#tnode~0.base| (store (store (select .cse16 |c_~#tnode~0.base|) (+ 4 |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_47|) |c_~#qnode~0.base|) |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_47| 0)) |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| v_ArrVal_912) |c_~#tnode~0.base|) (+ 4 |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46|) v_ArrVal_913) |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse15 (select (select .cse14 |c_~#tnode~0.base|) .cse4))) (store (store (store .cse14 |c_~#lock~0.base| (store (select .cse14 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse15)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse15 v_prenex_4))) |c_~#tnode~0.base|) .cse4) 0)) (< |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_47| .cse17) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_60| |c_~#qnode~0.base|) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| |c_~#qnode~0.base|)))) (exists ((|v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_45| Int)) (and (= (select .cse7 |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_45|) 0) (<= 16 |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_45|))) (or .cse13 (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (|v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| Int) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_vatomic32_write_~a#1.base_58| Int)) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (< |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| .cse17) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| |c_~#qnode~0.base|) (not (= (select (select (let ((.cse18 (store (let ((.cse20 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| v_ArrVal_912))) (store .cse20 |c_~#tnode~0.base| (store (store (select .cse20 |c_~#tnode~0.base|) (+ 4 |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46|) v_ArrVal_913) |v_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset_46| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse19 (select (select .cse18 |c_~#tnode~0.base|) .cse4))) (store (store (store .cse18 |c_~#lock~0.base| (store (select .cse18 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse19)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse19 v_prenex_4))) |c_~#tnode~0.base|) .cse4) 0))))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| 4)) (= 3 |c_~#lock~0.base|) (<= (mod .cse21 2) 0) (forall ((v_DerPreprocessor_1 (Array Int Int)) (|v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| Int) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_916 (Array Int Int)) (v_ArrVal_913 Int) (|runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_vatomic32_write_~a#1.base_58| Int)) (or (< |c_~#lock~0.base| |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26|) (not (= (select (select (let ((.cse22 (store (let ((.cse24 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| v_ArrVal_912))) (store .cse24 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select .cse24 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) .cse6 v_ArrVal_913) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_916))) (let ((.cse23 (select (select .cse22 |c_~#tnode~0.base|) .cse4))) (store (store (store .cse22 |c_~#lock~0.base| (store (select .cse22 |c_~#lock~0.base|) |runThread1of1ForFork0_hclhlock_acquire_~local_queue~0#1.offset| .cse23)) |v_runThread1of1ForFork0_vatomicptr_cmpxchg_~a#1.base_26| v_DerPreprocessor_1) .cse23 v_prenex_4))) |c_~#tnode~0.base|) .cse4) 0)) (< |v_ULTIMATE.start_vatomic32_write_~a#1.base_58| |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.base|))) (= (select .cse7 0) 0))))) is different from false [2025-04-14 16:56:29,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:56:29,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-14 16:56:29,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 16:56:29,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:56:29,687 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting runErr4ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:56:29,687 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:29,687 INFO L139 ounterexampleChecker]: Examining path program with hash 467527306, occurence #3 [2025-04-14 16:56:29,687 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 17 [2025-04-14 16:56:29,687 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,687 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 19 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 20 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 36 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 44 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 46 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 49 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 51 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 54 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 59 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,688 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 60 [2025-04-14 16:56:29,688 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 62 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 64 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 65 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 66 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 68 [2025-04-14 16:56:29,689 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 72 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 79 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 93 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 97 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 101 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 109 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 119 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 120 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 122 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 125 [2025-04-14 16:56:29,689 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:56:29,689 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:56:29,689 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:29,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:29,690 INFO L85 PathProgramCache]: Analyzing trace with hash 499781277, now seen corresponding path program 1 times [2025-04-14 16:56:29,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:29,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777665747] [2025-04-14 16:56:29,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:29,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:29,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-04-14 16:56:29,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-04-14 16:56:29,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:29,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-14 16:56:30,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:30,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777665747] [2025-04-14 16:56:30,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777665747] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:56:30,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274771262] [2025-04-14 16:56:30,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:56:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:56:30,776 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:56:30,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 16:56:30,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-04-14 16:56:31,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-04-14 16:56:31,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:31,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:31,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 1233 conjuncts, 109 conjuncts are in the unsatisfiable core [2025-04-14 16:56:31,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:56:31,209 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-04-14 16:56:31,213 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-04-14 16:56:31,215 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-04-14 16:56:31,318 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 47 treesize of output 39 [2025-04-14 16:56:31,320 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 39 treesize of output 31 [2025-04-14 16:56:31,366 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-14 16:56:31,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:56:31,509 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 9 treesize of output 1 [2025-04-14 16:56:31,512 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 9 treesize of output 1 [2025-04-14 16:56:31,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:31,518 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 36 treesize of output 39 [2025-04-14 16:56:31,535 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 8 treesize of output 4 [2025-04-14 16:56:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-14 16:56:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274771262] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:56:31,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:56:31,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 26 [2025-04-14 16:56:31,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668836785] [2025-04-14 16:56:31,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:56:31,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-14 16:56:31,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:31,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-14 16:56:31,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-04-14 16:56:31,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:31,571 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:31,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2025-04-14 16:56:31,571 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,308 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:56:32,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 16:56:32,309 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 16:56:32,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 16:56:32,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 16:56:32,509 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting runErr8ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:56:32,509 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:32,509 INFO L139 ounterexampleChecker]: Examining path program with hash -511584518, occurence #1 [2025-04-14 16:56:32,509 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:32,509 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:32,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:32,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1751738058, now seen corresponding path program 1 times [2025-04-14 16:56:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:32,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916238278] [2025-04-14 16:56:32,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:32,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-14 16:56:32,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-14 16:56:32,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:32,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-04-14 16:56:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:32,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916238278] [2025-04-14 16:56:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916238278] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:56:32,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007223934] [2025-04-14 16:56:32,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:32,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:56:32,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:56:32,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:56:32,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 16:56:32,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-14 16:56:32,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-14 16:56:32,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:32,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:32,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 16:56:32,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:56:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-04-14 16:56:32,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 16:56:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007223934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:32,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 16:56:32,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2025-04-14 16:56:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211050652] [2025-04-14 16:56:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:32,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:56:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:32,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:56:32,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 16:56:32,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:32,997 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:32,997 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 16:56:32,997 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:33,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:56:33,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-14 16:56:33,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 16:56:33,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:33,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 16:56:33,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:56:33,276 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting runErr7ASSERT_VIOLATIONERROR_FUNCTION === [runErr10ASSERT_VIOLATIONERROR_FUNCTION, runErr9ASSERT_VIOLATIONERROR_FUNCTION, runErr5ASSERT_VIOLATIONERROR_FUNCTION, runErr4ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2025-04-14 16:56:33,276 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:33,276 INFO L139 ounterexampleChecker]: Examining path program with hash -1011200960, occurence #1 [2025-04-14 16:56:33,276 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:33,276 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:33,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash 207009730, now seen corresponding path program 1 times [2025-04-14 16:56:33,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:33,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839534738] [2025-04-14 16:56:33,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:33,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:33,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-14 16:56:33,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-14 16:56:33,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:38,060 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 16:56:38,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:38,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839534738] [2025-04-14 16:56:38,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839534738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:56:38,060 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400921893] [2025-04-14 16:56:38,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:38,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:56:38,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:56:38,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 16:56:38,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 16:56:38,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-04-14 16:56:38,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-04-14 16:56:38,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:38,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:38,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 243 conjuncts are in the unsatisfiable core [2025-04-14 16:56:38,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:56:38,457 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-14 16:56:38,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-14 16:56:39,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-14 16:56:39,117 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 14 treesize of output 15 [2025-04-14 16:56:39,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 16:56:39,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-04-14 16:56:39,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 16:56:39,754 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 16:56:39,759 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2025-04-14 16:56:39,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 16:56:39,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2025-04-14 16:56:39,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:39,854 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2025-04-14 16:56:40,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,521 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-14 16:56:40,529 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 39 treesize of output 28 [2025-04-14 16:56:40,533 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 16:56:40,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,647 INFO L325 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2025-04-14 16:56:40,647 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2025-04-14 16:56:40,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:40,688 INFO L325 Elim1Store]: treesize reduction 79, result has 28.8 percent of original size [2025-04-14 16:56:40,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 65 [2025-04-14 16:56:40,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 16:56:40,969 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 16:56:40,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2025-04-14 16:56:40,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 16:56:41,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2025-04-14 16:56:41,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 16:56:41,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-04-14 16:56:41,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:41,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 16:56:41,733 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 0 case distinctions, treesize of input 22 treesize of output 10 [2025-04-14 16:56:42,055 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 16:56:42,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:56:42,994 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int)) (v_ArrVal_1593 (Array Int Int))) (< (mod (let ((.cse0 (+ |c_~#tnode~0.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1593) |c_~#tnode~0.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1594) |c_~#tnode~0.base|) .cse0))) 1073741824) 1073741823)) is different from false [2025-04-14 16:56:43,165 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int)) (v_ArrVal_1588 Int) (v_ArrVal_1593 (Array Int Int))) (< (mod (let ((.cse0 (+ |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 4)) (.cse1 (+ |c_~#tnode~0.offset| 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| v_ArrVal_1587) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) .cse0 v_ArrVal_1588) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1593) |c_~#tnode~0.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) .cse0 |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.offset|) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1594) |c_~#tnode~0.base|) .cse1))) 1073741824) 1073741823)) is different from false [2025-04-14 16:56:43,190 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1587 (Array Int Int)) (|ULTIMATE.start_vatomic32_write_~v#1| Int) (v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1584 (Array Int Int)) (v_ArrVal_1583 (Array Int Int)) (v_ArrVal_1594 (Array Int Int)) (v_ArrVal_1588 Int) (v_ArrVal_1593 (Array Int Int))) (< (mod (let ((.cse1 (+ |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 4)) (.cse2 (+ |c_~#tnode~0.offset| 4))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_vatomic32_write_~a#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_vatomic32_write_~a#1.base|) |c_ULTIMATE.start_vatomic32_write_~a#1.offset| |ULTIMATE.start_vatomic32_write_~v#1|)) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| v_ArrVal_1587) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1595) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_vatomic32_write_~a#1.base| v_ArrVal_1583))) (store .cse0 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select .cse0 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) .cse1 v_ArrVal_1588) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1593) |c_~#tnode~0.base|) .cse2)) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_vatomic32_write_~a#1.base| v_ArrVal_1584))) (store .cse3 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base| (store (store (select .cse3 |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.base|) .cse1 |c_ULTIMATE.start_hclhlock_init_tnode_~qnode#1.offset|) |c_ULTIMATE.start_hclhlock_init_tnode_~tnode#1.offset| 0))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_1594) |c_~#tnode~0.base|) .cse2))) 1073741824) 1073741823)) is different from false [2025-04-14 16:56:45,246 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:45,247 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 225 treesize of output 205 [2025-04-14 16:56:45,263 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:45,263 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 674 treesize of output 676 [2025-04-14 16:56:45,277 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:45,277 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 482 treesize of output 383 [2025-04-14 16:56:45,298 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:45,298 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 1106 treesize of output 1104 [2025-04-14 16:56:45,307 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:45,308 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:45,311 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 181 treesize of output 177 [2025-04-14 16:56:45,318 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:45,319 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:45,322 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 169 treesize of output 165 [2025-04-14 16:56:45,333 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 63 treesize of output 59 [2025-04-14 16:56:45,344 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 59 treesize of output 55 [2025-04-14 16:56:45,377 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 15 treesize of output 9 [2025-04-14 16:56:45,387 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 15 treesize of output 9 [2025-04-14 16:56:45,409 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:45,410 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:45,433 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:45,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 420 treesize of output 428 [2025-04-14 16:56:46,293 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:46,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2025-04-14 16:56:46,717 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:46,717 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2025-04-14 16:56:46,782 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:46,782 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2025-04-14 16:56:46,930 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 195 treesize of output 189 [2025-04-14 16:56:47,005 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 62 treesize of output 60 [2025-04-14 16:56:47,082 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 133 treesize of output 129 [2025-04-14 16:56:47,144 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 133 treesize of output 129 [2025-04-14 16:56:47,183 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 62 treesize of output 60 [2025-04-14 16:56:47,198 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 125 treesize of output 121 [2025-04-14 16:56:47,294 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 70 treesize of output 68 [2025-04-14 16:56:47,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:47,337 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2025-04-14 16:56:47,510 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 62 treesize of output 60 [2025-04-14 16:56:47,521 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 125 treesize of output 121 [2025-04-14 16:56:47,623 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 133 treesize of output 129 [2025-04-14 16:56:47,697 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 70 treesize of output 68 [2025-04-14 16:56:47,741 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 133 treesize of output 129 [2025-04-14 16:56:47,862 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 62 treesize of output 60 [2025-04-14 16:56:47,924 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 195 treesize of output 189 [2025-04-14 16:56:49,153 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:49,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2025-04-14 16:56:50,189 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:56:50,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2025-04-14 16:56:50,576 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:56:50,577 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 16:57:50,751 WARN L286 SmtUtils]: Spent 59.59s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-14 16:57:50,752 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:57:50,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52437 treesize of output 51549 [2025-04-14 16:58:02,252 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 323] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-04-14 16:58:02,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:58:02,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18205 treesize of output 18206 [2025-04-14 16:58:15,866 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:58:24,227 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:58:32,810 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:58:41,387 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:58:49,972 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:58:59,176 WARN L286 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:59:07,598 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:59:14,034 WARN L286 SmtUtils]: Spent 6.43s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:59:27,077 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:59:35,421 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 16:59:44,002 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-14 17:10:09,506 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 17:10:09,508 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 17:10:09,511 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-04-14 17:10:09,517 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 17:10:09,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-14 17:10:09,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 17:10:09,712 WARN L610 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-04-14 17:10:09,713 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2025-04-14 17:10:09,714 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-04-14 17:10:09,714 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2025-04-14 17:10:09,716 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 17:10:09,717 INFO L320 ceAbstractionStarter]: Result for error location runThread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2025-04-14 17:10:09,718 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 17:10:09,718 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 17:10:09,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 17:10:09,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 05:10:09 BasicIcfg [2025-04-14 17:10:09,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 17:10:09,728 INFO L158 Benchmark]: Toolchain (without parser) took 861205.31ms. Allocated memory was 142.6MB in the beginning and 838.9MB in the end (delta: 696.3MB). Free memory was 90.0MB in the beginning and 496.0MB in the end (delta: -406.1MB). Peak memory consumption was 553.6MB. Max. memory is 8.0GB. [2025-04-14 17:10:09,728 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 17:10:09,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1855.40ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 67.0MB in the end (delta: 23.0MB). Peak memory consumption was 98.4MB. Max. memory is 8.0GB. [2025-04-14 17:10:09,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.69ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 56.4MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 17:10:09,729 INFO L158 Benchmark]: Boogie Preprocessor took 48.47ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 53.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 17:10:09,729 INFO L158 Benchmark]: IcfgBuilder took 1346.73ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 53.1MB in the beginning and 186.7MB in the end (delta: -133.5MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. [2025-04-14 17:10:09,730 INFO L158 Benchmark]: TraceAbstraction took 857851.10ms. Allocated memory was 348.1MB in the beginning and 838.9MB in the end (delta: 490.7MB). Free memory was 185.7MB in the beginning and 496.0MB in the end (delta: -310.3MB). Peak memory consumption was 445.7MB. Max. memory is 8.0GB. [2025-04-14 17:10:09,731 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.18ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1855.40ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 67.0MB in the end (delta: 23.0MB). Peak memory consumption was 98.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 99.69ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 56.4MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.47ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 53.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1346.73ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 53.1MB in the beginning and 186.7MB in the end (delta: -133.5MB). Peak memory consumption was 73.4MB. Max. memory is 8.0GB. * TraceAbstraction took 857851.10ms. Allocated memory was 348.1MB in the beginning and 838.9MB in the end (delta: 490.7MB). Free memory was 185.7MB in the beginning and 496.0MB in the end (delta: -310.3MB). Peak memory consumption was 445.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3755]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] - GenericResultAtLocation [Line: 3757]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] - GenericResultAtLocation [Line: 3762]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] - GenericResultAtLocation [Line: 3764]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] - GenericResultAtLocation [Line: 3770]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] - GenericResultAtLocation [Line: 3772]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] - GenericResultAtLocation [Line: 3778]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] - GenericResultAtLocation [Line: 3780]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] - GenericResultAtLocation [Line: 3786]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] - GenericResultAtLocation [Line: 3788]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] - GenericResultAtLocation [Line: 3794]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] - GenericResultAtLocation [Line: 3796]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] - GenericResultAtLocation [Line: 3802]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] - GenericResultAtLocation [Line: 3804]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] - GenericResultAtLocation [Line: 3810]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] - GenericResultAtLocation [Line: 3812]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] - GenericResultAtLocation [Line: 3817]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] - GenericResultAtLocation [Line: 3819]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] - GenericResultAtLocation [Line: 3824]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] - GenericResultAtLocation [Line: 3826]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] - GenericResultAtLocation [Line: 3831]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] - GenericResultAtLocation [Line: 3833]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] - GenericResultAtLocation [Line: 3838]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] - GenericResultAtLocation [Line: 3840]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] - GenericResultAtLocation [Line: 3845]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] - GenericResultAtLocation [Line: 3847]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] - GenericResultAtLocation [Line: 3852]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] - GenericResultAtLocation [Line: 3855]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] - GenericResultAtLocation [Line: 3861]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] - GenericResultAtLocation [Line: 3864]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] - GenericResultAtLocation [Line: 3870]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] - GenericResultAtLocation [Line: 3873]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] - GenericResultAtLocation [Line: 3879]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] - GenericResultAtLocation [Line: 3882]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] - GenericResultAtLocation [Line: 3888]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] - GenericResultAtLocation [Line: 3891]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] - GenericResultAtLocation [Line: 3897]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] - GenericResultAtLocation [Line: 3900]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] - GenericResultAtLocation [Line: 3907]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] - GenericResultAtLocation [Line: 3910]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] - GenericResultAtLocation [Line: 3917]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] - GenericResultAtLocation [Line: 3920]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] - GenericResultAtLocation [Line: 3927]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] - GenericResultAtLocation [Line: 3930]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] - GenericResultAtLocation [Line: 3937]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] - GenericResultAtLocation [Line: 3940]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] - GenericResultAtLocation [Line: 3947]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] - GenericResultAtLocation [Line: 3950]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] - GenericResultAtLocation [Line: 3957]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] - GenericResultAtLocation [Line: 3960]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] - GenericResultAtLocation [Line: 3966]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] - GenericResultAtLocation [Line: 3969]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] - GenericResultAtLocation [Line: 3975]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] - GenericResultAtLocation [Line: 3978]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] - GenericResultAtLocation [Line: 3984]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] - GenericResultAtLocation [Line: 3987]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] - GenericResultAtLocation [Line: 3993]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] - GenericResultAtLocation [Line: 3996]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] - GenericResultAtLocation [Line: 4002]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] - GenericResultAtLocation [Line: 4005]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] - GenericResultAtLocation [Line: 4011]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] - GenericResultAtLocation [Line: 4014]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] - GenericResultAtLocation [Line: 4020]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] - GenericResultAtLocation [Line: 4023]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] - GenericResultAtLocation [Line: 4029]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] - GenericResultAtLocation [Line: 4032]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] - GenericResultAtLocation [Line: 4038]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] - GenericResultAtLocation [Line: 4041]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] - GenericResultAtLocation [Line: 4047]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] - GenericResultAtLocation [Line: 4050]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] - GenericResultAtLocation [Line: 4056]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] - GenericResultAtLocation [Line: 4059]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] - GenericResultAtLocation [Line: 4065]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] - GenericResultAtLocation [Line: 4068]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] - GenericResultAtLocation [Line: 4074]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] - GenericResultAtLocation [Line: 4077]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] - GenericResultAtLocation [Line: 4083]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] - GenericResultAtLocation [Line: 4086]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] - GenericResultAtLocation [Line: 4092]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] - GenericResultAtLocation [Line: 4095]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] - GenericResultAtLocation [Line: 4101]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] - GenericResultAtLocation [Line: 4103]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] - GenericResultAtLocation [Line: 4109]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] - GenericResultAtLocation [Line: 4111]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] - GenericResultAtLocation [Line: 4117]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] - GenericResultAtLocation [Line: 4119]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] - GenericResultAtLocation [Line: 4125]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] - GenericResultAtLocation [Line: 4127]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] - GenericResultAtLocation [Line: 4133]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] - GenericResultAtLocation [Line: 4135]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] - GenericResultAtLocation [Line: 4141]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] - GenericResultAtLocation [Line: 4143]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] - GenericResultAtLocation [Line: 4149]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] - GenericResultAtLocation [Line: 4151]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] - GenericResultAtLocation [Line: 4157]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] - GenericResultAtLocation [Line: 4159]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] - GenericResultAtLocation [Line: 4165]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] - GenericResultAtLocation [Line: 4167]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] - GenericResultAtLocation [Line: 4173]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] - GenericResultAtLocation [Line: 4175]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2194, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 1060, dependent conditional: 1056, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 753, independent: 749, independent conditional: 0, independent unconditional: 749, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 753, independent: 747, independent conditional: 0, independent unconditional: 747, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 269, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1138, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 753, unknown conditional: 0, unknown unconditional: 753] , Statistics on independence cache: Total cache size (in pairs): 753, Positive cache size: 749, Positive conditional cache size: 0, Positive unconditional cache size: 749, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 366, Maximal queried relation: 0, Independence queries for same thread: 1056, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 146, Number of trivial persistent sets: 141, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 772, independent: 768, independent conditional: 0, independent unconditional: 768, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2194, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 1060, dependent conditional: 1056, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 366, independent unconditional: 768, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1138, independent: 1134, independent conditional: 0, independent unconditional: 1134, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 753, independent: 749, independent conditional: 0, independent unconditional: 749, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 753, independent: 747, independent conditional: 0, independent unconditional: 747, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 269, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1138, independent: 385, independent conditional: 0, independent unconditional: 385, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 753, unknown conditional: 0, unknown unconditional: 753] , Statistics on independence cache: Total cache size (in pairs): 753, Positive cache size: 749, Positive conditional cache size: 0, Positive unconditional cache size: 749, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 366, Maximal queried relation: 0, Independence queries for same thread: 1056 - TimeoutResultAtElement [Line: 5507]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5436]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5437]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5473]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5474]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5506]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5525]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5489]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5490]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5491]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - TimeoutResultAtElement [Line: 5525]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 104 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-11-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: runThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 391 locations, 636 edges, 29 error locations. Started 1 CEGAR loops. OverallTime: 857.5s, OverallIterations: 14, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 14.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 1613 NumberOfCodeBlocks, 1613 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2019 ConstructedInterpolants, 168 QuantifiedInterpolants, 26401 SizeOfPredicates, 168 NumberOfNonLiveVariables, 4842 ConjunctsInSsa, 385 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 448/653 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 131, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown