/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/rec_mcslock.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 16:56:07,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 16:56:07,921 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:56:07,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 16:56:07,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 16:56:07,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 16:56:07,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 16:56:07,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 16:56:07,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 16:56:07,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 16:56:07,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 16:56:07,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 16:56:07,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 16:56:07,943 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 16:56:07,943 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:56:07,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:56:07,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 16:56:07,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 16:56:07,945 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 16:56:07,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 16:56:07,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 16:56:07,945 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 16:56:07,945 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 16:56:07,945 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:56:08,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 16:56:08,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 16:56:08,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 16:56:08,163 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 16:56:08,163 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 16:56:08,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/libvsync/rec_mcslock.i [2025-04-14 16:56:09,407 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ee78bc0/fa0d034cac2d425db7479a68df6fc206/FLAGacfba7c7d [2025-04-14 16:56:09,862 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 16:56:09,862 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/libvsync/rec_mcslock.i [2025-04-14 16:56:09,899 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ee78bc0/fa0d034cac2d425db7479a68df6fc206/FLAGacfba7c7d [2025-04-14 16:56:10,456 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ee78bc0/fa0d034cac2d425db7479a68df6fc206 [2025-04-14 16:56:10,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 16:56:10,459 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 16:56:10,460 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 16:56:10,460 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 16:56:10,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 16:56:10,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:56:10" (1/1) ... [2025-04-14 16:56:10,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6a91b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:10, skipping insertion in model container [2025-04-14 16:56:10,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:56:10" (1/1) ... [2025-04-14 16:56:10,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 16:56:11,808 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/rec_mcslock.i[173235,173248] [2025-04-14 16:56:11,814 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/rec_mcslock.i[173609,173622] [2025-04-14 16:56:12,001 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/rec_mcslock.i[196613,196626] [2025-04-14 16:56:12,001 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/rec_mcslock.i[196680,196693] [2025-04-14 16:56:12,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:56:12,021 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 16:56:12,141 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-04-14 16:56:12,142 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-04-14 16:56:12,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-04-14 16:56:12,143 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-04-14 16:56:12,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-04-14 16:56:12,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-04-14 16:56:12,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-04-14 16:56:12,144 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-04-14 16:56:12,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-04-14 16:56:12,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-04-14 16:56:12,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-04-14 16:56:12,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-04-14 16:56:12,145 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-04-14 16:56:12,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-04-14 16:56:12,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-04-14 16:56:12,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-04-14 16:56:12,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-04-14 16:56:12,146 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-04-14 16:56:12,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-04-14 16:56:12,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-04-14 16:56:12,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-04-14 16:56:12,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-04-14 16:56:12,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-04-14 16:56:12,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-04-14 16:56:12,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-04-14 16:56:12,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-04-14 16:56:12,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-04-14 16:56:12,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-04-14 16:56:12,148 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-04-14 16:56:12,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-04-14 16:56:12,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-04-14 16:56:12,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-04-14 16:56:12,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-04-14 16:56:12,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-04-14 16:56:12,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-04-14 16:56:12,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-04-14 16:56:12,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-04-14 16:56:12,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-04-14 16:56:12,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-04-14 16:56:12,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-04-14 16:56:12,151 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-04-14 16:56:12,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-04-14 16:56:12,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-04-14 16:56:12,152 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-04-14 16:56:12,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-04-14 16:56:12,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-04-14 16:56:12,153 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-04-14 16:56:12,154 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-04-14 16:56:12,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-04-14 16:56:12,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-04-14 16:56:12,155 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-04-14 16:56:12,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-04-14 16:56:12,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-04-14 16:56:12,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-04-14 16:56:12,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-04-14 16:56:12,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-04-14 16:56:12,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-04-14 16:56:12,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-04-14 16:56:12,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-04-14 16:56:12,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-04-14 16:56:12,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-04-14 16:56:12,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-04-14 16:56:12,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-04-14 16:56:12,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-04-14 16:56:12,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-04-14 16:56:12,162 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-04-14 16:56:12,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-04-14 16:56:12,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-04-14 16:56:12,163 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-04-14 16:56:12,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-04-14 16:56:12,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-04-14 16:56:12,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-04-14 16:56:12,164 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-04-14 16:56:12,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-04-14 16:56:12,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-04-14 16:56:12,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-04-14 16:56:12,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-04-14 16:56:12,165 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-04-14 16:56:12,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-04-14 16:56:12,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-04-14 16:56:12,166 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-04-14 16:56:12,167 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-04-14 16:56:12,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-04-14 16:56:12,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-04-14 16:56:12,168 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-04-14 16:56:12,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-04-14 16:56:12,169 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-04-14 16:56:12,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-04-14 16:56:12,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-04-14 16:56:12,170 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-04-14 16:56:12,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-04-14 16:56:12,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-04-14 16:56:12,171 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-04-14 16:56:12,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-04-14 16:56:12,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-04-14 16:56:12,172 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-04-14 16:56:12,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-04-14 16:56:12,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-04-14 16:56:12,173 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-04-14 16:56:12,174 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-04-14 16:56:12,231 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/rec_mcslock.i[173235,173248] [2025-04-14 16:56:12,233 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/rec_mcslock.i[173609,173622] [2025-04-14 16:56:12,245 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/rec_mcslock.i[196613,196626] [2025-04-14 16:56:12,246 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/rec_mcslock.i[196680,196693] [2025-04-14 16:56:12,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:56:12,429 INFO L204 MainTranslator]: Completed translation [2025-04-14 16:56:12,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12 WrapperNode [2025-04-14 16:56:12,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 16:56:12,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 16:56:12,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 16:56:12,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 16:56:12,436 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:56:12" (1/1) ... [2025-04-14 16:56:12,499 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:56:12" (1/1) ... [2025-04-14 16:56:12,544 INFO L138 Inliner]: procedures = 924, calls = 951, calls flagged for inlining = 834, calls inlined = 53, statements flattened = 455 [2025-04-14 16:56:12,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 16:56:12,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 16:56:12,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 16:56:12,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 16:56:12,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 16:56:12,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 16:56:12,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 16:56:12,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 16:56:12,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (1/1) ... [2025-04-14 16:56:12,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:56:12,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:56:12,620 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:56:12,626 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:56:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 16:56:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 16:56:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-14 16:56:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 16:56:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 16:56:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-04-14 16:56:12,644 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-04-14 16:56:12,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 16:56:12,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-14 16:56:12,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 16:56:12,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 16:56:12,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-14 16:56:12,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 16:56:12,646 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:56:12,795 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 16:56:12,797 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 16:56:12,933 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6033: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-04-14 16:56:12,933 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L6033-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-04-14 16:56:13,311 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-04-14 16:56:13,311 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L2285: havoc vatomic32_await_eq_acq_#t~ret174#1; [2025-04-14 16:56:13,311 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L3710: havoc vatomicptr_await_neq_rlx_#t~ret421#1.base, vatomicptr_await_neq_rlx_#t~ret421#1.offset; [2025-04-14 16:56:13,312 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L3655: havoc vatomicptr_read_rlx_#t~ret412#1.base, vatomicptr_read_rlx_#t~ret412#1.offset; [2025-04-14 16:56:13,312 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:56:13,312 INFO L1323 $ProcedureCfgBuilder]: dead code at ProgramPoint L3700: havoc vatomicptr_cmpxchg_rel_#t~ret419#1.base, vatomicptr_cmpxchg_rel_#t~ret419#1.offset; [2025-04-14 16:56:13,312 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 16:56:13,313 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 16:56:13,537 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 16:56:13,537 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 16:56:13,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:56:13 BoogieIcfgContainer [2025-04-14 16:56:13,537 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 16:56:13,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 16:56:13,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 16:56:13,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 16:56:13,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:56:10" (1/3) ... [2025-04-14 16:56:13,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409a073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:56:13, skipping insertion in model container [2025-04-14 16:56:13,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:56:12" (2/3) ... [2025-04-14 16:56:13,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409a073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:56:13, skipping insertion in model container [2025-04-14 16:56:13,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:56:13" (3/3) ... [2025-04-14 16:56:13,545 INFO L128 eAbstractionObserver]: Analyzing ICFG rec_mcslock.i [2025-04-14 16:56:13,557 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 16:56:13,560 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rec_mcslock.i that has 2 procedures, 109 locations, 179 edges, 1 initial locations, 21 loop locations, and 3 error locations. [2025-04-14 16:56:13,560 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 16:56:13,683 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-14 16:56:13,720 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:56:13,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 16:56:13,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:56:13,726 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:56:13,728 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:56:13,833 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:56:13,843 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == runThread1of1ForFork0 ======== [2025-04-14 16:56:13,850 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;@3a5cc54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:56:13,850 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 16:56:14,084 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:14,084 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:14,084 INFO L139 ounterexampleChecker]: Examining path program with hash -1750564742, occurence #1 [2025-04-14 16:56:14,084 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:14,084 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:14,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1104843942, now seen corresponding path program 1 times [2025-04-14 16:56:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:14,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063086050] [2025-04-14 16:56:14,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:14,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:14,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 16:56:14,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 16:56:14,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:14,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:14,257 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:56:14,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:14,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063086050] [2025-04-14 16:56:14,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063086050] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:14,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:14,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:56:14,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026062352] [2025-04-14 16:56:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:14,262 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:56:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:14,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:56:14,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:56:14,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,280 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:14,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:14,281 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 16:56:14,447 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:14,447 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:14,447 INFO L139 ounterexampleChecker]: Examining path program with hash 1999869772, occurence #1 [2025-04-14 16:56:14,447 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:14,447 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:14,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 917202164, now seen corresponding path program 1 times [2025-04-14 16:56:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:14,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668565525] [2025-04-14 16:56:14,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:14,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:56:14,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:56:14,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:14,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:14,578 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:56:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:14,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668565525] [2025-04-14 16:56:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668565525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:14,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:14,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:56:14,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388854481] [2025-04-14 16:56:14,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:14,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:56:14,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:14,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:56:14,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:56:14,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,580 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:14,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:14,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:14,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 16:56:14,631 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:14,631 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:14,631 INFO L139 ounterexampleChecker]: Examining path program with hash -1444141410, occurence #1 [2025-04-14 16:56:14,631 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:14,631 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:14,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1421175265, now seen corresponding path program 1 times [2025-04-14 16:56:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:14,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325131784] [2025-04-14 16:56:14,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:14,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 16:56:14,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 16:56:14,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:14,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:14,821 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:56:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:14,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325131784] [2025-04-14 16:56:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325131784] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 16:56:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229374496] [2025-04-14 16:56:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:14,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:56:14,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:14,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:56:14,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:56:14,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,822 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:14,822 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:14,822 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,822 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:14,822 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:14,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:14,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:14,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 16:56:14,917 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:14,917 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:14,917 INFO L139 ounterexampleChecker]: Examining path program with hash -331119654, occurence #1 [2025-04-14 16:56:14,917 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:14,917 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:14,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash -73452980, now seen corresponding path program 1 times [2025-04-14 16:56:14,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:14,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857258115] [2025-04-14 16:56:14,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:14,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:14,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 16:56:14,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 16:56:14,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:14,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:15,208 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:56:15,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:15,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857258115] [2025-04-14 16:56:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857258115] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 16:56:15,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102854523] [2025-04-14 16:56:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:15,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 16:56:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:15,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 16:56:15,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 16:56:15,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:15,210 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:15,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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:15,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:15,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:15,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:15,211 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:22,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:56:22,610 INFO L790 garLoopResultBuilder]: Registering result SAFE for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 16:56:22,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 16:56:22,614 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 16:56:22,615 INFO L320 ceAbstractionStarter]: Result for error location runThread1of1ForFork0 was SAFE (1/2) [2025-04-14 16:56:22,617 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:56:22,618 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:56:22,618 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 16:56:22,618 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;@3a5cc54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:56:22,618 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 16:56:22,619 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:56:22,619 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:22,619 INFO L139 ounterexampleChecker]: Examining path program with hash -1278919132, occurence #1 [2025-04-14 16:56:22,620 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:22,620 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:22,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:22,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1704591926, now seen corresponding path program 1 times [2025-04-14 16:56:22,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:22,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424132783] [2025-04-14 16:56:22,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:22,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 16:56:22,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 16:56:22,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:22,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:22,631 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:56:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:22,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424132783] [2025-04-14 16:56:22,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424132783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:22,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:22,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:56:22,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603154593] [2025-04-14 16:56:22,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:22,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:56:22,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:22,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:56:22,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:56:22,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,633 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:22,633 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:22,633 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 16:56:22,642 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:56:22,642 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:22,642 INFO L139 ounterexampleChecker]: Examining path program with hash 337674538, occurence #1 [2025-04-14 16:56:22,642 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:22,642 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:22,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash 391779692, now seen corresponding path program 1 times [2025-04-14 16:56:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:22,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185287900] [2025-04-14 16:56:22,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:22,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 16:56:22,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 16:56:22,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:22,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:22,668 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:56:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:22,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185287900] [2025-04-14 16:56:22,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185287900] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:22,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:22,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:56:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27178534] [2025-04-14 16:56:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:22,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:56:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:22,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:56:22,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:56:22,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,669 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:22,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:22,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,719 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 16:56:22,719 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:56:22,719 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:22,719 INFO L139 ounterexampleChecker]: Examining path program with hash 281192894, occurence #1 [2025-04-14 16:56:22,719 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:22,719 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:22,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:22,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1226059499, now seen corresponding path program 1 times [2025-04-14 16:56:22,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:22,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040427979] [2025-04-14 16:56:22,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:22,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:22,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 16:56:22,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 16:56:22,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:22,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:22,747 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:56:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:22,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040427979] [2025-04-14 16:56:22,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040427979] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:22,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:22,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:56:22,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553710857] [2025-04-14 16:56:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:22,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:56:22,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:22,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:56:22,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:56:22,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,748 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:22,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:22,748 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,748 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,748 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 16:56:22,780 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:56:22,780 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:22,781 INFO L139 ounterexampleChecker]: Examining path program with hash -733159163, occurence #1 [2025-04-14 16:56:22,781 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:22,781 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:22,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1226058538, now seen corresponding path program 1 times [2025-04-14 16:56:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:22,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688186223] [2025-04-14 16:56:22,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:22,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 16:56:22,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 16:56:22,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:22,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:22,851 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:56:22,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:22,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688186223] [2025-04-14 16:56:22,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688186223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:22,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:22,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 16:56:22,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306676803] [2025-04-14 16:56:22,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:22,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:56:22,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:22,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:56:22,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:56:22,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,852 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:22,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:22,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,853 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:22,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:22,875 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:56:22,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 16:56:22,876 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:56:22,876 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:22,876 INFO L139 ounterexampleChecker]: Examining path program with hash 1380348897, occurence #1 [2025-04-14 16:56:22,876 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:22,876 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:22,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1464236131, now seen corresponding path program 1 times [2025-04-14 16:56:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:22,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108216152] [2025-04-14 16:56:22,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:22,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:22,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 16:56:22,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 16:56:22,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:22,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:56:22,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 16:56:22,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 16:56:22,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 16:56:22,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:22,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:56:22,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 16:56:22,921 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 16:56:22,921 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 16:56:22,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 16:56:22,921 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-14 16:56:22,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 16:56:22,922 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-14 16:56:22,922 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2025-04-14 16:56:22,923 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 16:56:22,923 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 16:56:22,999 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 16:56:23,002 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:56:23,049 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:56:23,050 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == runThread2of2ForFork0 ======== [2025-04-14 16:56:23,050 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;@3a5cc54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:56:23,050 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 16:56:24,154 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:24,154 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:24,154 INFO L139 ounterexampleChecker]: Examining path program with hash 1043423472, occurence #1 [2025-04-14 16:56:24,154 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:24,154 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:24,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:24,155 INFO L85 PathProgramCache]: Analyzing trace with hash -121867685, now seen corresponding path program 1 times [2025-04-14 16:56:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:24,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033872671] [2025-04-14 16:56:24,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:24,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-04-14 16:56:24,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-04-14 16:56:24,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:24,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:24,209 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:56:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:24,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033872671] [2025-04-14 16:56:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033872671] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:24,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:24,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:56:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382080667] [2025-04-14 16:56:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:24,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:56:24,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:24,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:56:24,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:56:24,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,214 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:24,214 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 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:24,215 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 16:56:24,454 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:24,454 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:24,454 INFO L139 ounterexampleChecker]: Examining path program with hash -1700149677, occurence #1 [2025-04-14 16:56:24,454 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:24,454 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:24,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1564463780, now seen corresponding path program 1 times [2025-04-14 16:56:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:24,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319469803] [2025-04-14 16:56:24,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:24,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:24,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-14 16:56:24,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-14 16:56:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:24,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:24,509 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:56:24,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:24,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319469803] [2025-04-14 16:56:24,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319469803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:24,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:24,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:56:24,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299044678] [2025-04-14 16:56:24,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:24,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:56:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:24,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:56:24,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:56:24,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,511 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:24,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:24,511 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,511 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 16:56:24,557 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:24,557 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:24,557 INFO L139 ounterexampleChecker]: Examining path program with hash -911842752, occurence #1 [2025-04-14 16:56:24,557 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:24,557 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:24,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:24,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1767500075, now seen corresponding path program 1 times [2025-04-14 16:56:24,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:24,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583511626] [2025-04-14 16:56:24,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:24,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-14 16:56:24,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 16:56:24,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:24,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:24,601 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:56:24,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:24,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583511626] [2025-04-14 16:56:24,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583511626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:24,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:24,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:56:24,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621845090] [2025-04-14 16:56:24,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:24,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:56:24,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:24,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:56:24,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:56:24,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,602 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:24,602 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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:24,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,602 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 16:56:24,646 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:24,646 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:24,647 INFO L139 ounterexampleChecker]: Examining path program with hash -861771042, occurence #1 [2025-04-14 16:56:24,647 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:24,647 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:24,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:24,647 INFO L85 PathProgramCache]: Analyzing trace with hash 759711279, now seen corresponding path program 1 times [2025-04-14 16:56:24,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:24,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515067444] [2025-04-14 16:56:24,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:24,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 16:56:24,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 16:56:24,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:24,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:24,770 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:56:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:24,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515067444] [2025-04-14 16:56:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515067444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:24,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 16:56:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119338645] [2025-04-14 16:56:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:24,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 16:56:24,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:24,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 16:56:24,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 16:56:24,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,771 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:24,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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:24,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,771 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:24,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:24,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:56:24,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 16:56:24,860 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:24,860 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:24,860 INFO L139 ounterexampleChecker]: Examining path program with hash 1199472616, occurence #1 [2025-04-14 16:56:24,860 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:24,860 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:24,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -207605275, now seen corresponding path program 1 times [2025-04-14 16:56:24,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:24,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413798787] [2025-04-14 16:56:24,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:24,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:24,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-14 16:56:24,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 16:56:24,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:24,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:25,023 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:56:25,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:25,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413798787] [2025-04-14 16:56:25,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413798787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:25,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:25,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 16:56:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305479852] [2025-04-14 16:56:25,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:25,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 16:56:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:25,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 16:56:25,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 16:56:25,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,025 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:25,025 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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:25,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:56:25,025 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:56:25,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:56:25,216 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 16:56:25,216 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:25,216 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:25,216 INFO L139 ounterexampleChecker]: Examining path program with hash -766336910, occurence #1 [2025-04-14 16:56:25,216 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:25,216 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:25,216 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash 49154060, now seen corresponding path program 1 times [2025-04-14 16:56:25,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:25,217 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148091295] [2025-04-14 16:56:25,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:25,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:25,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 16:56:25,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 16:56:25,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:25,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:25,481 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:56:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:25,481 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148091295] [2025-04-14 16:56:25,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148091295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:25,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:25,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 16:56:25,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815579385] [2025-04-14 16:56:25,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:25,481 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 16:56:25,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:25,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 16:56:25,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-14 16:56:25,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,482 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:25,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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:25,482 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,482 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,482 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,482 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:56:25,482 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:56:25,482 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:56:25,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:56:25,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:56:25,576 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 16:56:25,576 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:56:25,576 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:56:25,576 INFO L139 ounterexampleChecker]: Examining path program with hash -16228974, occurence #1 [2025-04-14 16:56:25,577 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:56:25,577 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:56:25,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:56:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash 49155021, now seen corresponding path program 1 times [2025-04-14 16:56:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:56:25,577 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598703523] [2025-04-14 16:56:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:56:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:56:25,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 16:56:25,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 16:56:25,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:56:25,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:56:25,799 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:56:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:56:25,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598703523] [2025-04-14 16:56:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598703523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:56:25,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:56:25,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 16:56:25,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216186701] [2025-04-14 16:56:25,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:56:25,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 16:56:25,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:56:25,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 16:56:25,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 16:56:25,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,800 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:56:25,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:25,800 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:56:25,800 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,800 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:56:25,800 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:56:25,800 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:56:25,800 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:56:25,800 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:57:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:57:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 16:57:49,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:57:49,023 INFO L790 garLoopResultBuilder]: Registering result SAFE for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 16:57:49,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 16:57:49,025 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-14 16:57:49,025 INFO L320 ceAbstractionStarter]: Result for error location runThread2of2ForFork0 was SAFE (1/3) [2025-04-14 16:57:49,028 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:57:49,028 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:57:49,029 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == runThread1of2ForFork0 ======== [2025-04-14 16:57:49,029 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;@3a5cc54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:57:49,029 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 16:57:49,041 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:57:49,041 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:57:49,041 INFO L139 ounterexampleChecker]: Examining path program with hash -54113094, occurence #1 [2025-04-14 16:57:49,041 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:57:49,041 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:57:49,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:57:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1231757432, now seen corresponding path program 1 times [2025-04-14 16:57:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:57:49,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610552990] [2025-04-14 16:57:49,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:57:49,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:57:49,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 16:57:49,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 16:57:49,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:57:49,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:57:49,056 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:57:49,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:57:49,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610552990] [2025-04-14 16:57:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610552990] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:57:49,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:57:49,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:57:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430495084] [2025-04-14 16:57:49,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:57:49,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:57:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:57:49,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:57:49,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:57:49,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,058 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:57:49,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:57:49,058 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 16:57:49,090 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:57:49,090 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:57:49,090 INFO L139 ounterexampleChecker]: Examining path program with hash 112312421, occurence #1 [2025-04-14 16:57:49,090 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:57:49,090 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:57:49,090 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:57:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1458078261, now seen corresponding path program 1 times [2025-04-14 16:57:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:57:49,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562100077] [2025-04-14 16:57:49,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:57:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:57:49,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:57:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:57:49,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:57:49,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:57:49,114 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:57:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:57:49,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562100077] [2025-04-14 16:57:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562100077] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:57:49,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:57:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:57:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792560389] [2025-04-14 16:57:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:57:49,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:57:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:57:49,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:57:49,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:57:49,116 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,116 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:57:49,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:57:49,116 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,116 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,142 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 16:57:49,142 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:57:49,142 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:57:49,142 INFO L139 ounterexampleChecker]: Examining path program with hash 433469611, occurence #1 [2025-04-14 16:57:49,142 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:57:49,143 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:57:49,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:57:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash 19108930, now seen corresponding path program 1 times [2025-04-14 16:57:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:57:49,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726738326] [2025-04-14 16:57:49,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:57:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:57:49,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 16:57:49,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 16:57:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:57:49,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:57:49,191 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:57:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:57:49,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726738326] [2025-04-14 16:57:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726738326] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:57:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:57:49,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 16:57:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425615201] [2025-04-14 16:57:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:57:49,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:57:49,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:57:49,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:57:49,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:57:49,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,193 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:57:49,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:57:49,194 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,194 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,194 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,267 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:57:49,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-14 16:57:49,267 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:57:49,267 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:57:49,267 INFO L139 ounterexampleChecker]: Examining path program with hash -1364047212, occurence #1 [2025-04-14 16:57:49,267 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:57:49,267 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:57:49,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:57:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2097519418, now seen corresponding path program 1 times [2025-04-14 16:57:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:57:49,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256462316] [2025-04-14 16:57:49,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:57:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:57:49,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:57:49,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:57:49,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:57:49,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:57:49,332 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:57:49,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:57:49,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256462316] [2025-04-14 16:57:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256462316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:57:49,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:57:49,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 16:57:49,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529089706] [2025-04-14 16:57:49,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:57:49,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 16:57:49,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:57:49,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 16:57:49,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 16:57:49,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,333 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:57:49,333 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:57:49,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:57:49,333 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:57:49,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:57:49,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 16:57:49,382 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:57:49,382 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:57:49,382 INFO L139 ounterexampleChecker]: Examining path program with hash 1968924566, occurence #1 [2025-04-14 16:57:49,382 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:57:49,382 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:57:49,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:57:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash 962904134, now seen corresponding path program 1 times [2025-04-14 16:57:49,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:57:49,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39923972] [2025-04-14 16:57:49,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:57:49,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:57:49,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 16:57:49,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 16:57:49,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:57:49,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:57:49,517 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:57:49,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:57:49,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39923972] [2025-04-14 16:57:49,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39923972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:57:49,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:57:49,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 16:57:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475031222] [2025-04-14 16:57:49,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:57:49,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 16:57:49,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:57:49,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 16:57:49,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 16:57:49,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,518 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:57:49,518 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:57:49,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:57:49,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:57:49,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:57:49,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:57:49,518 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:13,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:13,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:58:13,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:58:13,787 INFO L790 garLoopResultBuilder]: Registering result SAFE for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-14 16:58:13,787 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-14 16:58:13,788 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-14 16:58:13,788 INFO L320 ceAbstractionStarter]: Result for error location runThread1of2ForFork0 was SAFE (2/3) [2025-04-14 16:58:13,791 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:58:13,792 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:58:13,792 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 16:58:13,792 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;@3a5cc54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:58:13,792 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 16:58:13,793 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:58:13,793 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:13,793 INFO L139 ounterexampleChecker]: Examining path program with hash -1553343117, occurence #1 [2025-04-14 16:58:13,793 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:13,793 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:13,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1648728342, now seen corresponding path program 1 times [2025-04-14 16:58:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:13,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402220161] [2025-04-14 16:58:13,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:13,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:13,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 16:58:13,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 16:58:13,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:13,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:13,801 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:58:13,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:13,802 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402220161] [2025-04-14 16:58:13,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402220161] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:13,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:13,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:58:13,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504171451] [2025-04-14 16:58:13,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:13,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:58:13,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:13,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:58:13,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:58:13,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,802 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:13,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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:58:13,802 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 16:58:13,813 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:58:13,813 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:13,813 INFO L139 ounterexampleChecker]: Examining path program with hash -1686945956, occurence #1 [2025-04-14 16:58:13,813 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:13,813 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:13,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1775450941, now seen corresponding path program 1 times [2025-04-14 16:58:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:13,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866468573] [2025-04-14 16:58:13,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:13,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-14 16:58:13,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-14 16:58:13,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:13,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:13,829 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:58:13,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:13,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866468573] [2025-04-14 16:58:13,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866468573] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:13,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:13,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:58:13,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331050454] [2025-04-14 16:58:13,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:13,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:58:13,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:13,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:58:13,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:58:13,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,830 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:13,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:58:13,830 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,830 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:13,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-14 16:58:13,871 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:58:13,871 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:13,871 INFO L139 ounterexampleChecker]: Examining path program with hash -203684156, occurence #1 [2025-04-14 16:58:13,871 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:13,871 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:13,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:13,871 INFO L85 PathProgramCache]: Analyzing trace with hash 719571128, now seen corresponding path program 1 times [2025-04-14 16:58:13,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:13,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079045236] [2025-04-14 16:58:13,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:13,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:13,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 16:58:13,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 16:58:13,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:13,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:13,889 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:58:13,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:13,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079045236] [2025-04-14 16:58:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079045236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:13,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:13,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:58:13,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525935479] [2025-04-14 16:58:13,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:13,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:58:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:13,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:58:13,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:58:13,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,890 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:13,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:58:13,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:13,890 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:13,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:13,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 16:58:13,915 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:58:13,915 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:13,915 INFO L139 ounterexampleChecker]: Examining path program with hash 321208612, occurence #1 [2025-04-14 16:58:13,915 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:13,915 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:13,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:13,916 INFO L85 PathProgramCache]: Analyzing trace with hash 719572089, now seen corresponding path program 1 times [2025-04-14 16:58:13,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:13,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511404843] [2025-04-14 16:58:13,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:13,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 16:58:13,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 16:58:13,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:13,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:13,957 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:58:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:13,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511404843] [2025-04-14 16:58:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511404843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 16:58:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147909886] [2025-04-14 16:58:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:13,958 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:58:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:13,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:58:13,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:58:13,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,958 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:13,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:58:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:13,958 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:14,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-14 16:58:14,044 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:58:14,044 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:14,044 INFO L139 ounterexampleChecker]: Examining path program with hash -1034424651, occurence #1 [2025-04-14 16:58:14,044 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:14,044 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:14,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash -276305147, now seen corresponding path program 1 times [2025-04-14 16:58:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:14,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626803510] [2025-04-14 16:58:14,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:14,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:14,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 16:58:14,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 16:58:14,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:14,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:14,073 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:58:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:14,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626803510] [2025-04-14 16:58:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626803510] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:58:14,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630052481] [2025-04-14 16:58:14,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:14,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:58:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:14,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:58:14,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:58:14,074 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,074 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:14,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:58:14,074 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,075 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,075 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,075 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:14,075 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:14,109 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,109 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 16:58:14,110 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:58:14,110 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:14,110 INFO L139 ounterexampleChecker]: Examining path program with hash -742112862, occurence #1 [2025-04-14 16:58:14,110 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:14,110 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:14,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:14,110 INFO L85 PathProgramCache]: Analyzing trace with hash -276304186, now seen corresponding path program 1 times [2025-04-14 16:58:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:14,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823064097] [2025-04-14 16:58:14,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:14,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 16:58:14,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 16:58:14,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:14,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:14,175 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:58:14,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:14,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823064097] [2025-04-14 16:58:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823064097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:14,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 16:58:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842430202] [2025-04-14 16:58:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:14,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 16:58:14,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:14,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 16:58:14,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 16:58:14,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,177 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:14,177 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:58:14,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:14,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,177 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:14,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:58:14,208 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-14 16:58:14,208 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:58:14,208 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:14,208 INFO L139 ounterexampleChecker]: Examining path program with hash -1289981029, occurence #1 [2025-04-14 16:58:14,208 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:14,208 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:14,209 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1002978908, now seen corresponding path program 1 times [2025-04-14 16:58:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:14,209 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408339578] [2025-04-14 16:58:14,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:14,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:14,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 16:58:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 16:58:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:58:14,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 16:58:14,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 16:58:14,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 16:58:14,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:14,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:58:14,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 16:58:14,252 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 16:58:14,253 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 16:58:14,253 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 16:58:14,253 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-04-14 16:58:14,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 16:58:14,253 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-04-14 16:58:14,254 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (3/3) [2025-04-14 16:58:14,254 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 16:58:14,254 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 16:58:14,359 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 16:58:14,361 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:58:14,426 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:58:14,426 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == runThread1of3ForFork0 ======== [2025-04-14 16:58:14,426 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;@3a5cc54a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:58:14,426 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-14 16:58:14,682 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:58:14,683 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:14,683 INFO L139 ounterexampleChecker]: Examining path program with hash -1827033784, occurence #1 [2025-04-14 16:58:14,683 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:14,683 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:14,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -947378295, now seen corresponding path program 1 times [2025-04-14 16:58:14,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:14,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052113779] [2025-04-14 16:58:14,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:14,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-14 16:58:14,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-14 16:58:14,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:14,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:14,696 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:58:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:14,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052113779] [2025-04-14 16:58:14,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052113779] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:14,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:58:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535508367] [2025-04-14 16:58:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:14,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 16:58:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:14,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 16:58:14,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 16:58:14,697 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,697 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:14,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 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:58:14,698 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,788 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-14 16:58:14,788 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:58:14,788 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:14,788 INFO L139 ounterexampleChecker]: Examining path program with hash -447545996, occurence #1 [2025-04-14 16:58:14,788 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:14,788 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:14,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:14,788 INFO L85 PathProgramCache]: Analyzing trace with hash -7229278, now seen corresponding path program 1 times [2025-04-14 16:58:14,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:14,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784632892] [2025-04-14 16:58:14,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:14,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:14,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:58:14,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:58:14,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:14,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:14,810 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:58:14,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:14,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784632892] [2025-04-14 16:58:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784632892] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 16:58:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464020598] [2025-04-14 16:58:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:14,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:58:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:14,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:58:14,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:58:14,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,811 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:14,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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:58:14,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,812 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-14 16:58:14,836 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:58:14,836 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:14,836 INFO L139 ounterexampleChecker]: Examining path program with hash -1326997414, occurence #1 [2025-04-14 16:58:14,836 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:14,836 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:14,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2135720466, now seen corresponding path program 1 times [2025-04-14 16:58:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:14,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157463194] [2025-04-14 16:58:14,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:14,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 16:58:14,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 16:58:14,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:14,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:14,878 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:58:14,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:14,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157463194] [2025-04-14 16:58:14,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157463194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:14,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:14,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 16:58:14,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330254993] [2025-04-14 16:58:14,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:14,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 16:58:14,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:14,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 16:58:14,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 16:58:14,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,879 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:14,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:58:14,880 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:14,880 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:14,880 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:15,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:15,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-14 16:58:15,114 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:58:15,114 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:15,114 INFO L139 ounterexampleChecker]: Examining path program with hash 657859686, occurence #1 [2025-04-14 16:58:15,114 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:15,114 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:15,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:15,114 INFO L85 PathProgramCache]: Analyzing trace with hash 394275761, now seen corresponding path program 1 times [2025-04-14 16:58:15,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:15,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919180781] [2025-04-14 16:58:15,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:15,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-14 16:58:15,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 16:58:15,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:15,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:15,170 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:58:15,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:15,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919180781] [2025-04-14 16:58:15,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919180781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:15,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:15,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 16:58:15,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202544486] [2025-04-14 16:58:15,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:15,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 16:58:15,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:15,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 16:58:15,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 16:58:15,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,171 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:15,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:58:15,171 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,171 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:15,171 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:15,171 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:15,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:15,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:58:15,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-14 16:58:15,395 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting runErr0ASSERT_VIOLATIONERROR_FUNCTION === [runErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-14 16:58:15,395 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:58:15,395 INFO L139 ounterexampleChecker]: Examining path program with hash 721654632, occurence #1 [2025-04-14 16:58:15,395 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:58:15,395 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:58:15,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:58:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1306054564, now seen corresponding path program 1 times [2025-04-14 16:58:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:58:15,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506924619] [2025-04-14 16:58:15,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:58:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:58:15,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-14 16:58:15,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-14 16:58:15,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:58:15,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:58:15,525 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:58:15,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:58:15,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506924619] [2025-04-14 16:58:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506924619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:58:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:58:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 16:58:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231113316] [2025-04-14 16:58:15,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:58:15,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 16:58:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:58:15,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 16:58:15,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-14 16:58:15,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,526 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:58:15,526 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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:58:15,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:58:15,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:58:15,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:58:15,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:58:15,526 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.