./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.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 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:58:49,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:58:49,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:58:49,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:58:49,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:58:49,848 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:58:49,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:58:49,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:58:49,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:58:49,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:58:49,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:58:49,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:58:49,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:58:49,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:58:49,851 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:58:49,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:58:49,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:58:49,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:58:49,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:58:49,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:58:49,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:58:49,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:58:49,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:58:49,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:58:49,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:58:49,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:58:49,854 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 -> 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 [2025-03-04 03:58:50,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:58:50,095 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:58:50,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:58:50,098 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:58:50,098 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:58:50,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2025-03-04 03:58:51,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dc9e70a/923d4bb25b704f3f89c2b9b1ffc15b28/FLAG3daf8138a [2025-03-04 03:58:51,694 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:58:51,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2025-03-04 03:58:51,726 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dc9e70a/923d4bb25b704f3f89c2b9b1ffc15b28/FLAG3daf8138a [2025-03-04 03:58:51,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41dc9e70a/923d4bb25b704f3f89c2b9b1ffc15b28 [2025-03-04 03:58:51,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:58:51,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:58:51,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:58:51,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:58:51,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:58:51,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:51" (1/1) ... [2025-03-04 03:58:51,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300274c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:51, skipping insertion in model container [2025-03-04 03:58:51,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:51" (1/1) ... [2025-03-04 03:58:51,937 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:58:52,711 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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2025-03-04 03:58:53,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:58:53,215 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:58:53,351 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5402] [2025-03-04 03:58:53,355 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; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5440] [2025-03-04 03:58:53,355 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; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5447] [2025-03-04 03:58:53,356 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; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5455-5456] [2025-03-04 03:58:53,357 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; incl %0": "+m" (v->counter)); [5484] [2025-03-04 03:58:53,357 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; decl %0": "+m" (v->counter)); [5491] [2025-03-04 03:58:53,365 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-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2025-03-04 03:58:53,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6228/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/usb_8dev.o.c.prepared"), "i" (621), "i" (12UL)); [6324-6325] [2025-03-04 03:58:53,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:58:53,514 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:58:53,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53 WrapperNode [2025-03-04 03:58:53,516 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:58:53,517 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:58:53,517 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:58:53,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:58:53,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,667 INFO L138 Inliner]: procedures = 174, calls = 830, calls flagged for inlining = 87, calls inlined = 87, statements flattened = 2590 [2025-03-04 03:58:53,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:58:53,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:58:53,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:58:53,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:58:53,676 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,900 INFO L175 MemorySlicer]: Split 464 memory accesses to 8 slices as follows [2, 31, 1, 5, 44, 31, 9, 341]. 73 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 26]. The 249 writes are split as follows [0, 0, 0, 1, 44, 18, 0, 186]. [2025-03-04 03:58:53,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,966 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:53,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:58:54,023 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:58:54,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:58:54,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:58:54,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (1/1) ... [2025-03-04 03:58:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:58:54,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:58:54,054 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 03:58:54,060 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 03:58:54,076 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-04 03:58:54,077 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-04 03:58:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-04 03:58:54,077 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-04 03:58:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2025-03-04 03:58:54,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2025-03-04 03:58:54,077 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2025-03-04 03:58:54,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2025-03-04 03:58:54,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:58:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:58:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:58:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:58:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:58:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:58:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:58:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-04 03:58:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-04 03:58:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 03:58:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-04 03:58:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-03-04 03:58:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-03-04 03:58:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:58:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:58:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 03:58:54,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 03:58:54,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-04 03:58:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:58:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:58:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:58:54,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 03:58:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-04 03:58:54,083 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-04 03:58:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-04 03:58:54,085 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-04 03:58:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:58:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:58:54,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-04 03:58:54,086 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-03-04 03:58:54,086 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-04 03:58:54,086 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2025-03-04 03:58:54,086 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2025-03-04 03:58:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:58:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2025-03-04 03:58:54,088 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2025-03-04 03:58:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-03-04 03:58:54,088 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-03-04 03:58:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-04 03:58:54,088 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:58:54,089 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2025-03-04 03:58:54,089 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2025-03-04 03:58:54,517 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:58:54,520 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:58:54,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7476: havoc #t~nondet487; [2025-03-04 03:58:54,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 03:58:54,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5463: havoc constant_test_bit_#t~mem14#1;havoc constant_test_bit_#t~bitwise15#1; [2025-03-04 03:58:54,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5570: havoc #t~mem63;havoc #t~bitwise64; [2025-03-04 03:58:55,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7370: havoc alloc_can_err_skb_#t~ret471#1.base, alloc_can_err_skb_#t~ret471#1.offset; [2025-03-04 03:58:55,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6198: call ULTIMATE.dealloc(usb_8dev_rx_can_msg_~#cf~1#1.base, usb_8dev_rx_can_msg_~#cf~1#1.offset);havoc usb_8dev_rx_can_msg_~#cf~1#1.base, usb_8dev_rx_can_msg_~#cf~1#1.offset; [2025-03-04 03:58:55,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6084: call ULTIMATE.dealloc(usb_8dev_rx_err_msg_~#cf~0#1.base, usb_8dev_rx_err_msg_~#cf~0#1.offset);havoc usb_8dev_rx_err_msg_~#cf~0#1.base, usb_8dev_rx_err_msg_~#cf~0#1.offset; [2025-03-04 03:58:55,096 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc alloc_can_skb_#t~ret472#1.base, alloc_can_skb_#t~ret472#1.offset; [2025-03-04 03:58:55,115 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5527: call ULTIMATE.dealloc(~#__key~0#1.base, ~#__key~0#1.offset);havoc ~#__key~0#1.base, ~#__key~0#1.offset;call ULTIMATE.dealloc(~#__key___0~0#1.base, ~#__key___0~0#1.offset);havoc ~#__key___0~0#1.base, ~#__key___0~0#1.offset; [2025-03-04 03:58:55,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7459: havoc printk_#t~nondet484#1; [2025-03-04 03:58:55,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc #t~nondet478; [2025-03-04 03:58:55,416 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-03-04 03:58:55,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7451: havoc netpoll_trap_#t~nondet482#1; [2025-03-04 03:58:55,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7386: havoc can_get_echo_skb_#t~nondet474#1; [2025-03-04 03:58:55,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~ret486.base, #t~ret486.offset; [2025-03-04 03:58:55,624 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7447: havoc #t~nondet481; [2025-03-04 03:58:55,647 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7440: havoc #t~nondet480; [2025-03-04 03:58:55,654 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc #t~mem79.base, #t~mem79.offset; [2025-03-04 03:58:55,657 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7436: havoc #t~nondet479; [2025-03-04 03:58:55,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5867: call ULTIMATE.dealloc(usb_8dev_send_cmd_msg_~#actual_length~0#1.base, usb_8dev_send_cmd_msg_~#actual_length~0#1.offset);havoc usb_8dev_send_cmd_msg_~#actual_length~0#1.base, usb_8dev_send_cmd_msg_~#actual_length~0#1.offset; [2025-03-04 03:58:55,728 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5893: call ULTIMATE.dealloc(~#num_bytes_read~0#1.base, ~#num_bytes_read~0#1.offset);havoc ~#num_bytes_read~0#1.base, ~#num_bytes_read~0#1.offset; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7402: havoc dev_err_#t~nondet475#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7376: havoc alloc_candev_#t~ret473#1.base, alloc_candev_#t~ret473#1.offset; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6027: call ULTIMATE.dealloc(usb_8dev_cmd_version_~#inmsg~2#1.base, usb_8dev_cmd_version_~#inmsg~2#1.offset);havoc usb_8dev_cmd_version_~#inmsg~2#1.base, usb_8dev_cmd_version_~#inmsg~2#1.offset;call ULTIMATE.dealloc(usb_8dev_cmd_version_~#outmsg~2#1.base, usb_8dev_cmd_version_~#outmsg~2#1.offset);havoc usb_8dev_cmd_version_~#outmsg~2#1.base, usb_8dev_cmd_version_~#outmsg~2#1.offset; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc ldv_ndo_init_2_#t~nondet476#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc atomic_read_#t~mem19#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6001: call ULTIMATE.dealloc(usb_8dev_cmd_close_~#inmsg~1#1.base, usb_8dev_cmd_close_~#inmsg~1#1.offset);havoc usb_8dev_cmd_close_~#inmsg~1#1.base, usb_8dev_cmd_close_~#inmsg~1#1.offset;call ULTIMATE.dealloc(usb_8dev_cmd_close_~#outmsg~1#1.base, usb_8dev_cmd_close_~#outmsg~1#1.offset);havoc usb_8dev_cmd_close_~#outmsg~1#1.base, usb_8dev_cmd_close_~#outmsg~1#1.offset; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6662: call ULTIMATE.dealloc(usb_8dev_probe_~#version~0#1.base, usb_8dev_probe_~#version~0#1.offset);havoc usb_8dev_probe_~#version~0#1.base, usb_8dev_probe_~#version~0#1.offset;call ULTIMATE.dealloc(usb_8dev_probe_~#buf~2#1.base, usb_8dev_probe_~#buf~2#1.offset);havoc usb_8dev_probe_~#buf~2#1.base, usb_8dev_probe_~#buf~2#1.offset;call ULTIMATE.dealloc(usb_8dev_probe_~#__key~1#1.base, usb_8dev_probe_~#__key~1#1.offset);havoc usb_8dev_probe_~#__key~1#1.base, usb_8dev_probe_~#__key~1#1.offset; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7422: havoc ldv_ndo_uninit_2_#t~nondet477#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: havoc open_candev_#t~nondet483#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7489: havoc usb_register_driver_#t~nondet488#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7493: havoc usb_string_#t~nondet489#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7463: havoc register_candev_#t~nondet485#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7367: havoc _dev_info_#t~nondet470#1; [2025-03-04 03:59:02,521 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5584: havoc __kmalloc_#t~ret67#1.base, __kmalloc_#t~ret67#1.offset; [2025-03-04 03:59:02,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5941: call ULTIMATE.dealloc(~#outmsg~0#1.base, ~#outmsg~0#1.offset);havoc ~#outmsg~0#1.base, ~#outmsg~0#1.offset;call ULTIMATE.dealloc(~#inmsg~0#1.base, ~#inmsg~0#1.offset);havoc ~#inmsg~0#1.base, ~#inmsg~0#1.offset;call ULTIMATE.dealloc(~#beflags~0#1.base, ~#beflags~0#1.offset);havoc ~#beflags~0#1.base, ~#beflags~0#1.offset;call ULTIMATE.dealloc(~#bebrp~0#1.base, ~#bebrp~0#1.offset);havoc ~#bebrp~0#1.base, ~#bebrp~0#1.offset; [2025-03-04 03:59:02,862 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409: havoc __fswab16_#t~bitwise9#1; [2025-03-04 03:59:03,087 INFO L? ?]: Removed 1198 outVars from TransFormulas that were not future-live. [2025-03-04 03:59:03,087 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:59:03,139 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:59:03,140 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 03:59:03,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:59:03 BoogieIcfgContainer [2025-03-04 03:59:03,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:59:03,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:59:03,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:59:03,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:59:03,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:58:51" (1/3) ... [2025-03-04 03:59:03,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da06f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:59:03, skipping insertion in model container [2025-03-04 03:59:03,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:53" (2/3) ... [2025-03-04 03:59:03,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da06f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:59:03, skipping insertion in model container [2025-03-04 03:59:03,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:59:03" (3/3) ... [2025-03-04 03:59:03,149 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2025-03-04 03:59:03,161 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:59:03,163 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i that has 62 procedures, 876 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-03-04 03:59:03,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:59:03,233 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;@3444b40d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:59:03,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:59:03,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 811 states, 609 states have (on average 1.3464696223316912) internal successors, (820), 629 states have internal predecessors, (820), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2025-03-04 03:59:03,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 03:59:03,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:03,245 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:59:03,245 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash 553437365, now seen corresponding path program 1 times [2025-03-04 03:59:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:03,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454793663] [2025-03-04 03:59:03,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:04,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 03:59:04,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 03:59:04,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:04,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 03:59:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454793663] [2025-03-04 03:59:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454793663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:05,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:05,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661688488] [2025-03-04 03:59:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:05,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:05,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:05,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:05,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:05,106 INFO L87 Difference]: Start difference. First operand has 811 states, 609 states have (on average 1.3464696223316912) internal successors, (820), 629 states have internal predecessors, (820), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:59:09,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:59:09,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:09,854 INFO L93 Difference]: Finished difference Result 2389 states and 3367 transitions. [2025-03-04 03:59:09,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 03:59:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:09,883 INFO L225 Difference]: With dead ends: 2389 [2025-03-04 03:59:09,883 INFO L226 Difference]: Without dead ends: 1559 [2025-03-04 03:59:09,896 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 03:59:09,898 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 1048 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:09,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 2119 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 03:59:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-03-04 03:59:10,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-03-04 03:59:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1181 states have (on average 1.2963590177815412) internal successors, (1531), 1201 states have internal predecessors, (1531), 289 states have call successors, (289), 89 states have call predecessors, (289), 88 states have return successors, (284), 282 states have call predecessors, (284), 284 states have call successors, (284) [2025-03-04 03:59:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2104 transitions. [2025-03-04 03:59:10,057 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2104 transitions. Word has length 28 [2025-03-04 03:59:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:10,058 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2104 transitions. [2025-03-04 03:59:10,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:59:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2104 transitions. [2025-03-04 03:59:10,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 03:59:10,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:10,061 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 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 03:59:10,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:59:10,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:10,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:10,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1712736568, now seen corresponding path program 1 times [2025-03-04 03:59:10,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:10,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254149025] [2025-03-04 03:59:10,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:10,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:11,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 03:59:11,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 03:59:11,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:11,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:11,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:11,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:11,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254149025] [2025-03-04 03:59:11,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254149025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:11,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:11,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634683001] [2025-03-04 03:59:11,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:11,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:11,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:11,679 INFO L87 Difference]: Start difference. First operand 1559 states and 2104 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:12,495 INFO L93 Difference]: Finished difference Result 4662 states and 6317 transitions. [2025-03-04 03:59:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:12,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2025-03-04 03:59:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:12,513 INFO L225 Difference]: With dead ends: 4662 [2025-03-04 03:59:12,514 INFO L226 Difference]: Without dead ends: 3110 [2025-03-04 03:59:12,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:12,521 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 1047 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:12,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2573 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 03:59:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-03-04 03:59:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3100. [2025-03-04 03:59:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2352 states have (on average 1.2950680272108843) internal successors, (3046), 2388 states have internal predecessors, (3046), 571 states have call successors, (571), 177 states have call predecessors, (571), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-03-04 03:59:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4197 transitions. [2025-03-04 03:59:12,716 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4197 transitions. Word has length 38 [2025-03-04 03:59:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:12,717 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4197 transitions. [2025-03-04 03:59:12,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4197 transitions. [2025-03-04 03:59:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 03:59:12,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:12,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 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 03:59:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:59:12,721 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:12,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1554490554, now seen corresponding path program 1 times [2025-03-04 03:59:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755550237] [2025-03-04 03:59:12,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:13,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 03:59:13,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 03:59:13,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:13,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:14,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755550237] [2025-03-04 03:59:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755550237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:14,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:14,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228042695] [2025-03-04 03:59:14,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:14,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:14,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:14,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:14,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:14,325 INFO L87 Difference]: Start difference. First operand 3100 states and 4197 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:14,656 INFO L93 Difference]: Finished difference Result 3102 states and 4198 transitions. [2025-03-04 03:59:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:14,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-04 03:59:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:14,677 INFO L225 Difference]: With dead ends: 3102 [2025-03-04 03:59:14,677 INFO L226 Difference]: Without dead ends: 3099 [2025-03-04 03:59:14,680 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 03:59:14,681 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1048 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:14,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1042 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:59:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-03-04 03:59:14,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3099. [2025-03-04 03:59:14,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2352 states have (on average 1.2946428571428572) internal successors, (3045), 2387 states have internal predecessors, (3045), 570 states have call successors, (570), 177 states have call predecessors, (570), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-03-04 03:59:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4195 transitions. [2025-03-04 03:59:14,833 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4195 transitions. Word has length 39 [2025-03-04 03:59:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:14,834 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4195 transitions. [2025-03-04 03:59:14,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4195 transitions. [2025-03-04 03:59:14,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 03:59:14,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:14,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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 03:59:14,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:59:14,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:14,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 943830393, now seen corresponding path program 1 times [2025-03-04 03:59:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879633073] [2025-03-04 03:59:14,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:15,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 03:59:15,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 03:59:15,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:15,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:15,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:15,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879633073] [2025-03-04 03:59:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879633073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:15,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:15,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:15,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874386673] [2025-03-04 03:59:15,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:15,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:15,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:15,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:15,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:15,901 INFO L87 Difference]: Start difference. First operand 3099 states and 4195 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:16,269 INFO L93 Difference]: Finished difference Result 3101 states and 4196 transitions. [2025-03-04 03:59:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:16,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-04 03:59:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:16,287 INFO L225 Difference]: With dead ends: 3101 [2025-03-04 03:59:16,288 INFO L226 Difference]: Without dead ends: 3098 [2025-03-04 03:59:16,290 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 03:59:16,292 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 1045 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:16,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1040 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:59:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2025-03-04 03:59:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2025-03-04 03:59:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2352 states have (on average 1.2942176870748299) internal successors, (3044), 2386 states have internal predecessors, (3044), 569 states have call successors, (569), 177 states have call predecessors, (569), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-03-04 03:59:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4193 transitions. [2025-03-04 03:59:16,485 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4193 transitions. Word has length 40 [2025-03-04 03:59:16,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:16,487 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4193 transitions. [2025-03-04 03:59:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:16,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4193 transitions. [2025-03-04 03:59:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 03:59:16,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:16,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:16,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:59:16,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:16,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:16,492 INFO L85 PathProgramCache]: Analyzing trace with hash -806766437, now seen corresponding path program 1 times [2025-03-04 03:59:16,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:16,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488457395] [2025-03-04 03:59:16,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:16,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:17,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 03:59:17,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 03:59:17,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:17,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:17,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:17,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:17,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488457395] [2025-03-04 03:59:17,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488457395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:17,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:17,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863177072] [2025-03-04 03:59:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:17,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:17,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:17,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:17,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:17,686 INFO L87 Difference]: Start difference. First operand 3098 states and 4193 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:18,005 INFO L93 Difference]: Finished difference Result 3100 states and 4194 transitions. [2025-03-04 03:59:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:18,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-04 03:59:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:18,020 INFO L225 Difference]: With dead ends: 3100 [2025-03-04 03:59:18,021 INFO L226 Difference]: Without dead ends: 3097 [2025-03-04 03:59:18,024 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 03:59:18,025 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 1042 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:18,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1038 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:59:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2025-03-04 03:59:18,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3097. [2025-03-04 03:59:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2352 states have (on average 1.2937925170068028) internal successors, (3043), 2385 states have internal predecessors, (3043), 568 states have call successors, (568), 177 states have call predecessors, (568), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-03-04 03:59:18,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4191 transitions. [2025-03-04 03:59:18,169 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4191 transitions. Word has length 41 [2025-03-04 03:59:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:18,170 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4191 transitions. [2025-03-04 03:59:18,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4191 transitions. [2025-03-04 03:59:18,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 03:59:18,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:18,172 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:18,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:59:18,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:18,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash 759305658, now seen corresponding path program 1 times [2025-03-04 03:59:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:18,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904366754] [2025-03-04 03:59:18,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:19,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 03:59:19,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 03:59:19,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:19,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904366754] [2025-03-04 03:59:19,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904366754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:19,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:19,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352381439] [2025-03-04 03:59:19,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:19,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:19,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:19,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:19,276 INFO L87 Difference]: Start difference. First operand 3097 states and 4191 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:19,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:19,552 INFO L93 Difference]: Finished difference Result 3099 states and 4192 transitions. [2025-03-04 03:59:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:19,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 03:59:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:19,570 INFO L225 Difference]: With dead ends: 3099 [2025-03-04 03:59:19,570 INFO L226 Difference]: Without dead ends: 3087 [2025-03-04 03:59:19,573 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 03:59:19,574 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1039 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:19,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1037 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:59:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2025-03-04 03:59:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3087. [2025-03-04 03:59:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 2343 states have (on average 1.293213828425096) internal successors, (3030), 2375 states have internal predecessors, (3030), 567 states have call successors, (567), 177 states have call predecessors, (567), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-03-04 03:59:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4177 transitions. [2025-03-04 03:59:19,710 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4177 transitions. Word has length 42 [2025-03-04 03:59:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:19,712 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 4177 transitions. [2025-03-04 03:59:19,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 03:59:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4177 transitions. [2025-03-04 03:59:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 03:59:19,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:19,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 03:59:19,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:59:19,721 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:19,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:19,722 INFO L85 PathProgramCache]: Analyzing trace with hash 472691395, now seen corresponding path program 1 times [2025-03-04 03:59:19,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:19,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126645687] [2025-03-04 03:59:19,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:19,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:20,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 03:59:20,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 03:59:20,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:20,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:20,928 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 03:59:20,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:20,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126645687] [2025-03-04 03:59:20,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126645687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:20,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:20,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:20,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228902555] [2025-03-04 03:59:20,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:20,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:20,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:20,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:20,931 INFO L87 Difference]: Start difference. First operand 3087 states and 4177 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:59:21,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:21,533 INFO L93 Difference]: Finished difference Result 7080 states and 9490 transitions. [2025-03-04 03:59:21,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:21,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-03-04 03:59:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:21,552 INFO L225 Difference]: With dead ends: 7080 [2025-03-04 03:59:21,552 INFO L226 Difference]: Without dead ends: 4000 [2025-03-04 03:59:21,562 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 03:59:21,564 INFO L435 NwaCegarLoop]: 1125 mSDtfsCounter, 302 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 2131 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:21,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 2131 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:59:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2025-03-04 03:59:21,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3992. [2025-03-04 03:59:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3992 states, 3028 states have (on average 1.2793923381770145) internal successors, (3874), 3068 states have internal predecessors, (3874), 712 states have call successors, (712), 252 states have call predecessors, (712), 251 states have return successors, (725), 707 states have call predecessors, (725), 711 states have call successors, (725) [2025-03-04 03:59:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 5311 transitions. [2025-03-04 03:59:21,768 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 5311 transitions. Word has length 87 [2025-03-04 03:59:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:21,768 INFO L471 AbstractCegarLoop]: Abstraction has 3992 states and 5311 transitions. [2025-03-04 03:59:21,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-04 03:59:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 5311 transitions. [2025-03-04 03:59:21,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 03:59:21,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:21,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2025-03-04 03:59:21,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:59:21,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:21,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:21,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1751720953, now seen corresponding path program 1 times [2025-03-04 03:59:21,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:21,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281786384] [2025-03-04 03:59:21,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:21,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:22,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 03:59:22,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 03:59:22,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:22,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 03:59:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281786384] [2025-03-04 03:59:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281786384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:22,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:22,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:22,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920515781] [2025-03-04 03:59:22,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:22,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:22,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:22,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:22,903 INFO L87 Difference]: Start difference. First operand 3992 states and 5311 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 03:59:26,920 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 03:59:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:27,623 INFO L93 Difference]: Finished difference Result 8924 states and 11830 transitions. [2025-03-04 03:59:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2025-03-04 03:59:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:27,650 INFO L225 Difference]: With dead ends: 8924 [2025-03-04 03:59:27,650 INFO L226 Difference]: Without dead ends: 4946 [2025-03-04 03:59:27,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 03:59:27,663 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 310 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:27,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 2327 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-03-04 03:59:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2025-03-04 03:59:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4938. [2025-03-04 03:59:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 3756 states have (on average 1.2726304579339722) internal successors, (4780), 3804 states have internal predecessors, (4780), 856 states have call successors, (856), 326 states have call predecessors, (856), 325 states have return successors, (869), 851 states have call predecessors, (869), 855 states have call successors, (869) [2025-03-04 03:59:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6505 transitions. [2025-03-04 03:59:27,868 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6505 transitions. Word has length 103 [2025-03-04 03:59:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:27,868 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 6505 transitions. [2025-03-04 03:59:27,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 03:59:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6505 transitions. [2025-03-04 03:59:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 03:59:27,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:27,874 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-04 03:59:27,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:59:27,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:27,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:27,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1044591209, now seen corresponding path program 1 times [2025-03-04 03:59:27,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:27,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492352514] [2025-03-04 03:59:27,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:27,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:28,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 03:59:28,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 03:59:28,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:28,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 03:59:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492352514] [2025-03-04 03:59:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492352514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:29,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:59:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:59:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863919655] [2025-03-04 03:59:29,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:29,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:29,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:29,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:29,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:59:29,016 INFO L87 Difference]: Start difference. First operand 4938 states and 6505 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:59:33,034 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 03:59:33,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:33,816 INFO L93 Difference]: Finished difference Result 11924 states and 15644 transitions. [2025-03-04 03:59:33,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:33,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2025-03-04 03:59:33,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:33,860 INFO L225 Difference]: With dead ends: 11924 [2025-03-04 03:59:33,861 INFO L226 Difference]: Without dead ends: 7000 [2025-03-04 03:59:33,877 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 03:59:33,878 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 838 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:33,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 2181 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 77 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 03:59:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7000 states. [2025-03-04 03:59:34,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7000 to 6992. [2025-03-04 03:59:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6992 states, 5364 states have (on average 1.2751677852348993) internal successors, (6840), 5436 states have internal predecessors, (6840), 1136 states have call successors, (1136), 492 states have call predecessors, (1136), 491 states have return successors, (1149), 1127 states have call predecessors, (1149), 1135 states have call successors, (1149) [2025-03-04 03:59:34,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 9125 transitions. [2025-03-04 03:59:34,149 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 9125 transitions. Word has length 115 [2025-03-04 03:59:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:34,149 INFO L471 AbstractCegarLoop]: Abstraction has 6992 states and 9125 transitions. [2025-03-04 03:59:34,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:59:34,149 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 9125 transitions. [2025-03-04 03:59:34,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 03:59:34,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:34,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-04 03:59:34,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:59:34,158 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:34,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash 446677629, now seen corresponding path program 1 times [2025-03-04 03:59:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:34,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309860804] [2025-03-04 03:59:34,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:35,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 03:59:35,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 03:59:35,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:35,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:35,544 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-04 03:59:35,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:35,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309860804] [2025-03-04 03:59:35,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309860804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:59:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274523218] [2025-03-04 03:59:35,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:59:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:59:35,548 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 03:59:35,549 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 03:59:37,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 03:59:37,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 03:59:37,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:37,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:37,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 03:59:37,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:59:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-04 03:59:38,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:59:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274523218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:38,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:59:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-04 03:59:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501899261] [2025-03-04 03:59:38,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:38,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:59:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:38,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:59:38,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:59:38,952 INFO L87 Difference]: Start difference. First operand 6992 states and 9125 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 03:59:42,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:59:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:46,945 INFO L93 Difference]: Finished difference Result 20950 states and 27342 transitions. [2025-03-04 03:59:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:59:46,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 132 [2025-03-04 03:59:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:47,021 INFO L225 Difference]: With dead ends: 20950 [2025-03-04 03:59:47,021 INFO L226 Difference]: Without dead ends: 20942 [2025-03-04 03:59:47,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:59:47,030 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 2561 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 223 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:47,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2561 Valid, 3004 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 399 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2025-03-04 03:59:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20942 states. [2025-03-04 03:59:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20942 to 20908. [2025-03-04 03:59:48,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20908 states, 16036 states have (on average 1.2757545522574207) internal successors, (20458), 16268 states have internal predecessors, (20458), 3400 states have call successors, (3400), 1472 states have call predecessors, (3400), 1471 states have return successors, (3441), 3359 states have call predecessors, (3441), 3399 states have call successors, (3441) [2025-03-04 03:59:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20908 states to 20908 states and 27299 transitions. [2025-03-04 03:59:48,284 INFO L78 Accepts]: Start accepts. Automaton has 20908 states and 27299 transitions. Word has length 132 [2025-03-04 03:59:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:48,285 INFO L471 AbstractCegarLoop]: Abstraction has 20908 states and 27299 transitions. [2025-03-04 03:59:48,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-04 03:59:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 20908 states and 27299 transitions. [2025-03-04 03:59:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-04 03:59:48,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:48,308 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-03-04 03:59:48,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 03:59:48,514 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,SelfDestructingSolverStorable9 [2025-03-04 03:59:48,514 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 29468928, now seen corresponding path program 1 times [2025-03-04 03:59:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587976615] [2025-03-04 03:59:48,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:49,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 03:59:49,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 03:59:49,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:49,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-04 03:59:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:59:50,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587976615] [2025-03-04 03:59:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587976615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 03:59:50,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080627222] [2025-03-04 03:59:50,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:50,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 03:59:50,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:59:50,032 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 03:59:50,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 03:59:51,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-04 03:59:51,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-04 03:59:51,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:59:51,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:59:51,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 03:59:51,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 03:59:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-04 03:59:53,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 03:59:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080627222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:59:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 03:59:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-04 03:59:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596700987] [2025-03-04 03:59:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:59:53,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:59:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:59:53,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:59:53,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:59:53,039 INFO L87 Difference]: Start difference. First operand 20908 states and 27299 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 03:59:57,058 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 03:59:58,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:59:58,047 INFO L93 Difference]: Finished difference Result 31878 states and 41617 transitions. [2025-03-04 03:59:58,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:59:58,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 142 [2025-03-04 03:59:58,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:59:58,105 INFO L225 Difference]: With dead ends: 31878 [2025-03-04 03:59:58,106 INFO L226 Difference]: Without dead ends: 10334 [2025-03-04 03:59:58,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:59:58,168 INFO L435 NwaCegarLoop]: 1220 mSDtfsCounter, 961 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1512 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:59:58,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1512 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 03:59:58,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10334 states. [2025-03-04 03:59:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10334 to 10334. [2025-03-04 03:59:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10334 states, 7921 states have (on average 1.273071581870976) internal successors, (10084), 8037 states have internal predecessors, (10084), 1684 states have call successors, (1684), 729 states have call predecessors, (1684), 728 states have return successors, (1704), 1663 states have call predecessors, (1704), 1683 states have call successors, (1704) [2025-03-04 03:59:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10334 states to 10334 states and 13472 transitions. [2025-03-04 03:59:58,796 INFO L78 Accepts]: Start accepts. Automaton has 10334 states and 13472 transitions. Word has length 142 [2025-03-04 03:59:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:59:58,797 INFO L471 AbstractCegarLoop]: Abstraction has 10334 states and 13472 transitions. [2025-03-04 03:59:58,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 03:59:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 10334 states and 13472 transitions. [2025-03-04 03:59:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-04 03:59:58,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:59:58,813 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-04 03:59:58,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 03:59:59,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 03:59:59,015 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:59:59,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:59:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1635552728, now seen corresponding path program 1 times [2025-03-04 03:59:59,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:59:59,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165846390] [2025-03-04 03:59:59,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:59:59,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:59:59,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 04:00:00,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 04:00:00,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:00,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 41 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-04 04:00:00,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:00,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165846390] [2025-03-04 04:00:00,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165846390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:00:00,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675825922] [2025-03-04 04:00:00,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:00,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:00:00,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:00:00,252 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:00:00,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 04:00:01,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-04 04:00:01,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-04 04:00:01,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:01,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:01,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1997 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 04:00:01,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:00:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-04 04:00:02,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:00:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675825922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:02,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:00:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-04 04:00:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971416672] [2025-03-04 04:00:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:02,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:00:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:02,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:00:02,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:00:02,015 INFO L87 Difference]: Start difference. First operand 10334 states and 13472 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 04:00:06,032 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:00:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:07,061 INFO L93 Difference]: Finished difference Result 19280 states and 25212 transitions. [2025-03-04 04:00:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:00:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 144 [2025-03-04 04:00:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:07,102 INFO L225 Difference]: With dead ends: 19280 [2025-03-04 04:00:07,102 INFO L226 Difference]: Without dead ends: 9692 [2025-03-04 04:00:07,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 145 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:00:07,123 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 834 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:07,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 2403 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-03-04 04:00:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2025-03-04 04:00:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9684. [2025-03-04 04:00:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9684 states, 7430 states have (on average 1.2730820995962315) internal successors, (9459), 7539 states have internal predecessors, (9459), 1579 states have call successors, (1579), 675 states have call predecessors, (1579), 674 states have return successors, (1599), 1559 states have call predecessors, (1599), 1578 states have call successors, (1599) [2025-03-04 04:00:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9684 states to 9684 states and 12637 transitions. [2025-03-04 04:00:07,453 INFO L78 Accepts]: Start accepts. Automaton has 9684 states and 12637 transitions. Word has length 144 [2025-03-04 04:00:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:07,454 INFO L471 AbstractCegarLoop]: Abstraction has 9684 states and 12637 transitions. [2025-03-04 04:00:07,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 04:00:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9684 states and 12637 transitions. [2025-03-04 04:00:07,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 04:00:07,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:07,465 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-04 04:00:07,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 04:00:07,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:00:07,666 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:07,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash -776138120, now seen corresponding path program 1 times [2025-03-04 04:00:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498186506] [2025-03-04 04:00:07,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:00:08,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 04:00:08,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 04:00:08,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:00:08,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:00:09,091 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-04 04:00:09,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:00:09,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498186506] [2025-03-04 04:00:09,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498186506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:00:09,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:00:09,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:00:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373505627] [2025-03-04 04:00:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:00:09,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:00:09,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:00:09,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:00:09,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:09,094 INFO L87 Difference]: Start difference. First operand 9684 states and 12637 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 04:00:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:00:09,913 INFO L93 Difference]: Finished difference Result 18760 states and 24625 transitions. [2025-03-04 04:00:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:00:09,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 147 [2025-03-04 04:00:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:00:09,958 INFO L225 Difference]: With dead ends: 18760 [2025-03-04 04:00:09,958 INFO L226 Difference]: Without dead ends: 9822 [2025-03-04 04:00:09,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:00:09,977 INFO L435 NwaCegarLoop]: 1029 mSDtfsCounter, 3 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 04:00:09,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4112 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 04:00:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9822 states. [2025-03-04 04:00:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9822 to 9786. [2025-03-04 04:00:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9786 states, 7502 states have (on average 1.272060783790989) internal successors, (9543), 7617 states have internal predecessors, (9543), 1591 states have call successors, (1591), 675 states have call predecessors, (1591), 692 states have return successors, (1701), 1583 states have call predecessors, (1701), 1590 states have call successors, (1701) [2025-03-04 04:00:10,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9786 states to 9786 states and 12835 transitions. [2025-03-04 04:00:10,435 INFO L78 Accepts]: Start accepts. Automaton has 9786 states and 12835 transitions. Word has length 147 [2025-03-04 04:00:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:00:10,436 INFO L471 AbstractCegarLoop]: Abstraction has 9786 states and 12835 transitions. [2025-03-04 04:00:10,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-04 04:00:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9786 states and 12835 transitions. [2025-03-04 04:00:10,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 04:00:10,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:00:10,448 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-04 04:00:10,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 04:00:10,448 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:00:10,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:00:10,448 INFO L85 PathProgramCache]: Analyzing trace with hash -988404046, now seen corresponding path program 1 times [2025-03-04 04:00:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:00:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659432188] [2025-03-04 04:00:10,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:00:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms