./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--ems_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/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--ems_usb.ko-entry_point.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 06:21:53,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 06:21:53,602 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-06 06:21:53,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 06:21:53,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 06:21:53,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 06:21:53,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 06:21:53,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 06:21:53,644 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 06:21:53,644 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 06:21:53,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 06:21:53,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 06:21:53,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 06:21:53,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 06:21:53,645 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 06:21:53,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 06:21:53,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:21:53,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 06:21:53,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 06:21:53,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 06:21:53,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 06:21:53,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 06:21:53,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 06:21:53,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 06:21:53,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 06:21:53,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 06:21:53,647 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-jdk21/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 -> be936ec9376452d086f72aa92ac4fe7deb233a068e40e0ed8f478fbc228d19b6 [2025-02-06 06:21:53,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 06:21:53,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 06:21:53,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 06:21:53,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 06:21:53,988 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 06:21:53,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2025-02-06 06:21:55,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4577af39a/acc2657553b04ebc8754a77bc46b337e/FLAG75d7b7d0e [2025-02-06 06:21:56,048 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 06:21:56,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2025-02-06 06:21:56,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4577af39a/acc2657553b04ebc8754a77bc46b337e/FLAG75d7b7d0e [2025-02-06 06:21:56,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4577af39a/acc2657553b04ebc8754a77bc46b337e [2025-02-06 06:21:56,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 06:21:56,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 06:21:56,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 06:21:56,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 06:21:56,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 06:21:56,111 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:21:56" (1/1) ... [2025-02-06 06:21:56,112 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:56, skipping insertion in model container [2025-02-06 06:21:56,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:21:56" (1/1) ... [2025-02-06 06:21:56,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 06:21:56,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2025-02-06 06:21:57,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:21:57,523 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 06:21:57,678 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"); [5441] [2025-02-06 06:21:57,680 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)); [5448] [2025-02-06 06:21:57,681 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"); [5456-5457] [2025-02-06 06:21:57,683 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)); [5485] [2025-02-06 06:21:57,684 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)); [5492] [2025-02-06 06:21:57,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i[164250,164263] [2025-02-06 06:21:57,728 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/6225/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/ems_usb.o.c.prepared"), "i" (546), "i" (12UL)); [6159-6160] [2025-02-06 06:21:57,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 06:21:57,875 INFO L204 MainTranslator]: Completed translation [2025-02-06 06:21:57,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57 WrapperNode [2025-02-06 06:21:57,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 06:21:57,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 06:21:57,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 06:21:57,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 06:21:57,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:57,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,014 INFO L138 Inliner]: procedures = 168, calls = 765, calls flagged for inlining = 78, calls inlined = 78, statements flattened = 2252 [2025-02-06 06:21:58,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 06:21:58,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 06:21:58,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 06:21:58,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 06:21:58,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,333 INFO L175 MemorySlicer]: Split 454 memory accesses to 8 slices as follows [2, 20, 9, 20, 44, 9, 342, 8]. 75 percent of accesses are in the largest equivalence class. The 44 initializations are split as follows [2, 0, 0, 0, 0, 0, 34, 8]. The 224 writes are split as follows [0, 11, 5, 0, 44, 0, 164, 0]. [2025-02-06 06:21:58,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,412 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,420 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 06:21:58,480 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 06:21:58,480 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 06:21:58,480 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 06:21:58,481 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (1/1) ... [2025-02-06 06:21:58,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 06:21:58,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:21:58,516 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 06:21:58,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 06:21:58,544 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-02-06 06:21:58,545 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-02-06 06:21:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 06:21:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 06:21:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 06:21:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 06:21:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 06:21:58,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 06:21:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-02-06 06:21:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-02-06 06:21:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_18 [2025-02-06 06:21:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_18 [2025-02-06 06:21:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2025-02-06 06:21:58,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2025-02-06 06:21:58,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2025-02-06 06:21:58,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2025-02-06 06:21:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2025-02-06 06:21:58,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2025-02-06 06:21:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-02-06 06:21:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-02-06 06:21:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-02-06 06:21:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-02-06 06:21:58,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-02-06 06:21:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-02-06 06:21:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-02-06 06:21:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-02-06 06:21:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-02-06 06:21:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-02-06 06:21:58,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-02-06 06:21:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-02-06 06:21:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-02-06 06:21:58,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-02-06 06:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-02-06 06:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-02-06 06:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-02-06 06:21:58,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-02-06 06:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 06:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 06:21:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-02-06 06:21:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_bulk_callback [2025-02-06 06:21:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_bulk_callback [2025-02-06 06:21:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-02-06 06:21:58,551 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-02-06 06:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-02-06 06:21:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-02-06 06:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2025-02-06 06:21:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2025-02-06 06:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2025-02-06 06:21:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2025-02-06 06:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-02-06 06:21:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-02-06 06:21:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-02-06 06:21:58,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-02-06 06:21:58,554 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2025-02-06 06:21:58,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-02-06 06:21:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-02-06 06:21:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-02-06 06:21:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-02-06 06:21:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-02-06 06:21:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2025-02-06 06:21:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:21:58,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-02-06 06:21:58,555 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-02-06 06:21:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-02-06 06:21:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_disconnect [2025-02-06 06:21:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_disconnect [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-02-06 06:21:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-02-06 06:21:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-02-06 06:21:58,556 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_read_interrupt_callback [2025-02-06 06:21:58,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_read_interrupt_callback [2025-02-06 06:21:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-02-06 06:21:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-02-06 06:21:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 06:21:58,560 INFO L130 BoogieDeclarations]: Found specification of procedure netif_queue_stopped [2025-02-06 06:21:58,560 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_queue_stopped [2025-02-06 06:21:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_rx_err [2025-02-06 06:21:58,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_rx_err [2025-02-06 06:21:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-02-06 06:21:58,561 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-02-06 06:21:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-02-06 06:21:58,561 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-02-06 06:21:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-02-06 06:21:58,561 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-02-06 06:21:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-02-06 06:21:58,561 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-02-06 06:21:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-02-06 06:21:58,561 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-02-06 06:21:58,561 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-02-06 06:21:58,562 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-02-06 06:21:58,562 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-02-06 06:21:58,562 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-02-06 06:21:58,562 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-02-06 06:21:58,562 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-02-06 06:21:58,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-02-06 06:21:58,563 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 06:21:58,563 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-02-06 06:21:58,563 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-02-06 06:21:58,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-02-06 06:21:58,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 06:21:58,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 06:21:59,104 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 06:21:59,107 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 06:21:59,193 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-02-06 06:21:59,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7370: havoc alloc_can_skb_#t~ret439#1.base, alloc_can_skb_#t~ret439#1.offset; [2025-02-06 06:21:59,474 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5935: call ULTIMATE.dealloc(ems_usb_rx_can_msg_~#cf~0#1.base, ems_usb_rx_can_msg_~#cf~0#1.offset);havoc ems_usb_rx_can_msg_~#cf~0#1.base, ems_usb_rx_can_msg_~#cf~0#1.offset; [2025-02-06 06:21:59,534 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6226: call ULTIMATE.dealloc(~#cmd~0.base, ~#cmd~0.offset);havoc ~#cmd~0.base, ~#cmd~0.offset; [2025-02-06 06:21:59,568 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7436: havoc netpoll_trap_#t~nondet449#1; [2025-02-06 06:21:59,588 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5576: havoc #t~mem42;havoc #t~bitwise43; [2025-02-06 06:21:59,627 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5464: havoc #t~mem4;havoc #t~bitwise5; [2025-02-06 06:21:59,664 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5525: 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-02-06 06:21:59,702 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7444: havoc printk_#t~nondet451#1; [2025-02-06 06:21:59,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6200: call ULTIMATE.dealloc(~#actual_length~0#1.base, ~#actual_length~0#1.offset);havoc ~#actual_length~0#1.base, ~#actual_length~0#1.offset; [2025-02-06 06:21:59,808 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7461: havoc usb_bulk_msg_#t~nondet454#1; [2025-02-06 06:21:59,813 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7417: havoc #t~nondet445; [2025-02-06 06:21:59,814 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-02-06 06:21:59,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7481: havoc usb_unlink_urb_#t~nondet456#1; [2025-02-06 06:21:59,895 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7383: havoc can_get_echo_skb_#t~nondet441#1; [2025-02-06 06:21:59,904 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7454: havoc #t~ret453.base, #t~ret453.offset; [2025-02-06 06:21:59,929 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7432: havoc #t~nondet448; [2025-02-06 06:22:00,131 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5978: call ULTIMATE.dealloc(~#cf~1#1.base, ~#cf~1#1.offset);havoc ~#cf~1#1.base, ~#cf~1#1.offset; [2025-02-06 06:22:00,132 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7367: havoc alloc_can_err_skb_#t~ret438#1.base, alloc_can_err_skb_#t~ret438#1.offset; [2025-02-06 06:22:00,135 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7396: havoc #t~nondet442; [2025-02-06 06:22:00,138 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7425: havoc #t~nondet447; [2025-02-06 06:22:00,152 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5591: havoc __kmalloc_#t~ret46#1.base, __kmalloc_#t~ret46#1.offset; [2025-02-06 06:22:00,161 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5712: havoc #t~mem58.base, #t~mem58.offset; [2025-02-06 06:22:00,164 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7421: havoc #t~nondet446; [2025-02-06 06:22:06,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7373: havoc alloc_candev_#t~ret440#1.base, alloc_candev_#t~ret440#1.offset; [2025-02-06 06:22:06,810 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7440: havoc open_candev_#t~nondet450#1; [2025-02-06 06:22:06,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7474: havoc usb_register_driver_#t~nondet455#1; [2025-02-06 06:22:06,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7409: havoc ldv_ndo_init_2_#t~nondet443#1; [2025-02-06 06:22:06,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7413: havoc ldv_ndo_uninit_2_#t~nondet444#1; [2025-02-06 06:22:06,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7448: havoc register_candev_#t~nondet452#1; [2025-02-06 06:22:06,811 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5472: havoc atomic_read_#t~mem9#1; [2025-02-06 06:22:07,068 INFO L? ?]: Removed 977 outVars from TransFormulas that were not future-live. [2025-02-06 06:22:07,068 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 06:22:07,117 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 06:22:07,118 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-06 06:22:07,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:07 BoogieIcfgContainer [2025-02-06 06:22:07,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 06:22:07,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 06:22:07,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 06:22:07,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 06:22:07,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:21:56" (1/3) ... [2025-02-06 06:22:07,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce996b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:07, skipping insertion in model container [2025-02-06 06:22:07,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:21:57" (2/3) ... [2025-02-06 06:22:07,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce996b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:22:07, skipping insertion in model container [2025-02-06 06:22:07,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:22:07" (3/3) ... [2025-02-06 06:22:07,130 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i [2025-02-06 06:22:07,142 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 06:22:07,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--ems_usb.ko-entry_point.cil.out.i that has 53 procedures, 784 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 06:22:07,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 06:22:07,237 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;@7ddfdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 06:22:07,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 06:22:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand has 786 states, 573 states have (on average 1.343804537521815) internal successors, (770), 603 states have internal predecessors, (770), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) [2025-02-06 06:22:07,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-06 06:22:07,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:07,254 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-02-06 06:22:07,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:07,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:07,260 INFO L85 PathProgramCache]: Analyzing trace with hash -767945464, now seen corresponding path program 1 times [2025-02-06 06:22:07,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:07,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906611251] [2025-02-06 06:22:07,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:07,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:08,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 06:22:09,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 06:22:09,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:09,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 06:22:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:09,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906611251] [2025-02-06 06:22:09,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906611251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:09,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:09,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919068440] [2025-02-06 06:22:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:09,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:09,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:09,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:09,761 INFO L87 Difference]: Start difference. First operand has 786 states, 573 states have (on average 1.343804537521815) internal successors, (770), 603 states have internal predecessors, (770), 157 states have call successors, (157), 52 states have call predecessors, (157), 50 states have return successors, (151), 146 states have call predecessors, (151), 151 states have call successors, (151) 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-02-06 06:22:13,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-06 06:22:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:14,446 INFO L93 Difference]: Finished difference Result 2313 states and 3241 transitions. [2025-02-06 06:22:14,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:14,448 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-02-06 06:22:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:14,477 INFO L225 Difference]: With dead ends: 2313 [2025-02-06 06:22:14,478 INFO L226 Difference]: Without dead ends: 1501 [2025-02-06 06:22:14,491 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-02-06 06:22:14,493 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 1010 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:14,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 2083 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:22:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-02-06 06:22:14,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2025-02-06 06:22:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1109 states have (on average 1.2984670874661857) internal successors, (1440), 1141 states have internal predecessors, (1440), 293 states have call successors, (293), 99 states have call predecessors, (293), 98 states have return successors, (288), 278 states have call predecessors, (288), 288 states have call successors, (288) [2025-02-06 06:22:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2021 transitions. [2025-02-06 06:22:14,681 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2021 transitions. Word has length 28 [2025-02-06 06:22:14,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:14,682 INFO L471 AbstractCegarLoop]: Abstraction has 1501 states and 2021 transitions. [2025-02-06 06:22:14,684 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-02-06 06:22:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2021 transitions. [2025-02-06 06:22:14,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 06:22:14,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:14,687 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-02-06 06:22:14,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 06:22:14,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:14,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:14,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2130009988, now seen corresponding path program 1 times [2025-02-06 06:22:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:14,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93628578] [2025-02-06 06:22:14,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:15,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 06:22:15,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 06:22:15,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:15,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93628578] [2025-02-06 06:22:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93628578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:16,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:16,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842865619] [2025-02-06 06:22:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:16,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:16,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:16,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:16,683 INFO L87 Difference]: Start difference. First operand 1501 states and 2021 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-02-06 06:22:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:17,416 INFO L93 Difference]: Finished difference Result 4488 states and 6148 transitions. [2025-02-06 06:22:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:17,416 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-02-06 06:22:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:17,439 INFO L225 Difference]: With dead ends: 4488 [2025-02-06 06:22:17,439 INFO L226 Difference]: Without dead ends: 2994 [2025-02-06 06:22:17,448 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-02-06 06:22:17,449 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 1020 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:17,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 2495 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 06:22:17,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2025-02-06 06:22:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2984. [2025-02-06 06:22:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2984 states, 2208 states have (on average 1.2971014492753623) internal successors, (2864), 2268 states have internal predecessors, (2864), 579 states have call successors, (579), 197 states have call predecessors, (579), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-02-06 06:22:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 4061 transitions. [2025-02-06 06:22:17,669 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 4061 transitions. Word has length 38 [2025-02-06 06:22:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:17,670 INFO L471 AbstractCegarLoop]: Abstraction has 2984 states and 4061 transitions. [2025-02-06 06:22:17,670 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-02-06 06:22:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 4061 transitions. [2025-02-06 06:22:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 06:22:17,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:17,672 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-02-06 06:22:17,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 06:22:17,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:17,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1605120249, now seen corresponding path program 1 times [2025-02-06 06:22:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:17,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226523634] [2025-02-06 06:22:17,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:18,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 06:22:18,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 06:22:18,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:18,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:19,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:19,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226523634] [2025-02-06 06:22:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226523634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358590337] [2025-02-06 06:22:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:19,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:19,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:19,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:19,322 INFO L87 Difference]: Start difference. First operand 2984 states and 4061 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-02-06 06:22:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:19,561 INFO L93 Difference]: Finished difference Result 2986 states and 4062 transitions. [2025-02-06 06:22:19,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:19,562 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-02-06 06:22:19,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:19,584 INFO L225 Difference]: With dead ends: 2986 [2025-02-06 06:22:19,585 INFO L226 Difference]: Without dead ends: 2983 [2025-02-06 06:22:19,587 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-02-06 06:22:19,590 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 1006 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:19,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 1008 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:22:19,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-02-06 06:22:19,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2983. [2025-02-06 06:22:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2208 states have (on average 1.2966485507246377) internal successors, (2863), 2267 states have internal predecessors, (2863), 578 states have call successors, (578), 197 states have call predecessors, (578), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-02-06 06:22:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 4059 transitions. [2025-02-06 06:22:19,776 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 4059 transitions. Word has length 39 [2025-02-06 06:22:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:19,777 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 4059 transitions. [2025-02-06 06:22:19,777 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-02-06 06:22:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 4059 transitions. [2025-02-06 06:22:19,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 06:22:19,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:19,781 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-02-06 06:22:19,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 06:22:19,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:19,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:19,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1781560795, now seen corresponding path program 1 times [2025-02-06 06:22:19,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:19,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016555315] [2025-02-06 06:22:19,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:19,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:20,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 06:22:20,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 06:22:20,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:20,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:21,186 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:21,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:21,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016555315] [2025-02-06 06:22:21,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016555315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:21,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:21,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:21,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253628248] [2025-02-06 06:22:21,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:21,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:21,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:21,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:21,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:21,187 INFO L87 Difference]: Start difference. First operand 2983 states and 4059 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-02-06 06:22:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:21,430 INFO L93 Difference]: Finished difference Result 2985 states and 4060 transitions. [2025-02-06 06:22:21,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:21,431 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-02-06 06:22:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:21,453 INFO L225 Difference]: With dead ends: 2985 [2025-02-06 06:22:21,454 INFO L226 Difference]: Without dead ends: 2982 [2025-02-06 06:22:21,456 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-02-06 06:22:21,458 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 1003 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:21,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1006 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:22:21,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2982 states. [2025-02-06 06:22:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2982 to 2982. [2025-02-06 06:22:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2208 states have (on average 1.296195652173913) internal successors, (2862), 2266 states have internal predecessors, (2862), 577 states have call successors, (577), 197 states have call predecessors, (577), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-02-06 06:22:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 4057 transitions. [2025-02-06 06:22:21,610 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 4057 transitions. Word has length 40 [2025-02-06 06:22:21,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:21,611 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 4057 transitions. [2025-02-06 06:22:21,611 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-02-06 06:22:21,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 4057 transitions. [2025-02-06 06:22:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 06:22:21,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:21,613 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-02-06 06:22:21,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 06:22:21,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:21,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash 605508218, now seen corresponding path program 1 times [2025-02-06 06:22:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515908013] [2025-02-06 06:22:21,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:21,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:22,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 06:22:22,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 06:22:22,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:22,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:22,834 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:22,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:22,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515908013] [2025-02-06 06:22:22,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515908013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:22,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:22,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:22,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181069365] [2025-02-06 06:22:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:22,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:22,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:22,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:22,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:22,835 INFO L87 Difference]: Start difference. First operand 2982 states and 4057 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-02-06 06:22:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:23,087 INFO L93 Difference]: Finished difference Result 2984 states and 4058 transitions. [2025-02-06 06:22:23,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:23,088 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-02-06 06:22:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:23,107 INFO L225 Difference]: With dead ends: 2984 [2025-02-06 06:22:23,108 INFO L226 Difference]: Without dead ends: 2981 [2025-02-06 06:22:23,110 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-02-06 06:22:23,112 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 1000 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:23,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 1004 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 06:22:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2025-02-06 06:22:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2981. [2025-02-06 06:22:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2208 states have (on average 1.2957427536231885) internal successors, (2861), 2265 states have internal predecessors, (2861), 576 states have call successors, (576), 197 states have call predecessors, (576), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-02-06 06:22:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4055 transitions. [2025-02-06 06:22:23,268 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4055 transitions. Word has length 41 [2025-02-06 06:22:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:23,269 INFO L471 AbstractCegarLoop]: Abstraction has 2981 states and 4055 transitions. [2025-02-06 06:22:23,269 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-02-06 06:22:23,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4055 transitions. [2025-02-06 06:22:23,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 06:22:23,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:23,271 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-02-06 06:22:23,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 06:22:23,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:23,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:23,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1590202566, now seen corresponding path program 1 times [2025-02-06 06:22:23,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:23,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10214550] [2025-02-06 06:22:23,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:23,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:24,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 06:22:24,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 06:22:24,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:24,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:24,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:24,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10214550] [2025-02-06 06:22:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10214550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:24,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:24,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704748754] [2025-02-06 06:22:24,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:24,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:24,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:24,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:24,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:24,580 INFO L87 Difference]: Start difference. First operand 2981 states and 4055 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-02-06 06:22:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:24,844 INFO L93 Difference]: Finished difference Result 2983 states and 4056 transitions. [2025-02-06 06:22:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:24,845 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-02-06 06:22:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:24,867 INFO L225 Difference]: With dead ends: 2983 [2025-02-06 06:22:24,867 INFO L226 Difference]: Without dead ends: 2971 [2025-02-06 06:22:24,871 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-02-06 06:22:24,872 INFO L435 NwaCegarLoop]: 1003 mSDtfsCounter, 997 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:24,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1003 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 06:22:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2025-02-06 06:22:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2971. [2025-02-06 06:22:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2971 states, 2199 states have (on average 1.2951341518872215) internal successors, (2848), 2255 states have internal predecessors, (2848), 575 states have call successors, (575), 197 states have call predecessors, (575), 196 states have return successors, (618), 554 states have call predecessors, (618), 574 states have call successors, (618) [2025-02-06 06:22:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 4041 transitions. [2025-02-06 06:22:25,048 INFO L78 Accepts]: Start accepts. Automaton has 2971 states and 4041 transitions. Word has length 42 [2025-02-06 06:22:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:25,048 INFO L471 AbstractCegarLoop]: Abstraction has 2971 states and 4041 transitions. [2025-02-06 06:22:25,048 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-02-06 06:22:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2971 states and 4041 transitions. [2025-02-06 06:22:25,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-06 06:22:25,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:25,054 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, 1, 1, 1] [2025-02-06 06:22:25,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 06:22:25,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:25,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:25,055 INFO L85 PathProgramCache]: Analyzing trace with hash -280583650, now seen corresponding path program 1 times [2025-02-06 06:22:25,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:25,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540876602] [2025-02-06 06:22:25,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:26,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-06 06:22:26,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-06 06:22:26,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-06 06:22:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540876602] [2025-02-06 06:22:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540876602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:26,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:26,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:26,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984984789] [2025-02-06 06:22:26,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:26,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:26,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:26,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:26,465 INFO L87 Difference]: Start difference. First operand 2971 states and 4041 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-06 06:22:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:27,074 INFO L93 Difference]: Finished difference Result 6373 states and 8608 transitions. [2025-02-06 06:22:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:27,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 90 [2025-02-06 06:22:27,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:27,098 INFO L225 Difference]: With dead ends: 6373 [2025-02-06 06:22:27,098 INFO L226 Difference]: Without dead ends: 3407 [2025-02-06 06:22:27,112 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-02-06 06:22:27,112 INFO L435 NwaCegarLoop]: 1043 mSDtfsCounter, 264 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:27,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 2016 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 06:22:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2025-02-06 06:22:27,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3402. [2025-02-06 06:22:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3402 states, 2517 states have (on average 1.282876440206595) internal successors, (3229), 2577 states have internal predecessors, (3229), 646 states have call successors, (646), 239 states have call predecessors, (646), 238 states have return successors, (693), 625 states have call predecessors, (693), 645 states have call successors, (693) [2025-02-06 06:22:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4568 transitions. [2025-02-06 06:22:27,313 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4568 transitions. Word has length 90 [2025-02-06 06:22:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:27,314 INFO L471 AbstractCegarLoop]: Abstraction has 3402 states and 4568 transitions. [2025-02-06 06:22:27,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-02-06 06:22:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4568 transitions. [2025-02-06 06:22:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 06:22:27,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:27,320 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, 1, 1, 1] [2025-02-06 06:22:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 06:22:27,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:27,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1541481363, now seen corresponding path program 1 times [2025-02-06 06:22:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531377114] [2025-02-06 06:22:27,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:28,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 06:22:28,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 06:22:28,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:28,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 06:22:28,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:28,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531377114] [2025-02-06 06:22:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531377114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311612531] [2025-02-06 06:22:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:28,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:28,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:28,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:28,645 INFO L87 Difference]: Start difference. First operand 3402 states and 4568 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 06:22:32,669 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-02-06 06:22:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:33,377 INFO L93 Difference]: Finished difference Result 7236 states and 9701 transitions. [2025-02-06 06:22:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 106 [2025-02-06 06:22:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:33,402 INFO L225 Difference]: With dead ends: 7236 [2025-02-06 06:22:33,403 INFO L226 Difference]: Without dead ends: 4272 [2025-02-06 06:22:33,413 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-02-06 06:22:33,414 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 278 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:33,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 2229 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:22:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4272 states. [2025-02-06 06:22:33,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4272 to 4264. [2025-02-06 06:22:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4264 states, 3165 states have (on average 1.2710900473933648) internal successors, (4023), 3233 states have internal predecessors, (4023), 782 states have call successors, (782), 317 states have call predecessors, (782), 316 states have return successors, (837), 761 states have call predecessors, (837), 781 states have call successors, (837) [2025-02-06 06:22:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4264 states to 4264 states and 5642 transitions. [2025-02-06 06:22:33,658 INFO L78 Accepts]: Start accepts. Automaton has 4264 states and 5642 transitions. Word has length 106 [2025-02-06 06:22:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:33,658 INFO L471 AbstractCegarLoop]: Abstraction has 4264 states and 5642 transitions. [2025-02-06 06:22:33,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-06 06:22:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 4264 states and 5642 transitions. [2025-02-06 06:22:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 06:22:33,667 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:33,668 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, 1, 1, 1] [2025-02-06 06:22:33,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 06:22:33,669 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:33,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1467872403, now seen corresponding path program 1 times [2025-02-06 06:22:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017780213] [2025-02-06 06:22:33,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:34,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 06:22:35,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 06:22:35,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:35,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-06 06:22:35,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:35,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017780213] [2025-02-06 06:22:35,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017780213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:35,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:35,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:35,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427639846] [2025-02-06 06:22:35,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:35,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:35,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:35,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:35,253 INFO L87 Difference]: Start difference. First operand 4264 states and 5642 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 06:22:39,276 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-02-06 06:22:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:39,955 INFO L93 Difference]: Finished difference Result 10132 states and 13403 transitions. [2025-02-06 06:22:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2025-02-06 06:22:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:40,007 INFO L225 Difference]: With dead ends: 10132 [2025-02-06 06:22:40,007 INFO L226 Difference]: Without dead ends: 6306 [2025-02-06 06:22:40,025 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-02-06 06:22:40,026 INFO L435 NwaCegarLoop]: 1237 mSDtfsCounter, 809 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:40,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2071 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-02-06 06:22:40,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6306 states. [2025-02-06 06:22:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6306 to 6298. [2025-02-06 06:22:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6298 states, 4713 states have (on average 1.2766815192022067) internal successors, (6017), 4829 states have internal predecessors, (6017), 1086 states have call successors, (1086), 499 states have call predecessors, (1086), 498 states have return successors, (1167), 1049 states have call predecessors, (1167), 1085 states have call successors, (1167) [2025-02-06 06:22:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6298 states to 6298 states and 8270 transitions. [2025-02-06 06:22:40,479 INFO L78 Accepts]: Start accepts. Automaton has 6298 states and 8270 transitions. Word has length 118 [2025-02-06 06:22:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 6298 states and 8270 transitions. [2025-02-06 06:22:40,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 06:22:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6298 states and 8270 transitions. [2025-02-06 06:22:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 06:22:40,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:40,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:40,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 06:22:40,488 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1457878184, now seen corresponding path program 1 times [2025-02-06 06:22:40,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:40,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357854889] [2025-02-06 06:22:40,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:41,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 06:22:41,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 06:22:41,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:41,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-06 06:22:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357854889] [2025-02-06 06:22:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357854889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:41,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:41,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:41,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285457167] [2025-02-06 06:22:41,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:41,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:41,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:41,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:41,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:41,937 INFO L87 Difference]: Start difference. First operand 6298 states and 8270 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:22:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:42,546 INFO L93 Difference]: Finished difference Result 12598 states and 16543 transitions. [2025-02-06 06:22:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-02-06 06:22:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:42,595 INFO L225 Difference]: With dead ends: 12598 [2025-02-06 06:22:42,595 INFO L226 Difference]: Without dead ends: 6317 [2025-02-06 06:22:42,619 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-02-06 06:22:42,621 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 39 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1978 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:42,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1978 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 06:22:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6317 states. [2025-02-06 06:22:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6317 to 6310. [2025-02-06 06:22:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6310 states, 4725 states have (on average 1.2766137566137565) internal successors, (6032), 4841 states have internal predecessors, (6032), 1086 states have call successors, (1086), 499 states have call predecessors, (1086), 498 states have return successors, (1167), 1049 states have call predecessors, (1167), 1085 states have call successors, (1167) [2025-02-06 06:22:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6310 states to 6310 states and 8285 transitions. [2025-02-06 06:22:42,943 INFO L78 Accepts]: Start accepts. Automaton has 6310 states and 8285 transitions. Word has length 123 [2025-02-06 06:22:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:42,944 INFO L471 AbstractCegarLoop]: Abstraction has 6310 states and 8285 transitions. [2025-02-06 06:22:42,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 06:22:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6310 states and 8285 transitions. [2025-02-06 06:22:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 06:22:42,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:42,952 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:42,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 06:22:42,952 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:42,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:42,953 INFO L85 PathProgramCache]: Analyzing trace with hash -660847887, now seen corresponding path program 1 times [2025-02-06 06:22:42,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:42,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270718483] [2025-02-06 06:22:42,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:42,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:43,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 06:22:44,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 06:22:44,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:44,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 06:22:44,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270718483] [2025-02-06 06:22:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270718483] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 06:22:44,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 06:22:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 06:22:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291631943] [2025-02-06 06:22:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 06:22:44,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 06:22:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:44,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 06:22:44,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 06:22:44,244 INFO L87 Difference]: Start difference. First operand 6310 states and 8285 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 06:22:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:44,871 INFO L93 Difference]: Finished difference Result 12618 states and 16577 transitions. [2025-02-06 06:22:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 06:22:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-02-06 06:22:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:44,908 INFO L225 Difference]: With dead ends: 12618 [2025-02-06 06:22:44,909 INFO L226 Difference]: Without dead ends: 6338 [2025-02-06 06:22:44,928 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-02-06 06:22:44,929 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 1 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:44,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1990 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 06:22:44,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2025-02-06 06:22:45,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6324. [2025-02-06 06:22:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6324 states, 4739 states have (on average 1.2757965815572905) internal successors, (6046), 4855 states have internal predecessors, (6046), 1086 states have call successors, (1086), 499 states have call predecessors, (1086), 498 states have return successors, (1167), 1049 states have call predecessors, (1167), 1085 states have call successors, (1167) [2025-02-06 06:22:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6324 states to 6324 states and 8299 transitions. [2025-02-06 06:22:45,225 INFO L78 Accepts]: Start accepts. Automaton has 6324 states and 8299 transitions. Word has length 139 [2025-02-06 06:22:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:45,226 INFO L471 AbstractCegarLoop]: Abstraction has 6324 states and 8299 transitions. [2025-02-06 06:22:45,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 06:22:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6324 states and 8299 transitions. [2025-02-06 06:22:45,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 06:22:45,233 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:45,234 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:45,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 06:22:45,234 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:45,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1285600974, now seen corresponding path program 1 times [2025-02-06 06:22:45,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:45,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951486189] [2025-02-06 06:22:45,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:45,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:46,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 06:22:46,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 06:22:46,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:46,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 06:22:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951486189] [2025-02-06 06:22:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951486189] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:22:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160524090] [2025-02-06 06:22:46,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 06:22:46,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:22:46,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:22:46,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:22:46,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 06:22:48,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 06:22:48,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 06:22:48,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 06:22:48,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:48,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 2294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 06:22:48,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 06:22:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-02-06 06:22:49,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 06:22:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 06:22:49,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160524090] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 06:22:49,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 06:22:49,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 06:22:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373842745] [2025-02-06 06:22:49,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 06:22:49,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 06:22:49,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 06:22:49,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 06:22:49,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:22:49,570 INFO L87 Difference]: Start difference. First operand 6324 states and 8299 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:22:50,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 06:22:50,429 INFO L93 Difference]: Finished difference Result 12702 states and 16689 transitions. [2025-02-06 06:22:50,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 06:22:50,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-02-06 06:22:50,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 06:22:50,471 INFO L225 Difference]: With dead ends: 12702 [2025-02-06 06:22:50,472 INFO L226 Difference]: Without dead ends: 6408 [2025-02-06 06:22:50,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 06:22:50,495 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 2 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 06:22:50,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3976 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 06:22:50,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6408 states. [2025-02-06 06:22:50,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6408 to 6408. [2025-02-06 06:22:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6408 states, 4823 states have (on average 1.2709931577856106) internal successors, (6130), 4939 states have internal predecessors, (6130), 1086 states have call successors, (1086), 499 states have call predecessors, (1086), 498 states have return successors, (1167), 1049 states have call predecessors, (1167), 1085 states have call successors, (1167) [2025-02-06 06:22:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6408 states to 6408 states and 8383 transitions. [2025-02-06 06:22:50,813 INFO L78 Accepts]: Start accepts. Automaton has 6408 states and 8383 transitions. Word has length 141 [2025-02-06 06:22:50,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 06:22:50,814 INFO L471 AbstractCegarLoop]: Abstraction has 6408 states and 8383 transitions. [2025-02-06 06:22:50,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-02-06 06:22:50,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6408 states and 8383 transitions. [2025-02-06 06:22:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-02-06 06:22:50,823 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 06:22:50,823 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 06:22:50,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 06:22:51,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 06:22:51,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 06:22:51,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 06:22:51,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2088255205, now seen corresponding path program 2 times [2025-02-06 06:22:51,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 06:22:51,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978206057] [2025-02-06 06:22:51,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:22:51,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 06:22:52,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes. [2025-02-06 06:22:52,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 06:22:52,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 06:22:52,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 06:22:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-06 06:22:53,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 06:22:53,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978206057] [2025-02-06 06:22:53,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978206057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 06:22:53,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966316732] [2025-02-06 06:22:53,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 06:22:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 06:22:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 06:22:53,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 06:22:53,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 06:22:55,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes.