./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 93c428ff6f0565c9de954639ae23000ff5693477bac9f291339fc811e0689668 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:23:47,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:23:47,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:23:47,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:23:47,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:23:47,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:23:47,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:23:47,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:23:47,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:23:47,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:23:47,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:23:47,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:23:47,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:23:47,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:23:47,652 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:23:47,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:23:47,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:23:47,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:23:47,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:23:47,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:23:47,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:23:47,653 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:23:47,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:23:47,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:23:47,654 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93c428ff6f0565c9de954639ae23000ff5693477bac9f291339fc811e0689668 [2025-03-04 04:23:47,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:23:47,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:23:47,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:23:47,901 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:23:47,901 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:23:47,902 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-03-04 04:23:49,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39956f15b/6386273971da41dfaa22f2756568eb5b/FLAGc27449816 [2025-03-04 04:23:49,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:23:49,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-03-04 04:23:49,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39956f15b/6386273971da41dfaa22f2756568eb5b/FLAGc27449816 [2025-03-04 04:23:49,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39956f15b/6386273971da41dfaa22f2756568eb5b [2025-03-04 04:23:49,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:23:49,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:23:49,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:23:49,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:23:49,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:23:49,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:23:49" (1/1) ... [2025-03-04 04:23:49,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b91a4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:49, skipping insertion in model container [2025-03-04 04:23:49,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:23:49" (1/1) ... [2025-03-04 04:23:49,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:23:50,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i[129978,129991] [2025-03-04 04:23:50,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:23:50,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:23:50,466 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; subl %2, %0; sete %1": "+m" (v->counter), "=qm" (c): "er" (i): "memory"); [3226-3227] [2025-03-04 04:23:50,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddb %b0, %1\n": "+q" (__ret), "+m" (v->counter): : "memory", "cc"); [3238-3239] [2025-03-04 04:23:50,469 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddw %w0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3242-3243] [2025-03-04 04:23:50,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddl %0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3246-3247] [2025-03-04 04:23:50,470 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; xaddq %q0, %1\n": "+r" (__ret), "+m" (v->counter): : "memory", "cc"); [3250-3251] [2025-03-04 04:23:50,499 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_1": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp): "ebx"); [3767] [2025-03-04 04:23:50,501 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_2": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___0): "ebx"); [3772] [2025-03-04 04:23:50,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_4": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___1): "ebx"); [3777] [2025-03-04 04:23:50,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_8": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___2): "ebx"); [3782] [2025-03-04 04:23:50,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __put_user_X": "=a" (__ret_pu): "0" (__pu_val), "c" (tmp___3): "ebx"); [3787] [2025-03-04 04:23:50,533 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("call __get_user_%P3": "=a" (__ret_gu), "=r" (__val_gu): "0" (tmp), "i" (1UL)); [3886-3887] [2025-03-04 04:23:50,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i[129978,129991] [2025-03-04 04:23:50,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:23:50,624 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:23:50,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50 WrapperNode [2025-03-04 04:23:50,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:23:50,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:23:50,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:23:50,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:23:50,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,724 INFO L138 Inliner]: procedures = 190, calls = 552, calls flagged for inlining = 74, calls inlined = 69, statements flattened = 1678 [2025-03-04 04:23:50,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:23:50,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:23:50,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:23:50,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:23:50,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,870 INFO L175 MemorySlicer]: Split 205 memory accesses to 7 slices as follows [4, 2, 23, 122, 13, 14, 27]. 60 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [0, 2, 0, 2, 0, 0, 0]. The 128 writes are split as follows [2, 0, 23, 62, 2, 12, 27]. [2025-03-04 04:23:50,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,913 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,927 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:23:50,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:23:50,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:23:50,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:23:50,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (1/1) ... [2025-03-04 04:23:50,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:23:50,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:23:50,981 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-03-04 04:23:50,989 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-03-04 04:23:51,003 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_serio_raw_mutex [2025-03-04 04:23:51,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_serio_raw_mutex [2025-03-04 04:23:51,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:23:51,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:23:51,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2025-03-04 04:23:51,004 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:23:51,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:23:51,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:23:51,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:23:51,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:23:51,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:23:51,007 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:23:51,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:23:51,007 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2025-03-04 04:23:51,007 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2025-03-04 04:23:51,007 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-03-04 04:23:51,007 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:23:51,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-03-04 04:23:51,008 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:23:51,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:23:51,008 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2025-03-04 04:23:51,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2025-03-04 04:23:51,009 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_disconnect [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_disconnect [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure serio_continue_rx [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_continue_rx [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_poll [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_poll [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure serio_set_drvdata [2025-03-04 04:23:51,010 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_set_drvdata [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:23:51,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure misc_register [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_register [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure serio_pause_rx [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_pause_rx [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add_return [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add_return [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_2 [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_2 [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure serio_get_drvdata [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_get_drvdata [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2025-03-04 04:23:51,011 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-03-04 04:23:51,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_serio_raw_mutex [2025-03-04 04:23:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2025-03-04 04:23:51,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2025-03-04 04:23:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 04:23:51,012 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 04:23:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure serio_close [2025-03-04 04:23:51,012 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_close [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_serio_raw_mutex [2025-03-04 04:23:51,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_serio_raw_mutex [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_write [2025-03-04 04:23:51,013 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_write [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure serio_raw_fasync [2025-03-04 04:23:51,013 INFO L138 BoogieDeclarations]: Found implementation of procedure serio_raw_fasync [2025-03-04 04:23:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:23:51,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:23:51,330 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:23:51,333 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:23:51,396 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:23:51,492 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5308: havoc misc_deregister_#t~nondet302#1; [2025-03-04 04:23:51,630 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5312: havoc #t~nondet303; [2025-03-04 04:23:51,641 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5319: havoc #t~nondet304; [2025-03-04 04:23:51,664 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3529: havoc dev_get_drvdata_#t~mem88#1.base, dev_get_drvdata_#t~mem88#1.offset; [2025-03-04 04:23:51,692 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3406: havoc __kmalloc_#t~ret56#1.base, __kmalloc_#t~ret56#1.offset; [2025-03-04 04:23:51,742 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4488-1: ldv_mutex_lock_interruptible_14_#res#1 := ldv_mutex_lock_interruptible_14_~ldv_func_res~2#1; [2025-03-04 04:23:51,775 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5289: havoc fasync_helper_#t~nondet300#1; [2025-03-04 04:23:56,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5323: havoc mutex_lock_killable_#t~nondet305#1; [2025-03-04 04:23:56,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3507: havoc iminor_#t~mem70#1; [2025-03-04 04:23:56,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4467-1: ldv_mutex_lock_interruptible_12_#res#1 := ldv_mutex_lock_interruptible_12_~ldv_func_res~1#1; [2025-03-04 04:23:56,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5295: havoc get_device_#t~ret301#1.base, get_device_#t~ret301#1.offset; [2025-03-04 04:23:56,338 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3976: call ULTIMATE.dealloc(serio_raw_connect_~#serio_raw_no~0#1.base, serio_raw_connect_~#serio_raw_no~0#1.offset);havoc serio_raw_connect_~#serio_raw_no~0#1.base, serio_raw_connect_~#serio_raw_no~0#1.offset;call ULTIMATE.dealloc(serio_raw_connect_~#descriptor~0#1.base, serio_raw_connect_~#descriptor~0#1.offset);havoc serio_raw_connect_~#descriptor~0#1.base, serio_raw_connect_~#descriptor~0#1.offset;call ULTIMATE.dealloc(serio_raw_connect_~#__key~0#1.base, serio_raw_connect_~#__key~0#1.offset);havoc serio_raw_connect_~#__key~0#1.base, serio_raw_connect_~#__key~0#1.offset; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4175: call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset);havoc main_~#ldvarg12~0#1.base, main_~#ldvarg12~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset);havoc main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset);havoc main_~#ldvarg6~0#1.base, main_~#ldvarg6~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset);havoc main_~#ldvarg4~0#1.base, main_~#ldvarg4~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset);havoc main_~#ldvarg9~0#1.base, main_~#ldvarg9~0#1.offset; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5334: havoc noop_llseek_#t~nondet307#1; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4509-1: ldv_mutex_lock_killable_16_#res#1 := ldv_mutex_lock_killable_16_~ldv_func_res~3#1; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5270: havoc __serio_register_driver_#t~nondet299#1; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5338: havoc prepare_to_wait_event_#t~nondet308#1; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3724: call ULTIMATE.dealloc(serio_raw_read_~#c~1#1.base, serio_raw_read_~#c~1#1.offset);havoc serio_raw_read_~#c~1#1.base, serio_raw_read_~#c~1#1.offset;call ULTIMATE.dealloc(serio_raw_read_~#__wait~0#1.base, serio_raw_read_~#__wait~0#1.offset);havoc serio_raw_read_~#__wait~0#1.base, serio_raw_read_~#__wait~0#1.offset; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4057: call ULTIMATE.dealloc(serio_raw_reconnect_~#descriptor~1#1.base, serio_raw_reconnect_~#descriptor~1#1.offset);havoc serio_raw_reconnect_~#descriptor~1#1.base, serio_raw_reconnect_~#descriptor~1#1.offset; [2025-03-04 04:23:56,339 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc serio_open_#t~nondet309#1; [2025-03-04 04:23:56,559 INFO L? ?]: Removed 756 outVars from TransFormulas that were not future-live. [2025-03-04 04:23:56,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:23:56,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:23:56,593 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:23:56,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:23:56 BoogieIcfgContainer [2025-03-04 04:23:56,593 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:23:56,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:23:56,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:23:56,599 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:23:56,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:23:49" (1/3) ... [2025-03-04 04:23:56,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2083f512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:56, skipping insertion in model container [2025-03-04 04:23:56,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:23:50" (2/3) ... [2025-03-04 04:23:56,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2083f512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:23:56, skipping insertion in model container [2025-03-04 04:23:56,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:23:56" (3/3) ... [2025-03-04 04:23:56,601 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i [2025-03-04 04:23:56,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:23:56,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--input--serio--serio_raw.ko-entry_point.cil.out.i that has 41 procedures, 544 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 04:23:56,668 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:23:56,677 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2804e42c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:23:56,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:23:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 387 states have (on average 1.3281653746770026) internal successors, (514), 408 states have internal predecessors, (514), 115 states have call successors, (115), 40 states have call predecessors, (115), 39 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-04 04:23:56,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 04:23:56,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:23:56,698 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:23:56,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:23:56,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:23:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -630741122, now seen corresponding path program 1 times [2025-03-04 04:23:56,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:23:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518872752] [2025-03-04 04:23:56,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:23:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:23:57,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 04:23:57,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 04:23:57,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:23:57,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:23:57,798 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 04:23:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:23:57,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518872752] [2025-03-04 04:23:57,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518872752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:23:57,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715005361] [2025-03-04 04:23:57,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:23:57,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:23:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:23:57,802 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:23:57,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:23:58,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 04:23:58,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 04:23:58,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:23:58,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:23:58,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 1915 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 04:23:58,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:23:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-04 04:23:58,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:23:58,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715005361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:23:58,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:23:58,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 04:23:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499054942] [2025-03-04 04:23:58,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:23:58,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:23:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:23:58,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:23:58,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:23:58,804 INFO L87 Difference]: Start difference. First operand has 543 states, 387 states have (on average 1.3281653746770026) internal successors, (514), 408 states have internal predecessors, (514), 115 states have call successors, (115), 40 states have call predecessors, (115), 39 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:23:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:23:58,904 INFO L93 Difference]: Finished difference Result 1081 states and 1510 transitions. [2025-03-04 04:23:58,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:23:58,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2025-03-04 04:23:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:23:58,919 INFO L225 Difference]: With dead ends: 1081 [2025-03-04 04:23:58,919 INFO L226 Difference]: Without dead ends: 532 [2025-03-04 04:23:58,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:23:58,926 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:23:58,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 723 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:23:58,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-04 04:23:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-04 04:23:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 382 states have (on average 1.3089005235602094) internal successors, (500), 397 states have internal predecessors, (500), 111 states have call successors, (111), 39 states have call predecessors, (111), 38 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-04 04:23:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 714 transitions. [2025-03-04 04:23:58,983 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 714 transitions. Word has length 168 [2025-03-04 04:23:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:23:58,984 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 714 transitions. [2025-03-04 04:23:58,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 04:23:58,984 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 714 transitions. [2025-03-04 04:23:58,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 04:23:58,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:23:58,987 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:23:58,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 04:23:59,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 04:23:59,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:23:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:23:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash 310354052, now seen corresponding path program 1 times [2025-03-04 04:23:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:23:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108414982] [2025-03-04 04:23:59,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:23:59,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:23:59,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 04:23:59,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 04:23:59,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:23:59,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108414982] [2025-03-04 04:24:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108414982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739167044] [2025-03-04 04:24:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:00,153 INFO L87 Difference]: Start difference. First operand 532 states and 714 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 04:24:04,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:24:04,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:04,358 INFO L93 Difference]: Finished difference Result 1503 states and 2015 transitions. [2025-03-04 04:24:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:04,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 168 [2025-03-04 04:24:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:04,373 INFO L225 Difference]: With dead ends: 1503 [2025-03-04 04:24:04,373 INFO L226 Difference]: Without dead ends: 1007 [2025-03-04 04:24:04,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:04,376 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 639 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:04,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1411 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:24:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-03-04 04:24:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1001. [2025-03-04 04:24:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 726 states have (on average 1.31267217630854) internal successors, (953), 749 states have internal predecessors, (953), 199 states have call successors, (199), 76 states have call predecessors, (199), 75 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2025-03-04 04:24:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1343 transitions. [2025-03-04 04:24:04,442 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1343 transitions. Word has length 168 [2025-03-04 04:24:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:04,443 INFO L471 AbstractCegarLoop]: Abstraction has 1001 states and 1343 transitions. [2025-03-04 04:24:04,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 04:24:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1343 transitions. [2025-03-04 04:24:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 04:24:04,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:04,448 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:04,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:24:04,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:04,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1228862533, now seen corresponding path program 1 times [2025-03-04 04:24:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186609724] [2025-03-04 04:24:04,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:04,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 04:24:04,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 04:24:04,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:04,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:05,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186609724] [2025-03-04 04:24:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186609724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:05,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:05,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202343496] [2025-03-04 04:24:05,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:05,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:05,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:05,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:05,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:05,110 INFO L87 Difference]: Start difference. First operand 1001 states and 1343 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:24:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:05,357 INFO L93 Difference]: Finished difference Result 2451 states and 3233 transitions. [2025-03-04 04:24:05,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 175 [2025-03-04 04:24:05,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:05,371 INFO L225 Difference]: With dead ends: 2451 [2025-03-04 04:24:05,371 INFO L226 Difference]: Without dead ends: 1486 [2025-03-04 04:24:05,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:05,377 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 402 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:05,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1300 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:24:05,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-03-04 04:24:05,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1460. [2025-03-04 04:24:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1058 states have (on average 1.2911153119092627) internal successors, (1366), 1097 states have internal predecessors, (1366), 272 states have call successors, (272), 132 states have call predecessors, (272), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-03-04 04:24:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1910 transitions. [2025-03-04 04:24:05,448 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1910 transitions. Word has length 175 [2025-03-04 04:24:05,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:05,450 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 1910 transitions. [2025-03-04 04:24:05,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:24:05,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1910 transitions. [2025-03-04 04:24:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 04:24:05,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:05,452 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:05,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:24:05,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:05,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1288743675, now seen corresponding path program 1 times [2025-03-04 04:24:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:05,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539277474] [2025-03-04 04:24:05,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:05,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:05,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 04:24:05,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 04:24:05,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:05,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539277474] [2025-03-04 04:24:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539277474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:06,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471567966] [2025-03-04 04:24:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:06,044 INFO L87 Difference]: Start difference. First operand 1460 states and 1910 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 04:24:06,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:06,126 INFO L93 Difference]: Finished difference Result 1482 states and 1936 transitions. [2025-03-04 04:24:06,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:06,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 173 [2025-03-04 04:24:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:06,134 INFO L225 Difference]: With dead ends: 1482 [2025-03-04 04:24:06,134 INFO L226 Difference]: Without dead ends: 1471 [2025-03-04 04:24:06,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:06,136 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 709 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:06,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 735 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:24:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2025-03-04 04:24:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1460. [2025-03-04 04:24:06,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1058 states have (on average 1.289224952741021) internal successors, (1364), 1097 states have internal predecessors, (1364), 272 states have call successors, (272), 132 states have call predecessors, (272), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-03-04 04:24:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 1908 transitions. [2025-03-04 04:24:06,233 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 1908 transitions. Word has length 173 [2025-03-04 04:24:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:06,234 INFO L471 AbstractCegarLoop]: Abstraction has 1460 states and 1908 transitions. [2025-03-04 04:24:06,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-04 04:24:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 1908 transitions. [2025-03-04 04:24:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 04:24:06,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:06,237 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:06,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:24:06,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:06,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:06,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1260114524, now seen corresponding path program 1 times [2025-03-04 04:24:06,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:06,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313838638] [2025-03-04 04:24:06,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:06,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:06,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 04:24:06,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 04:24:06,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:06,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:06,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:06,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313838638] [2025-03-04 04:24:06,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313838638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:06,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:06,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871842988] [2025-03-04 04:24:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:06,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:06,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:06,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:06,922 INFO L87 Difference]: Start difference. First operand 1460 states and 1908 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:06,978 INFO L93 Difference]: Finished difference Result 1462 states and 1909 transitions. [2025-03-04 04:24:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:06,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2025-03-04 04:24:06,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:06,986 INFO L225 Difference]: With dead ends: 1462 [2025-03-04 04:24:06,987 INFO L226 Difference]: Without dead ends: 1459 [2025-03-04 04:24:06,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:06,989 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 666 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:06,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 707 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:24:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2025-03-04 04:24:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1459. [2025-03-04 04:24:07,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1058 states have (on average 1.2882797731568998) internal successors, (1363), 1096 states have internal predecessors, (1363), 271 states have call successors, (271), 132 states have call predecessors, (271), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-03-04 04:24:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 1906 transitions. [2025-03-04 04:24:07,050 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 1906 transitions. Word has length 173 [2025-03-04 04:24:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:07,051 INFO L471 AbstractCegarLoop]: Abstraction has 1459 states and 1906 transitions. [2025-03-04 04:24:07,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 1906 transitions. [2025-03-04 04:24:07,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 04:24:07,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:07,053 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:07,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:24:07,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:07,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:07,054 INFO L85 PathProgramCache]: Analyzing trace with hash -409396268, now seen corresponding path program 1 times [2025-03-04 04:24:07,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:07,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754686474] [2025-03-04 04:24:07,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:07,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 04:24:07,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 04:24:07,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:07,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754686474] [2025-03-04 04:24:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754686474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436467379] [2025-03-04 04:24:07,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:07,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:07,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:07,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:07,670 INFO L87 Difference]: Start difference. First operand 1459 states and 1906 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:07,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:07,747 INFO L93 Difference]: Finished difference Result 1461 states and 1907 transitions. [2025-03-04 04:24:07,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:07,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 174 [2025-03-04 04:24:07,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:07,758 INFO L225 Difference]: With dead ends: 1461 [2025-03-04 04:24:07,758 INFO L226 Difference]: Without dead ends: 1458 [2025-03-04 04:24:07,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:07,762 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 663 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:07,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 705 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:24:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-03-04 04:24:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2025-03-04 04:24:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1458 states, 1058 states have (on average 1.287334593572779) internal successors, (1362), 1095 states have internal predecessors, (1362), 270 states have call successors, (270), 132 states have call predecessors, (270), 129 states have return successors, (272), 256 states have call predecessors, (272), 264 states have call successors, (272) [2025-03-04 04:24:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1904 transitions. [2025-03-04 04:24:07,830 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1904 transitions. Word has length 174 [2025-03-04 04:24:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:07,831 INFO L471 AbstractCegarLoop]: Abstraction has 1458 states and 1904 transitions. [2025-03-04 04:24:07,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1904 transitions. [2025-03-04 04:24:07,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 04:24:07,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:07,833 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:07,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:24:07,833 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:07,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:07,834 INFO L85 PathProgramCache]: Analyzing trace with hash 298758193, now seen corresponding path program 1 times [2025-03-04 04:24:07,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584232924] [2025-03-04 04:24:07,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:08,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 04:24:08,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 04:24:08,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:08,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584232924] [2025-03-04 04:24:08,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584232924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:08,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:08,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:08,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908806435] [2025-03-04 04:24:08,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:08,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:08,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:08,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:08,393 INFO L87 Difference]: Start difference. First operand 1458 states and 1904 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:24:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:08,641 INFO L93 Difference]: Finished difference Result 3769 states and 4898 transitions. [2025-03-04 04:24:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 178 [2025-03-04 04:24:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:08,657 INFO L225 Difference]: With dead ends: 3769 [2025-03-04 04:24:08,657 INFO L226 Difference]: Without dead ends: 2357 [2025-03-04 04:24:08,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:08,664 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 548 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:08,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1707 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states. [2025-03-04 04:24:08,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 2330. [2025-03-04 04:24:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2330 states, 1717 states have (on average 1.2935352358765289) internal successors, (2221), 1762 states have internal predecessors, (2221), 396 states have call successors, (396), 219 states have call predecessors, (396), 216 states have return successors, (404), 382 states have call predecessors, (404), 390 states have call successors, (404) [2025-03-04 04:24:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2330 states to 2330 states and 3021 transitions. [2025-03-04 04:24:08,808 INFO L78 Accepts]: Start accepts. Automaton has 2330 states and 3021 transitions. Word has length 178 [2025-03-04 04:24:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:08,810 INFO L471 AbstractCegarLoop]: Abstraction has 2330 states and 3021 transitions. [2025-03-04 04:24:08,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 04:24:08,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2330 states and 3021 transitions. [2025-03-04 04:24:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 04:24:08,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:08,812 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:08,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:24:08,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:08,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash 193064869, now seen corresponding path program 1 times [2025-03-04 04:24:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:08,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399176463] [2025-03-04 04:24:08,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:09,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 04:24:09,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 04:24:09,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:09,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:09,453 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:09,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399176463] [2025-03-04 04:24:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399176463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:09,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:09,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419013002] [2025-03-04 04:24:09,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:09,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:09,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:09,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:09,455 INFO L87 Difference]: Start difference. First operand 2330 states and 3021 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:09,538 INFO L93 Difference]: Finished difference Result 2332 states and 3022 transitions. [2025-03-04 04:24:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 175 [2025-03-04 04:24:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:09,549 INFO L225 Difference]: With dead ends: 2332 [2025-03-04 04:24:09,550 INFO L226 Difference]: Without dead ends: 2329 [2025-03-04 04:24:09,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:09,551 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 660 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:09,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 703 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:24:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-03-04 04:24:09,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 2329. [2025-03-04 04:24:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2329 states, 1717 states have (on average 1.2929528246942341) internal successors, (2220), 1761 states have internal predecessors, (2220), 395 states have call successors, (395), 219 states have call predecessors, (395), 216 states have return successors, (404), 382 states have call predecessors, (404), 390 states have call successors, (404) [2025-03-04 04:24:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3019 transitions. [2025-03-04 04:24:09,654 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3019 transitions. Word has length 175 [2025-03-04 04:24:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:09,655 INFO L471 AbstractCegarLoop]: Abstraction has 2329 states and 3019 transitions. [2025-03-04 04:24:09,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3019 transitions. [2025-03-04 04:24:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 04:24:09,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:09,656 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:09,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:24:09,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:09,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1689489909, now seen corresponding path program 1 times [2025-03-04 04:24:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:09,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602433309] [2025-03-04 04:24:09,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:09,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:10,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 04:24:10,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 04:24:10,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:10,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2025-03-04 04:24:10,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602433309] [2025-03-04 04:24:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602433309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041702216] [2025-03-04 04:24:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:10,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:10,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:10,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:10,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:10,181 INFO L87 Difference]: Start difference. First operand 2329 states and 3019 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:10,396 INFO L93 Difference]: Finished difference Result 6413 states and 8465 transitions. [2025-03-04 04:24:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:10,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 176 [2025-03-04 04:24:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:10,418 INFO L225 Difference]: With dead ends: 6413 [2025-03-04 04:24:10,419 INFO L226 Difference]: Without dead ends: 4126 [2025-03-04 04:24:10,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:10,427 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 644 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:10,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1414 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4126 states. [2025-03-04 04:24:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4126 to 4084. [2025-03-04 04:24:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4084 states, 3075 states have (on average 1.3095934959349593) internal successors, (4027), 3158 states have internal predecessors, (4027), 659 states have call successors, (659), 363 states have call predecessors, (659), 349 states have return successors, (717), 622 states have call predecessors, (717), 651 states have call successors, (717) [2025-03-04 04:24:10,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4084 states to 4084 states and 5403 transitions. [2025-03-04 04:24:10,619 INFO L78 Accepts]: Start accepts. Automaton has 4084 states and 5403 transitions. Word has length 176 [2025-03-04 04:24:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:10,620 INFO L471 AbstractCegarLoop]: Abstraction has 4084 states and 5403 transitions. [2025-03-04 04:24:10,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-04 04:24:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4084 states and 5403 transitions. [2025-03-04 04:24:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-04 04:24:10,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:10,623 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:10,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:24:10,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:10,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash 299055092, now seen corresponding path program 1 times [2025-03-04 04:24:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843199173] [2025-03-04 04:24:10,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:11,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 04:24:11,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 04:24:11,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:11,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2025-03-04 04:24:11,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:11,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843199173] [2025-03-04 04:24:11,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843199173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:11,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:11,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:11,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002812888] [2025-03-04 04:24:11,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:11,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:11,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:11,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:11,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:11,236 INFO L87 Difference]: Start difference. First operand 4084 states and 5403 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 04:24:15,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:24:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:15,673 INFO L93 Difference]: Finished difference Result 9760 states and 12931 transitions. [2025-03-04 04:24:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:15,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 230 [2025-03-04 04:24:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:15,705 INFO L225 Difference]: With dead ends: 9760 [2025-03-04 04:24:15,705 INFO L226 Difference]: Without dead ends: 5726 [2025-03-04 04:24:15,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:15,719 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 599 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:15,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1692 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:24:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2025-03-04 04:24:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 5678. [2025-03-04 04:24:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5678 states, 4327 states have (on average 1.3143055234573608) internal successors, (5687), 4422 states have internal predecessors, (5687), 863 states have call successors, (863), 505 states have call predecessors, (863), 487 states have return successors, (949), 822 states have call predecessors, (949), 855 states have call successors, (949) [2025-03-04 04:24:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5678 states to 5678 states and 7499 transitions. [2025-03-04 04:24:16,097 INFO L78 Accepts]: Start accepts. Automaton has 5678 states and 7499 transitions. Word has length 230 [2025-03-04 04:24:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:16,098 INFO L471 AbstractCegarLoop]: Abstraction has 5678 states and 7499 transitions. [2025-03-04 04:24:16,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-04 04:24:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5678 states and 7499 transitions. [2025-03-04 04:24:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-04 04:24:16,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:16,107 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:16,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 04:24:16,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:16,108 INFO L85 PathProgramCache]: Analyzing trace with hash 640899518, now seen corresponding path program 1 times [2025-03-04 04:24:16,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:16,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248065079] [2025-03-04 04:24:16,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:16,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:16,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-04 04:24:16,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 04:24:16,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:16,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-04 04:24:16,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:16,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248065079] [2025-03-04 04:24:16,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248065079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:16,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:16,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:24:16,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226605572] [2025-03-04 04:24:16,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:16,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:24:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:16,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:24:16,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:24:16,968 INFO L87 Difference]: Start difference. First operand 5678 states and 7499 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:20,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:24:21,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:21,410 INFO L93 Difference]: Finished difference Result 13636 states and 17961 transitions. [2025-03-04 04:24:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:24:21,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 260 [2025-03-04 04:24:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:21,463 INFO L225 Difference]: With dead ends: 13636 [2025-03-04 04:24:21,463 INFO L226 Difference]: Without dead ends: 8008 [2025-03-04 04:24:21,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:24:21,479 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 617 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:21,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 3320 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 04:24:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8008 states. [2025-03-04 04:24:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8008 to 5694. [2025-03-04 04:24:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 4343 states have (on average 1.3131475938291504) internal successors, (5703), 4438 states have internal predecessors, (5703), 863 states have call successors, (863), 505 states have call predecessors, (863), 487 states have return successors, (949), 822 states have call predecessors, (949), 855 states have call successors, (949) [2025-03-04 04:24:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 7515 transitions. [2025-03-04 04:24:21,714 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 7515 transitions. Word has length 260 [2025-03-04 04:24:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:21,715 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 7515 transitions. [2025-03-04 04:24:21,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 7515 transitions. [2025-03-04 04:24:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-04 04:24:21,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:21,719 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:21,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 04:24:21,719 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:21,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1517634192, now seen corresponding path program 1 times [2025-03-04 04:24:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:21,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788069568] [2025-03-04 04:24:21,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:22,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-04 04:24:22,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 04:24:22,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:22,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-04 04:24:22,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:22,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788069568] [2025-03-04 04:24:22,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788069568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:22,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:22,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336133740] [2025-03-04 04:24:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:22,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:22,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:22,274 INFO L87 Difference]: Start difference. First operand 5694 states and 7515 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:22,496 INFO L93 Difference]: Finished difference Result 11338 states and 14987 transitions. [2025-03-04 04:24:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:22,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 260 [2025-03-04 04:24:22,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:22,525 INFO L225 Difference]: With dead ends: 11338 [2025-03-04 04:24:22,526 INFO L226 Difference]: Without dead ends: 5694 [2025-03-04 04:24:22,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:22,542 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 0 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1390 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:24:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5694 states. [2025-03-04 04:24:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5694 to 5694. [2025-03-04 04:24:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5694 states, 4343 states have (on average 1.302095325811651) internal successors, (5655), 4438 states have internal predecessors, (5655), 863 states have call successors, (863), 505 states have call predecessors, (863), 487 states have return successors, (949), 822 states have call predecessors, (949), 855 states have call successors, (949) [2025-03-04 04:24:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5694 states to 5694 states and 7467 transitions. [2025-03-04 04:24:22,784 INFO L78 Accepts]: Start accepts. Automaton has 5694 states and 7467 transitions. Word has length 260 [2025-03-04 04:24:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 5694 states and 7467 transitions. [2025-03-04 04:24:22,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 5694 states and 7467 transitions. [2025-03-04 04:24:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-04 04:24:22,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:22,787 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:22,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 04:24:22,788 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1457035947, now seen corresponding path program 1 times [2025-03-04 04:24:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429244863] [2025-03-04 04:24:22,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:22,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:23,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 04:24:23,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 04:24:23,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:23,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-04 04:24:23,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429244863] [2025-03-04 04:24:23,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429244863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:23,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:23,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139013009] [2025-03-04 04:24:23,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:23,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:23,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:23,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:23,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:23,395 INFO L87 Difference]: Start difference. First operand 5694 states and 7467 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:27,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:24:27,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:27,648 INFO L93 Difference]: Finished difference Result 11340 states and 14872 transitions. [2025-03-04 04:24:27,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:27,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 262 [2025-03-04 04:24:27,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:27,667 INFO L225 Difference]: With dead ends: 11340 [2025-03-04 04:24:27,668 INFO L226 Difference]: Without dead ends: 5696 [2025-03-04 04:24:27,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:27,681 INFO L435 NwaCegarLoop]: 1023 mSDtfsCounter, 553 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:27,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1686 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:24:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5696 states. [2025-03-04 04:24:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5696 to 5567. [2025-03-04 04:24:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5567 states, 4265 states have (on average 1.3010550996483001) internal successors, (5549), 4352 states have internal predecessors, (5549), 822 states have call successors, (822), 479 states have call predecessors, (822), 479 states have return successors, (846), 807 states have call predecessors, (846), 802 states have call successors, (846) [2025-03-04 04:24:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 7217 transitions. [2025-03-04 04:24:27,869 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 7217 transitions. Word has length 262 [2025-03-04 04:24:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:27,870 INFO L471 AbstractCegarLoop]: Abstraction has 5567 states and 7217 transitions. [2025-03-04 04:24:27,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (27), 3 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 7217 transitions. [2025-03-04 04:24:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-04 04:24:27,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:27,872 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:27,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 04:24:27,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:27,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:27,873 INFO L85 PathProgramCache]: Analyzing trace with hash 177172269, now seen corresponding path program 1 times [2025-03-04 04:24:27,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:27,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101852702] [2025-03-04 04:24:27,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:27,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:28,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-04 04:24:28,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-04 04:24:28,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:28,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-04 04:24:28,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:28,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101852702] [2025-03-04 04:24:28,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101852702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:28,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:28,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:24:28,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978708951] [2025-03-04 04:24:28,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:28,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:24:28,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:28,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:24:28,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:24:28,601 INFO L87 Difference]: Start difference. First operand 5567 states and 7217 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:28,816 INFO L93 Difference]: Finished difference Result 5594 states and 7253 transitions. [2025-03-04 04:24:28,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:24:28,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 262 [2025-03-04 04:24:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:28,833 INFO L225 Difference]: With dead ends: 5594 [2025-03-04 04:24:28,834 INFO L226 Difference]: Without dead ends: 5572 [2025-03-04 04:24:28,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:24:28,836 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 1 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:28,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2803 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:28,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2025-03-04 04:24:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5558. [2025-03-04 04:24:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5558 states, 4261 states have (on average 1.3003989673785497) internal successors, (5541), 4345 states have internal predecessors, (5541), 818 states have call successors, (818), 478 states have call predecessors, (818), 478 states have return successors, (843), 806 states have call predecessors, (843), 799 states have call successors, (843) [2025-03-04 04:24:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 7202 transitions. [2025-03-04 04:24:29,039 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 7202 transitions. Word has length 262 [2025-03-04 04:24:29,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:29,040 INFO L471 AbstractCegarLoop]: Abstraction has 5558 states and 7202 transitions. [2025-03-04 04:24:29,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 04:24:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 7202 transitions. [2025-03-04 04:24:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-04 04:24:29,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:29,043 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:29,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 04:24:29,044 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:29,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1095820269, now seen corresponding path program 1 times [2025-03-04 04:24:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:29,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994272094] [2025-03-04 04:24:29,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:29,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-04 04:24:29,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-04 04:24:29,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:29,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2025-03-04 04:24:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:29,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994272094] [2025-03-04 04:24:29,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994272094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:29,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:29,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:24:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454479127] [2025-03-04 04:24:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:29,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:24:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:29,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:24:29,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:24:29,709 INFO L87 Difference]: Start difference. First operand 5558 states and 7202 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:24:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:29,933 INFO L93 Difference]: Finished difference Result 11052 states and 14329 transitions. [2025-03-04 04:24:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:24:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 295 [2025-03-04 04:24:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:29,953 INFO L225 Difference]: With dead ends: 11052 [2025-03-04 04:24:29,954 INFO L226 Difference]: Without dead ends: 5544 [2025-03-04 04:24:29,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:24:29,966 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 0 mSDsluCounter, 2075 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2772 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:29,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2772 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2025-03-04 04:24:30,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 5544. [2025-03-04 04:24:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5544 states, 4255 states have (on average 1.299882491186839) internal successors, (5531), 4335 states have internal predecessors, (5531), 814 states have call successors, (814), 474 states have call predecessors, (814), 474 states have return successors, (839), 802 states have call predecessors, (839), 795 states have call successors, (839) [2025-03-04 04:24:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5544 states to 5544 states and 7184 transitions. [2025-03-04 04:24:30,147 INFO L78 Accepts]: Start accepts. Automaton has 5544 states and 7184 transitions. Word has length 295 [2025-03-04 04:24:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:30,148 INFO L471 AbstractCegarLoop]: Abstraction has 5544 states and 7184 transitions. [2025-03-04 04:24:30,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-04 04:24:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 5544 states and 7184 transitions. [2025-03-04 04:24:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-04 04:24:30,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:30,156 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:30,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 04:24:30,156 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1151127208, now seen corresponding path program 1 times [2025-03-04 04:24:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076432294] [2025-03-04 04:24:30,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:30,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-04 04:24:30,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-04 04:24:30,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:30,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2025-03-04 04:24:30,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:30,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076432294] [2025-03-04 04:24:30,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076432294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:30,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:30,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:24:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229011008] [2025-03-04 04:24:30,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:30,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:24:30,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:30,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:24:30,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:30,818 INFO L87 Difference]: Start difference. First operand 5544 states and 7184 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-04 04:24:34,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:24:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:35,518 INFO L93 Difference]: Finished difference Result 13079 states and 16888 transitions. [2025-03-04 04:24:35,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:24:35,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 352 [2025-03-04 04:24:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:35,550 INFO L225 Difference]: With dead ends: 13079 [2025-03-04 04:24:35,550 INFO L226 Difference]: Without dead ends: 7585 [2025-03-04 04:24:35,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:24:35,566 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 475 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 19 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:35,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1494 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:24:35,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7585 states. [2025-03-04 04:24:35,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7585 to 7271. [2025-03-04 04:24:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7271 states, 5673 states have (on average 1.2943768729067513) internal successors, (7343), 5781 states have internal predecessors, (7343), 948 states have call successors, (948), 642 states have call predecessors, (948), 649 states have return successors, (983), 932 states have call predecessors, (983), 927 states have call successors, (983) [2025-03-04 04:24:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7271 states to 7271 states and 9274 transitions. [2025-03-04 04:24:35,823 INFO L78 Accepts]: Start accepts. Automaton has 7271 states and 9274 transitions. Word has length 352 [2025-03-04 04:24:35,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:35,825 INFO L471 AbstractCegarLoop]: Abstraction has 7271 states and 9274 transitions. [2025-03-04 04:24:35,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-03-04 04:24:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7271 states and 9274 transitions. [2025-03-04 04:24:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-04 04:24:35,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:35,831 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:35,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 04:24:35,831 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:35,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash 478801032, now seen corresponding path program 1 times [2025-03-04 04:24:35,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:35,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996022169] [2025-03-04 04:24:35,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:35,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:36,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-04 04:24:36,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-04 04:24:36,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:36,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-03-04 04:24:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:36,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996022169] [2025-03-04 04:24:36,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996022169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:36,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:36,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:24:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715861404] [2025-03-04 04:24:36,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:36,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:24:36,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:36,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:24:36,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:36,848 INFO L87 Difference]: Start difference. First operand 7271 states and 9274 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-04 04:24:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:37,096 INFO L93 Difference]: Finished difference Result 7342 states and 9362 transitions. [2025-03-04 04:24:37,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:24:37,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 351 [2025-03-04 04:24:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:37,117 INFO L225 Difference]: With dead ends: 7342 [2025-03-04 04:24:37,117 INFO L226 Difference]: Without dead ends: 7236 [2025-03-04 04:24:37,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:37,119 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 1 mSDsluCounter, 2794 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3497 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:37,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3497 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2025-03-04 04:24:37,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 7188. [2025-03-04 04:24:37,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7188 states, 5599 states have (on average 1.2884443650651902) internal successors, (7214), 5706 states have internal predecessors, (7214), 940 states have call successors, (940), 641 states have call predecessors, (940), 648 states have return successors, (976), 925 states have call predecessors, (976), 920 states have call successors, (976) [2025-03-04 04:24:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7188 states to 7188 states and 9130 transitions. [2025-03-04 04:24:37,364 INFO L78 Accepts]: Start accepts. Automaton has 7188 states and 9130 transitions. Word has length 351 [2025-03-04 04:24:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 7188 states and 9130 transitions. [2025-03-04 04:24:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 5 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-04 04:24:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 7188 states and 9130 transitions. [2025-03-04 04:24:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-04 04:24:37,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:37,373 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:37,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 04:24:37,374 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:37,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1667630284, now seen corresponding path program 1 times [2025-03-04 04:24:37,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:37,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545528035] [2025-03-04 04:24:37,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:37,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:38,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-04 04:24:38,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-04 04:24:38,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:38,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:38,631 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-03-04 04:24:38,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:38,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545528035] [2025-03-04 04:24:38,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545528035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:38,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:38,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:24:38,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137743897] [2025-03-04 04:24:38,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:38,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:24:38,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:38,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:24:38,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:38,634 INFO L87 Difference]: Start difference. First operand 7188 states and 9130 transitions. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-04 04:24:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:38,960 INFO L93 Difference]: Finished difference Result 7296 states and 9247 transitions. [2025-03-04 04:24:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:24:38,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 358 [2025-03-04 04:24:38,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:38,982 INFO L225 Difference]: With dead ends: 7296 [2025-03-04 04:24:38,982 INFO L226 Difference]: Without dead ends: 6962 [2025-03-04 04:24:38,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:38,985 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 1 mSDsluCounter, 2786 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:38,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3487 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states. [2025-03-04 04:24:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 6938. [2025-03-04 04:24:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6938 states, 5414 states have (on average 1.287587735500554) internal successors, (6971), 5511 states have internal predecessors, (6971), 894 states have call successors, (894), 621 states have call predecessors, (894), 629 states have return successors, (932), 885 states have call predecessors, (932), 876 states have call successors, (932) [2025-03-04 04:24:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 8797 transitions. [2025-03-04 04:24:39,220 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 8797 transitions. Word has length 358 [2025-03-04 04:24:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:39,221 INFO L471 AbstractCegarLoop]: Abstraction has 6938 states and 8797 transitions. [2025-03-04 04:24:39,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 5 states have internal predecessors, (148), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-04 04:24:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 8797 transitions. [2025-03-04 04:24:39,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-04 04:24:39,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:39,230 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:39,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 04:24:39,231 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:39,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1918763431, now seen corresponding path program 1 times [2025-03-04 04:24:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052484725] [2025-03-04 04:24:39,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:39,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-04 04:24:39,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-04 04:24:39,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:39,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-03-04 04:24:40,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:40,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052484725] [2025-03-04 04:24:40,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052484725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:40,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:40,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:24:40,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887744212] [2025-03-04 04:24:40,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:40,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:24:40,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:40,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:24:40,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:40,157 INFO L87 Difference]: Start difference. First operand 6938 states and 8797 transitions. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 04:24:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:40,472 INFO L93 Difference]: Finished difference Result 13952 states and 17777 transitions. [2025-03-04 04:24:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:24:40,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 1 states have call successors, (35) Word has length 364 [2025-03-04 04:24:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:40,494 INFO L225 Difference]: With dead ends: 13952 [2025-03-04 04:24:40,494 INFO L226 Difference]: Without dead ends: 7064 [2025-03-04 04:24:40,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:40,507 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 15 mSDsluCounter, 2781 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3480 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:40,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3480 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7064 states. [2025-03-04 04:24:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7064 to 7016. [2025-03-04 04:24:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 5492 states have (on average 1.2900582665695557) internal successors, (7085), 5589 states have internal predecessors, (7085), 906 states have call successors, (906), 621 states have call predecessors, (906), 617 states have return successors, (932), 885 states have call predecessors, (932), 888 states have call successors, (932) [2025-03-04 04:24:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 8923 transitions. [2025-03-04 04:24:40,749 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 8923 transitions. Word has length 364 [2025-03-04 04:24:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:40,749 INFO L471 AbstractCegarLoop]: Abstraction has 7016 states and 8923 transitions. [2025-03-04 04:24:40,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 5 states have internal predecessors, (153), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (35), 3 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 04:24:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 8923 transitions. [2025-03-04 04:24:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-04 04:24:40,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:24:40,761 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:40,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 04:24:40,761 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:24:40,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:24:40,762 INFO L85 PathProgramCache]: Analyzing trace with hash 44758167, now seen corresponding path program 1 times [2025-03-04 04:24:40,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:24:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591816976] [2025-03-04 04:24:40,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:24:40,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:24:41,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-04 04:24:41,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-04 04:24:41,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:24:41,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:24:41,781 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2025-03-04 04:24:41,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:24:41,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591816976] [2025-03-04 04:24:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591816976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:24:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:24:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 04:24:41,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722171767] [2025-03-04 04:24:41,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:24:41,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 04:24:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:24:41,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 04:24:41,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:41,783 INFO L87 Difference]: Start difference. First operand 7016 states and 8923 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-04 04:24:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:24:41,976 INFO L93 Difference]: Finished difference Result 7146 states and 9055 transitions. [2025-03-04 04:24:41,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 04:24:41,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) Word has length 366 [2025-03-04 04:24:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:24:41,983 INFO L225 Difference]: With dead ends: 7146 [2025-03-04 04:24:41,983 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 04:24:41,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:24:41,991 INFO L435 NwaCegarLoop]: 683 mSDtfsCounter, 28 mSDsluCounter, 2682 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3365 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:24:41,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3365 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:24:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 04:24:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 04:24:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 04:24:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 04:24:42,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 366 [2025-03-04 04:24:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:24:42,002 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 04:24:42,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-04 04:24:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 04:24:42,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 04:24:42,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 04:24:42,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 04:24:42,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 04:24:42,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.