./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 19:10:26,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:10:26,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:10:26,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:10:26,703 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:10:26,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:10:26,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:10:26,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:10:26,722 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:10:26,722 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:10:26,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:10:26,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:10:26,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:10:26,722 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:10:26,722 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:10:26,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:10:26,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:10:26,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:10:26,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:10:26,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:10:26,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:10:26,725 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-08 19:10:26,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:10:26,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:10:26,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:10:26,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:10:26,984 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:10:26,985 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-08 19:10:28,174 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2992c83a4/81a70dab3548496ea4526b2b98821911/FLAGd095a5f84 [2025-03-08 19:10:28,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:10:28,596 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-08 19:10:28,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2992c83a4/81a70dab3548496ea4526b2b98821911/FLAGd095a5f84 [2025-03-08 19:10:28,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2992c83a4/81a70dab3548496ea4526b2b98821911 [2025-03-08 19:10:28,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:10:28,644 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:10:28,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:10:28,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:10:28,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:10:28,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:28" (1/1) ... [2025-03-08 19:10:28,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bdde71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:28, skipping insertion in model container [2025-03-08 19:10:28,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:10:28" (1/1) ... [2025-03-08 19:10:28,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:10:29,367 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-08 19:10:29,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:10:29,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:10:29,900 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5402] [2025-03-08 19:10:29,903 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-08 19:10:29,904 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-08 19:10:29,904 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-08 19:10:29,905 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-08 19:10:29,906 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-08 19:10:29,913 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-08 19:10:29,939 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-08 19:10:29,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:10:30,069 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:10:30,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30 WrapperNode [2025-03-08 19:10:30,070 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:10:30,071 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:10:30,071 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:10:30,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:10:30,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,160 INFO L138 Inliner]: procedures = 174, calls = 830, calls flagged for inlining = 87, calls inlined = 87, statements flattened = 2590 [2025-03-08 19:10:30,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:10:30,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:10:30,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:10:30,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:10:30,167 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,380 INFO L175 MemorySlicer]: Split 464 memory accesses to 8 slices as follows [1, 2, 9, 31, 341, 44, 5, 31]. 73 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [0, 2, 0, 0, 26, 0, 0, 0]. The 249 writes are split as follows [0, 0, 0, 0, 186, 44, 1, 18]. [2025-03-08 19:10:30,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:10:30,503 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:10:30,504 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:10:30,504 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:10:30,504 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (1/1) ... [2025-03-08 19:10:30,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:10:30,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:10:30,531 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-08 19:10:30,537 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-08 19:10:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-08 19:10:30,554 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-08 19:10:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-03-08 19:10:30,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-03-08 19:10:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2025-03-08 19:10:30,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2025-03-08 19:10:30,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2025-03-08 19:10:30,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2025-03-08 19:10:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:10:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:10:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:10:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:10:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2025-03-08 19:10:30,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-08 19:10:30,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-08 19:10:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-03-08 19:10:30,557 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-03-08 19:10:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:10:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:10:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:10:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:10:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:10:30,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:10:30,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:10:30,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-03-08 19:10:30,559 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-08 19:10:30,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-08 19:10:30,560 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-08 19:10:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-08 19:10:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-08 19:10:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-08 19:10:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-08 19:10:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-08 19:10:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-08 19:10:30,561 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:10:30,561 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:10:30,561 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-08 19:10:30,562 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-08 19:10:30,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:10:30,562 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-03-08 19:10:30,562 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-03-08 19:10:30,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-03-08 19:10:30,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-03-08 19:10:30,562 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-03-08 19:10:30,562 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-03-08 19:10:30,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:10:30,562 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-03-08 19:10:30,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-03-08 19:10:30,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:10:30,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-08 19:10:30,563 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-08 19:10:30,563 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:10:30,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-03-08 19:10:30,564 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-08 19:10:30,564 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-08 19:10:30,565 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-03-08 19:10:30,565 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2025-03-08 19:10:30,565 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-08 19:10:30,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:10:30,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:10:30,565 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2025-03-08 19:10:30,565 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2025-03-08 19:10:31,015 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:10:31,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:10:31,082 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7476: havoc #t~nondet487; [2025-03-08 19:10:31,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:10:31,124 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5463: havoc constant_test_bit_#t~mem14#1;havoc constant_test_bit_#t~bitwise15#1; [2025-03-08 19:10:31,161 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5570: havoc #t~mem63;havoc #t~bitwise64; [2025-03-08 19:10:31,604 INFO L1307 $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-08 19:10:31,605 INFO L1307 $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-08 19:10:31,605 INFO L1307 $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-08 19:10:31,605 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc alloc_can_skb_#t~ret472#1.base, alloc_can_skb_#t~ret472#1.offset; [2025-03-08 19:10:31,622 INFO L1307 $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-08 19:10:31,700 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7459: havoc printk_#t~nondet484#1; [2025-03-08 19:10:31,799 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc #t~nondet478; [2025-03-08 19:10:31,839 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-03-08 19:10:32,038 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7451: havoc netpoll_trap_#t~nondet482#1; [2025-03-08 19:10:32,039 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7386: havoc can_get_echo_skb_#t~nondet474#1; [2025-03-08 19:10:32,046 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc #t~ret486.base, #t~ret486.offset; [2025-03-08 19:10:32,050 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7447: havoc #t~nondet481; [2025-03-08 19:10:32,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7440: havoc #t~nondet480; [2025-03-08 19:10:32,081 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc #t~mem79.base, #t~mem79.offset; [2025-03-08 19:10:32,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7436: havoc #t~nondet479; [2025-03-08 19:10:32,149 INFO L1307 $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-08 19:10:32,149 INFO L1307 $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-08 19:10:38,433 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7402: havoc dev_err_#t~nondet475#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7376: havoc alloc_candev_#t~ret473#1.base, alloc_candev_#t~ret473#1.offset; [2025-03-08 19:10:38,434 INFO L1307 $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-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7418: havoc ldv_ndo_init_2_#t~nondet476#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc atomic_read_#t~mem19#1; [2025-03-08 19:10:38,434 INFO L1307 $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-08 19:10:38,434 INFO L1307 $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-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7422: havoc ldv_ndo_uninit_2_#t~nondet477#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7455: havoc open_candev_#t~nondet483#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7489: havoc usb_register_driver_#t~nondet488#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7493: havoc usb_string_#t~nondet489#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7463: havoc register_candev_#t~nondet485#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7367: havoc _dev_info_#t~nondet470#1; [2025-03-08 19:10:38,434 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5584: havoc __kmalloc_#t~ret67#1.base, __kmalloc_#t~ret67#1.offset; [2025-03-08 19:10:38,702 INFO L1307 $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-08 19:10:38,702 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5409: havoc __fswab16_#t~bitwise9#1; [2025-03-08 19:10:38,951 INFO L? ?]: Removed 1198 outVars from TransFormulas that were not future-live. [2025-03-08 19:10:38,951 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:10:38,986 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:10:38,986 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 19:10:38,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:38 BoogieIcfgContainer [2025-03-08 19:10:38,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:10:38,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:10:38,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:10:38,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:10:38,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:10:28" (1/3) ... [2025-03-08 19:10:38,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c70cd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:38, skipping insertion in model container [2025-03-08 19:10:38,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:10:30" (2/3) ... [2025-03-08 19:10:38,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c70cd89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:10:38, skipping insertion in model container [2025-03-08 19:10:38,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:10:38" (3/3) ... [2025-03-08 19:10:38,995 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-08 19:10:39,009 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:10:39,011 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-08 19:10:39,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:10:39,090 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;@6de36228, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:10:39,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:10:39,096 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-08 19:10:39,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 19:10:39,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:39,103 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-08 19:10:39,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:39,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:39,110 INFO L85 PathProgramCache]: Analyzing trace with hash 553437365, now seen corresponding path program 1 times [2025-03-08 19:10:39,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:39,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957578722] [2025-03-08 19:10:39,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:40,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 19:10:40,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 19:10:40,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:40,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:40,791 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-08 19:10:40,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:40,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957578722] [2025-03-08 19:10:40,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957578722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:40,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:40,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210483698] [2025-03-08 19:10:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:40,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:40,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:40,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:40,818 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-08 19:10:44,859 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-08 19:10:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:45,343 INFO L93 Difference]: Finished difference Result 2389 states and 3367 transitions. [2025-03-08 19:10:45,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:45,345 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-08 19:10:45,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:45,358 INFO L225 Difference]: With dead ends: 2389 [2025-03-08 19:10:45,358 INFO L226 Difference]: Without dead ends: 1559 [2025-03-08 19:10:45,364 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-08 19:10:45,365 INFO L435 NwaCegarLoop]: 1073 mSDtfsCounter, 1048 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:45,366 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.4s Time] [2025-03-08 19:10:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-03-08 19:10:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-03-08 19:10:45,473 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-08 19:10:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2104 transitions. [2025-03-08 19:10:45,493 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2104 transitions. Word has length 28 [2025-03-08 19:10:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:45,494 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2104 transitions. [2025-03-08 19:10:45,494 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-08 19:10:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2104 transitions. [2025-03-08 19:10:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 19:10:45,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:45,496 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-08 19:10:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:10:45,497 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:45,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1712736568, now seen corresponding path program 1 times [2025-03-08 19:10:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944040264] [2025-03-08 19:10:45,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:46,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 19:10:46,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 19:10:46,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:46,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:46,888 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-08 19:10:46,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:46,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944040264] [2025-03-08 19:10:46,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944040264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536047919] [2025-03-08 19:10:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:46,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:46,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:46,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:46,890 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-08 19:10:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:47,654 INFO L93 Difference]: Finished difference Result 4662 states and 6317 transitions. [2025-03-08 19:10:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:47,654 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-08 19:10:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:47,675 INFO L225 Difference]: With dead ends: 4662 [2025-03-08 19:10:47,675 INFO L226 Difference]: Without dead ends: 3110 [2025-03-08 19:10:47,682 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-08 19:10:47,683 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 1047 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-08 19:10:47,683 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-08 19:10:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-03-08 19:10:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3100. [2025-03-08 19:10:47,869 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-08 19:10:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4197 transitions. [2025-03-08 19:10:47,890 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4197 transitions. Word has length 38 [2025-03-08 19:10:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:47,891 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4197 transitions. [2025-03-08 19:10:47,891 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-08 19:10:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4197 transitions. [2025-03-08 19:10:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 19:10:47,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:47,893 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-08 19:10:47,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:10:47,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:47,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1554490554, now seen corresponding path program 1 times [2025-03-08 19:10:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792487511] [2025-03-08 19:10:47,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:48,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 19:10:48,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 19:10:48,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:48,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:49,223 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-08 19:10:49,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:49,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792487511] [2025-03-08 19:10:49,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792487511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:49,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:49,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:49,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705790413] [2025-03-08 19:10:49,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:49,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:49,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:49,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:49,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:49,225 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-08 19:10:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:49,459 INFO L93 Difference]: Finished difference Result 3102 states and 4198 transitions. [2025-03-08 19:10:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:49,459 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-08 19:10:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:49,474 INFO L225 Difference]: With dead ends: 3102 [2025-03-08 19:10:49,474 INFO L226 Difference]: Without dead ends: 3099 [2025-03-08 19:10:49,476 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-08 19:10:49,477 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 1048 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:49,478 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.1s Time] [2025-03-08 19:10:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-03-08 19:10:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3099. [2025-03-08 19:10:49,608 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-08 19:10:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4195 transitions. [2025-03-08 19:10:49,623 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4195 transitions. Word has length 39 [2025-03-08 19:10:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:49,623 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4195 transitions. [2025-03-08 19:10:49,623 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-08 19:10:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4195 transitions. [2025-03-08 19:10:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 19:10:49,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:49,625 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-08 19:10:49,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:10:49,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:49,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash 943830393, now seen corresponding path program 1 times [2025-03-08 19:10:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:49,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084758589] [2025-03-08 19:10:49,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:50,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 19:10:50,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 19:10:50,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:50,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:50,660 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-08 19:10:50,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:50,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084758589] [2025-03-08 19:10:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084758589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:50,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:50,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38698669] [2025-03-08 19:10:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:50,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:50,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:50,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:50,662 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-08 19:10:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:50,892 INFO L93 Difference]: Finished difference Result 3101 states and 4196 transitions. [2025-03-08 19:10:50,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:50,892 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-08 19:10:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:50,907 INFO L225 Difference]: With dead ends: 3101 [2025-03-08 19:10:50,907 INFO L226 Difference]: Without dead ends: 3098 [2025-03-08 19:10:50,909 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-08 19:10:50,910 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 1045 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:50,910 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.1s Time] [2025-03-08 19:10:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2025-03-08 19:10:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2025-03-08 19:10:51,022 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-08 19:10:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4193 transitions. [2025-03-08 19:10:51,039 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4193 transitions. Word has length 40 [2025-03-08 19:10:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:51,039 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4193 transitions. [2025-03-08 19:10:51,039 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-08 19:10:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4193 transitions. [2025-03-08 19:10:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 19:10:51,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:51,041 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-08 19:10:51,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:10:51,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash -806766437, now seen corresponding path program 1 times [2025-03-08 19:10:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624447254] [2025-03-08 19:10:51,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:51,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 19:10:51,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 19:10:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:52,042 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-08 19:10:52,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:52,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624447254] [2025-03-08 19:10:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624447254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:52,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125625310] [2025-03-08 19:10:52,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:52,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:52,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:52,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:52,044 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-08 19:10:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:52,350 INFO L93 Difference]: Finished difference Result 3100 states and 4194 transitions. [2025-03-08 19:10:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:52,351 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-08 19:10:52,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:52,364 INFO L225 Difference]: With dead ends: 3100 [2025-03-08 19:10:52,364 INFO L226 Difference]: Without dead ends: 3097 [2025-03-08 19:10:52,366 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-08 19:10:52,366 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-08 19:10:52,367 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-08 19:10:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2025-03-08 19:10:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3097. [2025-03-08 19:10:52,477 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-08 19:10:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4191 transitions. [2025-03-08 19:10:52,491 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4191 transitions. Word has length 41 [2025-03-08 19:10:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:52,492 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4191 transitions. [2025-03-08 19:10:52,492 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-08 19:10:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4191 transitions. [2025-03-08 19:10:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 19:10:52,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:52,493 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-08 19:10:52,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:10:52,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:52,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:52,494 INFO L85 PathProgramCache]: Analyzing trace with hash 759305658, now seen corresponding path program 1 times [2025-03-08 19:10:52,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:52,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20446035] [2025-03-08 19:10:52,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:52,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:53,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 19:10:53,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 19:10:53,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:53,601 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-08 19:10:53,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:53,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20446035] [2025-03-08 19:10:53,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20446035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:53,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:53,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:53,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313137334] [2025-03-08 19:10:53,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:53,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:53,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:53,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:53,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:53,602 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-08 19:10:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:53,823 INFO L93 Difference]: Finished difference Result 3099 states and 4192 transitions. [2025-03-08 19:10:53,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:53,824 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-08 19:10:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:53,835 INFO L225 Difference]: With dead ends: 3099 [2025-03-08 19:10:53,835 INFO L226 Difference]: Without dead ends: 3087 [2025-03-08 19:10:53,836 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-08 19:10:53,838 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 1039 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:10:53,838 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.1s Time] [2025-03-08 19:10:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2025-03-08 19:10:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3087. [2025-03-08 19:10:53,953 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-08 19:10:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4177 transitions. [2025-03-08 19:10:53,969 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4177 transitions. Word has length 42 [2025-03-08 19:10:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:53,971 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 4177 transitions. [2025-03-08 19:10:53,971 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-08 19:10:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4177 transitions. [2025-03-08 19:10:53,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 19:10:53,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:53,978 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-08 19:10:53,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:10:53,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:53,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:53,979 INFO L85 PathProgramCache]: Analyzing trace with hash 472691395, now seen corresponding path program 1 times [2025-03-08 19:10:53,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:53,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215221414] [2025-03-08 19:10:53,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:54,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 19:10:54,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 19:10:54,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:54,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:54,987 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-08 19:10:54,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:54,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215221414] [2025-03-08 19:10:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215221414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:54,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105155720] [2025-03-08 19:10:54,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:54,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:54,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:54,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:54,988 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-08 19:10:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:10:55,597 INFO L93 Difference]: Finished difference Result 7080 states and 9490 transitions. [2025-03-08 19:10:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:10:55,598 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-08 19:10:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:10:55,617 INFO L225 Difference]: With dead ends: 7080 [2025-03-08 19:10:55,617 INFO L226 Difference]: Without dead ends: 4000 [2025-03-08 19:10:55,626 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-08 19:10:55,627 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-08 19:10:55,627 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-08 19:10:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2025-03-08 19:10:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3992. [2025-03-08 19:10:55,784 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-08 19:10:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 5311 transitions. [2025-03-08 19:10:55,801 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 5311 transitions. Word has length 87 [2025-03-08 19:10:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:10:55,802 INFO L471 AbstractCegarLoop]: Abstraction has 3992 states and 5311 transitions. [2025-03-08 19:10:55,802 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-08 19:10:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 5311 transitions. [2025-03-08 19:10:55,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 19:10:55,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:10:55,806 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-08 19:10:55,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 19:10:55,807 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:10:55,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:10:55,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1751720953, now seen corresponding path program 1 times [2025-03-08 19:10:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:10:55,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661484630] [2025-03-08 19:10:55,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:10:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:10:56,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 19:10:56,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 19:10:56,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:10:56,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:10:56,855 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-08 19:10:56,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:10:56,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661484630] [2025-03-08 19:10:56,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661484630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:10:56,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:10:56,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:10:56,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462673048] [2025-03-08 19:10:56,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:10:56,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:10:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:10:56,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:10:56,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:10:56,856 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-08 19:11:00,876 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-08 19:11:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:01,528 INFO L93 Difference]: Finished difference Result 8924 states and 11830 transitions. [2025-03-08 19:11:01,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:01,529 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-08 19:11:01,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:01,554 INFO L225 Difference]: With dead ends: 8924 [2025-03-08 19:11:01,554 INFO L226 Difference]: Without dead ends: 4946 [2025-03-08 19:11:01,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:01,566 INFO L435 NwaCegarLoop]: 1320 mSDtfsCounter, 310 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:01,567 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.4s Time] [2025-03-08 19:11:01,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2025-03-08 19:11:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4938. [2025-03-08 19:11:01,868 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-08 19:11:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6505 transitions. [2025-03-08 19:11:01,897 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6505 transitions. Word has length 103 [2025-03-08 19:11:01,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:01,897 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 6505 transitions. [2025-03-08 19:11:01,898 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-08 19:11:01,898 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6505 transitions. [2025-03-08 19:11:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 19:11:01,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:01,907 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-08 19:11:01,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 19:11:01,907 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:01,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:01,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1044591209, now seen corresponding path program 1 times [2025-03-08 19:11:01,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:01,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806688774] [2025-03-08 19:11:01,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:01,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:02,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 19:11:02,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 19:11:02,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:02,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:03,031 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-08 19:11:03,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:03,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806688774] [2025-03-08 19:11:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806688774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:03,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:11:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932847350] [2025-03-08 19:11:03,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:03,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:03,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:11:03,033 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-08 19:11:07,051 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-08 19:11:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:07,790 INFO L93 Difference]: Finished difference Result 11924 states and 15644 transitions. [2025-03-08 19:11:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:07,791 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-08 19:11:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:07,829 INFO L225 Difference]: With dead ends: 11924 [2025-03-08 19:11:07,829 INFO L226 Difference]: Without dead ends: 7000 [2025-03-08 19:11:07,845 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-08 19:11:07,845 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 838 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s 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-08 19:11:07,845 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-08 19:11:07,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7000 states. [2025-03-08 19:11:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7000 to 6992. [2025-03-08 19:11:08,127 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-08 19:11:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 9125 transitions. [2025-03-08 19:11:08,145 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 9125 transitions. Word has length 115 [2025-03-08 19:11:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:08,146 INFO L471 AbstractCegarLoop]: Abstraction has 6992 states and 9125 transitions. [2025-03-08 19:11:08,147 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-08 19:11:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 9125 transitions. [2025-03-08 19:11:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 19:11:08,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:08,153 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-08 19:11:08,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 19:11:08,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:08,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash 446677629, now seen corresponding path program 1 times [2025-03-08 19:11:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727453659] [2025-03-08 19:11:08,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:08,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 19:11:09,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 19:11:09,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:09,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:09,280 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-08 19:11:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727453659] [2025-03-08 19:11:09,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727453659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:11:09,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394311526] [2025-03-08 19:11:09,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:11:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:11:09,283 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-08 19:11:09,285 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-08 19:11:10,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 19:11:10,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 19:11:10,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:10,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:10,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 1962 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 19:11:10,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:11:11,693 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-08 19:11:11,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:11:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394311526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:11:11,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-08 19:11:11,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627453663] [2025-03-08 19:11:11,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:11:11,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:11,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:11:11,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:11:11,694 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-08 19:11:15,731 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-08 19:11:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:19,345 INFO L93 Difference]: Finished difference Result 20950 states and 27342 transitions. [2025-03-08 19:11:19,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:11:19,345 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-08 19:11:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:19,404 INFO L225 Difference]: With dead ends: 20950 [2025-03-08 19:11:19,404 INFO L226 Difference]: Without dead ends: 20942 [2025-03-08 19:11:19,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 19:11:19,413 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 2561 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 223 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:19,413 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.0s Time] [2025-03-08 19:11:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20942 states. [2025-03-08 19:11:20,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20942 to 20908. [2025-03-08 19:11:20,143 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-08 19:11:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20908 states to 20908 states and 27299 transitions. [2025-03-08 19:11:20,285 INFO L78 Accepts]: Start accepts. Automaton has 20908 states and 27299 transitions. Word has length 132 [2025-03-08 19:11:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 20908 states and 27299 transitions. [2025-03-08 19:11:20,286 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-08 19:11:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 20908 states and 27299 transitions. [2025-03-08 19:11:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 19:11:20,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:20,304 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-08 19:11:20,317 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-08 19:11:20,505 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-08 19:11:20,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:20,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash 29468928, now seen corresponding path program 1 times [2025-03-08 19:11:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:20,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470720016] [2025-03-08 19:11:20,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:21,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 19:11:21,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 19:11:21,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:21,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:21,886 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-08 19:11:21,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:21,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470720016] [2025-03-08 19:11:21,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470720016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:11:21,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180790349] [2025-03-08 19:11:21,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:21,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:11:21,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:11:21,889 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-08 19:11:21,891 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-08 19:11:23,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 19:11:23,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 19:11:23,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:23,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:23,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:11:23,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:11:24,146 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-08 19:11:24,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:11:24,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180790349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:24,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:11:24,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 19:11:24,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877692267] [2025-03-08 19:11:24,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:24,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:24,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:24,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:24,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:11:24,149 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-08 19:11:28,167 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-08 19:11:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:28,984 INFO L93 Difference]: Finished difference Result 31878 states and 41617 transitions. [2025-03-08 19:11:28,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:28,985 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-08 19:11:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:29,023 INFO L225 Difference]: With dead ends: 31878 [2025-03-08 19:11:29,023 INFO L226 Difference]: Without dead ends: 10334 [2025-03-08 19:11:29,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 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-08 19:11:29,061 INFO L435 NwaCegarLoop]: 1220 mSDtfsCounter, 961 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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-08 19:11:29,062 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-08 19:11:29,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10334 states. [2025-03-08 19:11:29,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10334 to 10334. [2025-03-08 19:11:29,374 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-08 19:11:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10334 states to 10334 states and 13472 transitions. [2025-03-08 19:11:29,472 INFO L78 Accepts]: Start accepts. Automaton has 10334 states and 13472 transitions. Word has length 142 [2025-03-08 19:11:29,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:29,473 INFO L471 AbstractCegarLoop]: Abstraction has 10334 states and 13472 transitions. [2025-03-08 19:11:29,473 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-08 19:11:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 10334 states and 13472 transitions. [2025-03-08 19:11:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 19:11:29,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:29,486 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-08 19:11:29,498 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-08 19:11:29,687 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-08 19:11:29,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:29,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:29,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1635552728, now seen corresponding path program 1 times [2025-03-08 19:11:29,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045077610] [2025-03-08 19:11:29,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:30,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 19:11:30,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 19:11:30,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:30,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:30,792 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-08 19:11:30,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:30,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045077610] [2025-03-08 19:11:30,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045077610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:11:30,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508149624] [2025-03-08 19:11:30,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:30,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:11:30,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:11:30,795 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-08 19:11:30,797 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-08 19:11:32,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 19:11:32,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 19:11:32,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:32,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:32,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1997 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 19:11:32,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:11:32,788 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-08 19:11:32,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:11:32,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508149624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:32,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:11:32,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 19:11:32,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271619800] [2025-03-08 19:11:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:32,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:11:32,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:32,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:11:32,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:11:32,789 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-08 19:11:36,809 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-08 19:11:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:37,939 INFO L93 Difference]: Finished difference Result 19280 states and 25212 transitions. [2025-03-08 19:11:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:11:37,939 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-08 19:11:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:37,980 INFO L225 Difference]: With dead ends: 19280 [2025-03-08 19:11:37,980 INFO L226 Difference]: Without dead ends: 9692 [2025-03-08 19:11:38,004 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-08 19:11:38,006 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 834 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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-08 19:11:38,006 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-08 19:11:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2025-03-08 19:11:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9684. [2025-03-08 19:11:38,387 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-08 19:11:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9684 states to 9684 states and 12637 transitions. [2025-03-08 19:11:38,419 INFO L78 Accepts]: Start accepts. Automaton has 9684 states and 12637 transitions. Word has length 144 [2025-03-08 19:11:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:38,420 INFO L471 AbstractCegarLoop]: Abstraction has 9684 states and 12637 transitions. [2025-03-08 19:11:38,420 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-08 19:11:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 9684 states and 12637 transitions. [2025-03-08 19:11:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 19:11:38,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:38,429 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-08 19:11:38,442 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-08 19:11:38,630 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-08 19:11:38,630 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:38,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash -776138120, now seen corresponding path program 1 times [2025-03-08 19:11:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307826680] [2025-03-08 19:11:38,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 19:11:39,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 19:11:39,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:39,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:39,968 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-08 19:11:39,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:39,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307826680] [2025-03-08 19:11:39,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307826680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:39,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:39,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:11:39,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193871902] [2025-03-08 19:11:39,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:39,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:11:39,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:39,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:11:39,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:11:39,970 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-08 19:11:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:11:40,657 INFO L93 Difference]: Finished difference Result 18760 states and 24625 transitions. [2025-03-08 19:11:40,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:11:40,657 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-08 19:11:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:11:40,695 INFO L225 Difference]: With dead ends: 18760 [2025-03-08 19:11:40,695 INFO L226 Difference]: Without dead ends: 9822 [2025-03-08 19:11:40,712 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-08 19:11:40,712 INFO L435 NwaCegarLoop]: 1029 mSDtfsCounter, 3 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 19:11:40,712 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.4s Time] [2025-03-08 19:11:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9822 states. [2025-03-08 19:11:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9822 to 9786. [2025-03-08 19:11:41,064 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-08 19:11:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9786 states to 9786 states and 12835 transitions. [2025-03-08 19:11:41,092 INFO L78 Accepts]: Start accepts. Automaton has 9786 states and 12835 transitions. Word has length 147 [2025-03-08 19:11:41,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:11:41,092 INFO L471 AbstractCegarLoop]: Abstraction has 9786 states and 12835 transitions. [2025-03-08 19:11:41,092 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-08 19:11:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9786 states and 12835 transitions. [2025-03-08 19:11:41,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 19:11:41,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:11:41,101 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-08 19:11:41,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 19:11:41,101 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:11:41,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:11:41,102 INFO L85 PathProgramCache]: Analyzing trace with hash -988404046, now seen corresponding path program 1 times [2025-03-08 19:11:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:11:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040446759] [2025-03-08 19:11:41,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:11:41,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:11:41,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 19:11:42,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 19:11:42,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:11:42,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:11:43,968 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-08 19:11:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:11:43,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040446759] [2025-03-08 19:11:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040446759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:11:43,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:11:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 19:11:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498810674] [2025-03-08 19:11:43,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:11:43,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 19:11:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:11:43,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 19:11:43,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-08 19:11:43,970 INFO L87 Difference]: Start difference. First operand 9786 states and 12835 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 9 states have internal predecessors, (103), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 19:11:47,989 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 []