./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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--usb_8dev.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 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:27:53,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:27:53,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:27:53,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:27:53,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:27:53,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:27:53,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:27:53,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:27:53,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:27:53,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:27:53,979 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:27:53,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:27:53,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:27:53,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:27:53,979 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:27:53,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:27:53,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:27:53,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:27:53,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:27:53,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:27:53,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:27:53,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:27:53,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:27:53,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:27:53,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:27:53,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:27:53,982 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:27:53,982 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:27:53,982 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 -> 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 [2025-01-09 18:27:54,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:27:54,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:27:54,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:27:54,209 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:27:54,210 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:27:54,210 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--usb_8dev.ko-entry_point.cil.out.i [2025-01-09 18:27:55,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61e35b06/875e6acf57244230ae81c069582ca257/FLAG907566e3a [2025-01-09 18:27:55,770 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:27:55,771 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--usb_8dev.ko-entry_point.cil.out.i [2025-01-09 18:27:55,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61e35b06/875e6acf57244230ae81c069582ca257/FLAG907566e3a [2025-01-09 18:27:55,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61e35b06/875e6acf57244230ae81c069582ca257 [2025-01-09 18:27:55,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:27:55,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:27:55,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:27:55,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:27:55,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:27:55,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:27:55" (1/1) ... [2025-01-09 18:27:55,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a04a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:55, skipping insertion in model container [2025-01-09 18:27:55,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:27:55" (1/1) ... [2025-01-09 18:27:55,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:27:56,670 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--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2025-01-09 18:27:56,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:27:57,007 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:27:57,105 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5402] [2025-01-09 18:27:57,108 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5440] [2025-01-09 18:27:57,108 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5447] [2025-01-09 18:27:57,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5455-5456] [2025-01-09 18:27:57,110 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [5484] [2025-01-09 18:27:57,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0": "+m" (v->counter)); [5491] [2025-01-09 18:27:57,117 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--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2025-01-09 18:27:57,156 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6228/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/usb_8dev.o.c.prepared"), "i" (621), "i" (12UL)); [6324-6325] [2025-01-09 18:27:57,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:27:57,281 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:27:57,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57 WrapperNode [2025-01-09 18:27:57,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:27:57,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:27:57,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:27:57,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:27:57,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,389 INFO L138 Inliner]: procedures = 174, calls = 830, calls flagged for inlining = 87, calls inlined = 87, statements flattened = 2590 [2025-01-09 18:27:57,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:27:57,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:27:57,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:27:57,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:27:57,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,407 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,640 INFO L175 MemorySlicer]: Split 464 memory accesses to 8 slices as follows [2, 5, 1, 341, 44, 31, 31, 9]. 73 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [2, 0, 0, 26, 0, 0, 0, 0]. The 249 writes are split as follows [0, 1, 0, 186, 44, 0, 18, 0]. [2025-01-09 18:27:57,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,716 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:27:57,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:27:57,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:27:57,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:27:57,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (1/1) ... [2025-01-09 18:27:57,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:27:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:27:57,811 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-01-09 18:27:57,817 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-01-09 18:27:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-01-09 18:27:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-01-09 18:27:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2025-01-09 18:27:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2025-01-09 18:27:57,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2025-01-09 18:27:57,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2025-01-09 18:27:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2025-01-09 18:27:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2025-01-09 18:27:57,834 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2025-01-09 18:27:57,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:27:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:27:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:27:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:27:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:27:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:27:57,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:27:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:27:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:27:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-01-09 18:27:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2025-01-09 18:27:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2025-01-09 18:27:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2025-01-09 18:27:57,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2025-01-09 18:27:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:27:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:27:57,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-01-09 18:27:57,839 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-01-09 18:27:57,839 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-01-09 18:27:57,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-01-09 18:27:57,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:27:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:27:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-01-09 18:27:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-01-09 18:27:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:27:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2025-01-09 18:27:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2025-01-09 18:27:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2025-01-09 18:27:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2025-01-09 18:27:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-01-09 18:27:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-01-09 18:27:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:27:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 18:27:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 18:27:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:27:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:27:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:27:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:27:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:27:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-01-09 18:27:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-01-09 18:27:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:27:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-01-09 18:27:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2025-01-09 18:27:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:27:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2025-01-09 18:27:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-01-09 18:27:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:27:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:27:57,846 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2025-01-09 18:27:57,846 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2025-01-09 18:27:58,297 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:27:58,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:27:58,369 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:27:59,010 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2025-01-09 18:28:06,427 INFO L? ?]: Removed 1198 outVars from TransFormulas that were not future-live. [2025-01-09 18:28:06,428 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:28:06,453 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:28:06,453 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 18:28:06,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:28:06 BoogieIcfgContainer [2025-01-09 18:28:06,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:28:06,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:28:06,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:28:06,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:28:06,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:27:55" (1/3) ... [2025-01-09 18:28:06,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c17355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:28:06, skipping insertion in model container [2025-01-09 18:28:06,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:27:57" (2/3) ... [2025-01-09 18:28:06,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c17355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:28:06, skipping insertion in model container [2025-01-09 18:28:06,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:28:06" (3/3) ... [2025-01-09 18:28:06,460 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2025-01-09 18:28:06,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:28:06,471 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i that has 62 procedures, 876 locations, 1 initial locations, 24 loop locations, and 1 error locations. [2025-01-09 18:28:06,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:28:06,538 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;@2b432116, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:28:06,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:28:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 811 states, 609 states have (on average 1.3464696223316912) internal successors, (820), 629 states have internal predecessors, (820), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2025-01-09 18:28:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 18:28:06,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:06,554 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-01-09 18:28:06,554 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:06,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:06,558 INFO L85 PathProgramCache]: Analyzing trace with hash 692818575, now seen corresponding path program 1 times [2025-01-09 18:28:06,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:06,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405971483] [2025-01-09 18:28:06,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:06,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:07,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 18:28:08,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 18:28:08,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 18:28:08,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405971483] [2025-01-09 18:28:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405971483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:08,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524242100] [2025-01-09 18:28:08,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:08,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:08,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:08,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:08,523 INFO L87 Difference]: Start difference. First operand has 811 states, 609 states have (on average 1.3464696223316912) internal successors, (820), 629 states have internal predecessors, (820), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 18:28:12,568 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-01-09 18:28:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:12,844 INFO L93 Difference]: Finished difference Result 2389 states and 3367 transitions. [2025-01-09 18:28:12,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:12,847 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-01-09 18:28:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:12,872 INFO L225 Difference]: With dead ends: 2389 [2025-01-09 18:28:12,872 INFO L226 Difference]: Without dead ends: 1559 [2025-01-09 18:28:12,882 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-01-09 18:28:12,885 INFO L435 NwaCegarLoop]: 1102 mSDtfsCounter, 1048 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:12,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 2177 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:28:12,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2025-01-09 18:28:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559. [2025-01-09 18:28:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1181 states have (on average 1.2963590177815412) internal successors, (1531), 1201 states have internal predecessors, (1531), 289 states have call successors, (289), 89 states have call predecessors, (289), 88 states have return successors, (284), 282 states have call predecessors, (284), 284 states have call successors, (284) [2025-01-09 18:28:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2104 transitions. [2025-01-09 18:28:13,031 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2104 transitions. Word has length 28 [2025-01-09 18:28:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:13,032 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2104 transitions. [2025-01-09 18:28:13,032 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-01-09 18:28:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2104 transitions. [2025-01-09 18:28:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 18:28:13,036 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:13,036 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-01-09 18:28:13,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:28:13,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:13,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash -225970067, now seen corresponding path program 1 times [2025-01-09 18:28:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860671248] [2025-01-09 18:28:13,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:14,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 18:28:14,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 18:28:14,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:14,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:28:14,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:14,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860671248] [2025-01-09 18:28:14,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860671248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:14,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677912975] [2025-01-09 18:28:14,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:14,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:14,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:14,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:14,571 INFO L87 Difference]: Start difference. First operand 1559 states and 2104 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 18:28:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:14,811 INFO L93 Difference]: Finished difference Result 4662 states and 6317 transitions. [2025-01-09 18:28:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:14,811 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-01-09 18:28:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:14,834 INFO L225 Difference]: With dead ends: 4662 [2025-01-09 18:28:14,834 INFO L226 Difference]: Without dead ends: 3110 [2025-01-09 18:28:14,842 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-01-09 18:28:14,843 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 1047 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:14,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2654 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:28:14,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3110 states. [2025-01-09 18:28:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3110 to 3100. [2025-01-09 18:28:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 2352 states have (on average 1.2950680272108843) internal successors, (3046), 2388 states have internal predecessors, (3046), 571 states have call successors, (571), 177 states have call predecessors, (571), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-01-09 18:28:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4197 transitions. [2025-01-09 18:28:14,990 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4197 transitions. Word has length 38 [2025-01-09 18:28:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:14,990 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4197 transitions. [2025-01-09 18:28:14,990 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-01-09 18:28:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4197 transitions. [2025-01-09 18:28:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 18:28:14,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:14,993 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-01-09 18:28:14,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:28:14,994 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:14,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:14,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1584445831, now seen corresponding path program 1 times [2025-01-09 18:28:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:14,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366429274] [2025-01-09 18:28:14,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:16,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 18:28:16,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 18:28:16,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:28:16,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:16,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366429274] [2025-01-09 18:28:16,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366429274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:16,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:16,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:16,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790193260] [2025-01-09 18:28:16,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:16,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:16,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:16,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:16,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:16,484 INFO L87 Difference]: Start difference. First operand 3100 states and 4197 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 18:28:16,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:16,546 INFO L93 Difference]: Finished difference Result 3102 states and 4198 transitions. [2025-01-09 18:28:16,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:16,546 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-01-09 18:28:16,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:16,559 INFO L225 Difference]: With dead ends: 3102 [2025-01-09 18:28:16,559 INFO L226 Difference]: Without dead ends: 3099 [2025-01-09 18:28:16,561 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-01-09 18:28:16,561 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 1048 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:16,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1071 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2025-01-09 18:28:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3099. [2025-01-09 18:28:16,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 2352 states have (on average 1.2946428571428572) internal successors, (3045), 2387 states have internal predecessors, (3045), 570 states have call successors, (570), 177 states have call predecessors, (570), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-01-09 18:28:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 4195 transitions. [2025-01-09 18:28:16,661 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 4195 transitions. Word has length 39 [2025-01-09 18:28:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:16,661 INFO L471 AbstractCegarLoop]: Abstraction has 3099 states and 4195 transitions. [2025-01-09 18:28:16,662 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-01-09 18:28:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 4195 transitions. [2025-01-09 18:28:16,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 18:28:16,664 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:16,664 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-01-09 18:28:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:28:16,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1872768688, now seen corresponding path program 1 times [2025-01-09 18:28:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:16,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898476642] [2025-01-09 18:28:16,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:16,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:17,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 18:28:17,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 18:28:17,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:17,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:28:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:17,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898476642] [2025-01-09 18:28:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898476642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75283193] [2025-01-09 18:28:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:17,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:17,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:17,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:17,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:17,948 INFO L87 Difference]: Start difference. First operand 3099 states and 4195 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 18:28:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:18,054 INFO L93 Difference]: Finished difference Result 3101 states and 4196 transitions. [2025-01-09 18:28:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:18,055 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-01-09 18:28:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:18,069 INFO L225 Difference]: With dead ends: 3101 [2025-01-09 18:28:18,069 INFO L226 Difference]: Without dead ends: 3098 [2025-01-09 18:28:18,071 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-01-09 18:28:18,071 INFO L435 NwaCegarLoop]: 1069 mSDtfsCounter, 1045 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:18,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1069 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2025-01-09 18:28:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 3098. [2025-01-09 18:28:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2352 states have (on average 1.2942176870748299) internal successors, (3044), 2386 states have internal predecessors, (3044), 569 states have call successors, (569), 177 states have call predecessors, (569), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-01-09 18:28:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4193 transitions. [2025-01-09 18:28:18,226 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4193 transitions. Word has length 40 [2025-01-09 18:28:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:18,226 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 4193 transitions. [2025-01-09 18:28:18,226 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-01-09 18:28:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4193 transitions. [2025-01-09 18:28:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 18:28:18,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:18,228 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-01-09 18:28:18,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:28:18,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:18,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:18,228 INFO L85 PathProgramCache]: Analyzing trace with hash -2074119766, now seen corresponding path program 1 times [2025-01-09 18:28:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:18,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245472475] [2025-01-09 18:28:18,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:19,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 18:28:19,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 18:28:19,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:19,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:28:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:19,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245472475] [2025-01-09 18:28:19,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245472475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:19,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:19,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:19,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577730898] [2025-01-09 18:28:19,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:19,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:19,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:19,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:19,329 INFO L87 Difference]: Start difference. First operand 3098 states and 4193 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 18:28:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:19,401 INFO L93 Difference]: Finished difference Result 3100 states and 4194 transitions. [2025-01-09 18:28:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:19,401 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-01-09 18:28:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:19,417 INFO L225 Difference]: With dead ends: 3100 [2025-01-09 18:28:19,417 INFO L226 Difference]: Without dead ends: 3097 [2025-01-09 18:28:19,419 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-01-09 18:28:19,420 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 1042 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:19,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1067 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2025-01-09 18:28:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3097. [2025-01-09 18:28:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3097 states, 2352 states have (on average 1.2937925170068028) internal successors, (3043), 2385 states have internal predecessors, (3043), 568 states have call successors, (568), 177 states have call predecessors, (568), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-01-09 18:28:19,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3097 states to 3097 states and 4191 transitions. [2025-01-09 18:28:19,565 INFO L78 Accepts]: Start accepts. Automaton has 3097 states and 4191 transitions. Word has length 41 [2025-01-09 18:28:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:19,565 INFO L471 AbstractCegarLoop]: Abstraction has 3097 states and 4191 transitions. [2025-01-09 18:28:19,565 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-01-09 18:28:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3097 states and 4191 transitions. [2025-01-09 18:28:19,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 18:28:19,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:19,566 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-01-09 18:28:19,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:28:19,567 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:19,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash 126394611, now seen corresponding path program 1 times [2025-01-09 18:28:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:19,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152156617] [2025-01-09 18:28:19,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:19,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:20,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 18:28:20,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 18:28:20,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:20,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:28:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152156617] [2025-01-09 18:28:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152156617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:20,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551075704] [2025-01-09 18:28:20,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:20,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:20,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:20,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:20,656 INFO L87 Difference]: Start difference. First operand 3097 states and 4191 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 18:28:20,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:20,743 INFO L93 Difference]: Finished difference Result 3099 states and 4192 transitions. [2025-01-09 18:28:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:20,744 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-01-09 18:28:20,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:20,758 INFO L225 Difference]: With dead ends: 3099 [2025-01-09 18:28:20,759 INFO L226 Difference]: Without dead ends: 3087 [2025-01-09 18:28:20,761 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-01-09 18:28:20,761 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 1039 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:20,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:28:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2025-01-09 18:28:20,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3087. [2025-01-09 18:28:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 2343 states have (on average 1.293213828425096) internal successors, (3030), 2375 states have internal predecessors, (3030), 567 states have call successors, (567), 177 states have call predecessors, (567), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2025-01-09 18:28:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4177 transitions. [2025-01-09 18:28:20,878 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4177 transitions. Word has length 42 [2025-01-09 18:28:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:20,879 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 4177 transitions. [2025-01-09 18:28:20,879 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-01-09 18:28:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4177 transitions. [2025-01-09 18:28:20,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-09 18:28:20,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:20,883 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:28:20,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:28:20,883 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:20,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash 461175421, now seen corresponding path program 1 times [2025-01-09 18:28:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816534086] [2025-01-09 18:28:20,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:22,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-09 18:28:22,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-09 18:28:22,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:22,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:22,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 18:28:22,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816534086] [2025-01-09 18:28:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816534086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606573630] [2025-01-09 18:28:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:22,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:22,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:22,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:22,325 INFO L87 Difference]: Start difference. First operand 3087 states and 4177 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:28:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:22,583 INFO L93 Difference]: Finished difference Result 7080 states and 9490 transitions. [2025-01-09 18:28:22,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:22,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 87 [2025-01-09 18:28:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:22,601 INFO L225 Difference]: With dead ends: 7080 [2025-01-09 18:28:22,601 INFO L226 Difference]: Without dead ends: 4000 [2025-01-09 18:28:22,610 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-01-09 18:28:22,611 INFO L435 NwaCegarLoop]: 1156 mSDtfsCounter, 302 mSDsluCounter, 1035 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:22,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 2191 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:28:22,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2025-01-09 18:28:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3992. [2025-01-09 18:28:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3992 states, 3028 states have (on average 1.2793923381770145) internal successors, (3874), 3068 states have internal predecessors, (3874), 712 states have call successors, (712), 252 states have call predecessors, (712), 251 states have return successors, (725), 707 states have call predecessors, (725), 711 states have call successors, (725) [2025-01-09 18:28:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 5311 transitions. [2025-01-09 18:28:22,762 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 5311 transitions. Word has length 87 [2025-01-09 18:28:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:22,763 INFO L471 AbstractCegarLoop]: Abstraction has 3992 states and 5311 transitions. [2025-01-09 18:28:22,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-01-09 18:28:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 5311 transitions. [2025-01-09 18:28:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 18:28:22,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:22,769 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:28:22,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:28:22,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1577639954, now seen corresponding path program 1 times [2025-01-09 18:28:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:22,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226917079] [2025-01-09 18:28:22,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:23,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 18:28:23,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 18:28:23,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:23,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 18:28:23,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:23,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226917079] [2025-01-09 18:28:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226917079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:23,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:23,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:23,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757848452] [2025-01-09 18:28:23,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:23,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:23,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:23,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:23,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:23,891 INFO L87 Difference]: Start difference. First operand 3992 states and 5311 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 18:28:27,909 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-01-09 18:28:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:28,255 INFO L93 Difference]: Finished difference Result 8924 states and 11830 transitions. [2025-01-09 18:28:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:28,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2025-01-09 18:28:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:28,277 INFO L225 Difference]: With dead ends: 8924 [2025-01-09 18:28:28,277 INFO L226 Difference]: Without dead ends: 4946 [2025-01-09 18:28:28,289 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-01-09 18:28:28,289 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 310 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 2389 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:28,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 2389 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:28:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2025-01-09 18:28:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4938. [2025-01-09 18:28:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 3756 states have (on average 1.2726304579339722) internal successors, (4780), 3804 states have internal predecessors, (4780), 856 states have call successors, (856), 326 states have call predecessors, (856), 325 states have return successors, (869), 851 states have call predecessors, (869), 855 states have call successors, (869) [2025-01-09 18:28:28,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6505 transitions. [2025-01-09 18:28:28,493 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6505 transitions. Word has length 103 [2025-01-09 18:28:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:28,493 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 6505 transitions. [2025-01-09 18:28:28,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 18:28:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6505 transitions. [2025-01-09 18:28:28,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 18:28:28,497 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:28,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:28:28,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:28:28,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:28,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:28,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1585331519, now seen corresponding path program 1 times [2025-01-09 18:28:28,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:28,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962864497] [2025-01-09 18:28:28,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:28,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:29,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 18:28:29,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 18:28:29,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:29,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 18:28:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962864497] [2025-01-09 18:28:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962864497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:29,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687436641] [2025-01-09 18:28:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:29,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:29,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:29,636 INFO L87 Difference]: Start difference. First operand 4938 states and 6505 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:28:33,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:28:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:34,041 INFO L93 Difference]: Finished difference Result 11924 states and 15644 transitions. [2025-01-09 18:28:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:34,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 115 [2025-01-09 18:28:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:34,070 INFO L225 Difference]: With dead ends: 11924 [2025-01-09 18:28:34,070 INFO L226 Difference]: Without dead ends: 7000 [2025-01-09 18:28:34,085 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-01-09 18:28:34,085 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 838 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 2236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:34,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 2236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:28:34,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7000 states. [2025-01-09 18:28:34,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7000 to 6992. [2025-01-09 18:28:34,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6992 states, 5364 states have (on average 1.2751677852348993) internal successors, (6840), 5436 states have internal predecessors, (6840), 1136 states have call successors, (1136), 492 states have call predecessors, (1136), 491 states have return successors, (1149), 1127 states have call predecessors, (1149), 1135 states have call successors, (1149) [2025-01-09 18:28:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 9125 transitions. [2025-01-09 18:28:34,309 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 9125 transitions. Word has length 115 [2025-01-09 18:28:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:34,310 INFO L471 AbstractCegarLoop]: Abstraction has 6992 states and 9125 transitions. [2025-01-09 18:28:34,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 18:28:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 9125 transitions. [2025-01-09 18:28:34,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 18:28:34,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:34,316 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:28:34,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 18:28:34,317 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:34,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:34,317 INFO L85 PathProgramCache]: Analyzing trace with hash 744643300, now seen corresponding path program 1 times [2025-01-09 18:28:34,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:34,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077655527] [2025-01-09 18:28:34,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:34,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:35,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 18:28:35,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 18:28:35,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:35,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 18:28:35,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077655527] [2025-01-09 18:28:35,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077655527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:28:35,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61834462] [2025-01-09 18:28:35,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:28:35,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:28:35,599 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-01-09 18:28:35,601 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-01-09 18:28:37,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 18:28:37,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 18:28:37,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:37,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:37,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:28:37,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:28:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 18:28:38,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:28:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61834462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:38,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:28:38,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-01-09 18:28:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350249714] [2025-01-09 18:28:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:38,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:28:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:38,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:28:38,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:28:38,588 INFO L87 Difference]: Start difference. First operand 6992 states and 9125 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:28:42,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:28:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:45,932 INFO L93 Difference]: Finished difference Result 20950 states and 27342 transitions. [2025-01-09 18:28:45,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:28:45,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 135 [2025-01-09 18:28:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:46,003 INFO L225 Difference]: With dead ends: 20950 [2025-01-09 18:28:46,003 INFO L226 Difference]: Without dead ends: 20942 [2025-01-09 18:28:46,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:28:46,010 INFO L435 NwaCegarLoop]: 1284 mSDtfsCounter, 2543 mSDsluCounter, 1809 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 217 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2543 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:46,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2543 Valid, 3093 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 310 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-01-09 18:28:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20942 states. [2025-01-09 18:28:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20942 to 20908. [2025-01-09 18:28:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20908 states, 16036 states have (on average 1.2757545522574207) internal successors, (20458), 16268 states have internal predecessors, (20458), 3400 states have call successors, (3400), 1472 states have call predecessors, (3400), 1471 states have return successors, (3441), 3359 states have call predecessors, (3441), 3399 states have call successors, (3441) [2025-01-09 18:28:46,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20908 states to 20908 states and 27299 transitions. [2025-01-09 18:28:47,008 INFO L78 Accepts]: Start accepts. Automaton has 20908 states and 27299 transitions. Word has length 135 [2025-01-09 18:28:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:47,008 INFO L471 AbstractCegarLoop]: Abstraction has 20908 states and 27299 transitions. [2025-01-09 18:28:47,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:28:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 20908 states and 27299 transitions. [2025-01-09 18:28:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 18:28:47,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:47,024 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:28:47,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:28:47,225 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,SelfDestructingSolverStorable9 [2025-01-09 18:28:47,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:47,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:47,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1380705662, now seen corresponding path program 1 times [2025-01-09 18:28:47,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:47,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430012243] [2025-01-09 18:28:47,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:47,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:48,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 18:28:48,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 18:28:48,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:48,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 18:28:48,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:48,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430012243] [2025-01-09 18:28:48,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430012243] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:48,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:48,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:48,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295400171] [2025-01-09 18:28:48,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:48,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:48,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:48,449 INFO L87 Difference]: Start difference. First operand 20908 states and 27299 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:28:52,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:28:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:53,245 INFO L93 Difference]: Finished difference Result 31878 states and 41617 transitions. [2025-01-09 18:28:53,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 145 [2025-01-09 18:28:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:53,303 INFO L225 Difference]: With dead ends: 31878 [2025-01-09 18:28:53,303 INFO L226 Difference]: Without dead ends: 10334 [2025-01-09 18:28:53,355 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-01-09 18:28:53,356 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 989 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:53,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1547 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:28:53,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10334 states. [2025-01-09 18:28:53,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10334 to 10334. [2025-01-09 18:28:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10334 states, 7921 states have (on average 1.273071581870976) internal successors, (10084), 8037 states have internal predecessors, (10084), 1684 states have call successors, (1684), 729 states have call predecessors, (1684), 728 states have return successors, (1704), 1663 states have call predecessors, (1704), 1683 states have call successors, (1704) [2025-01-09 18:28:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10334 states to 10334 states and 13472 transitions. [2025-01-09 18:28:53,997 INFO L78 Accepts]: Start accepts. Automaton has 10334 states and 13472 transitions. Word has length 145 [2025-01-09 18:28:53,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:53,998 INFO L471 AbstractCegarLoop]: Abstraction has 10334 states and 13472 transitions. [2025-01-09 18:28:53,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 3 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-01-09 18:28:53,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10334 states and 13472 transitions. [2025-01-09 18:28:54,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 18:28:54,010 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:54,010 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:28:54,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:28:54,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:54,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:54,011 INFO L85 PathProgramCache]: Analyzing trace with hash -240549902, now seen corresponding path program 1 times [2025-01-09 18:28:54,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:54,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289960775] [2025-01-09 18:28:54,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:54,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:28:54,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 18:28:55,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 18:28:55,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:28:55,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:28:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 18:28:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:28:55,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289960775] [2025-01-09 18:28:55,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289960775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:28:55,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:28:55,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:28:55,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018043238] [2025-01-09 18:28:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:28:55,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:28:55,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:28:55,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:28:55,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:28:55,183 INFO L87 Difference]: Start difference. First operand 10334 states and 13472 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:28:59,201 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-01-09 18:28:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:28:59,646 INFO L93 Difference]: Finished difference Result 19280 states and 25212 transitions. [2025-01-09 18:28:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:28:59,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 147 [2025-01-09 18:28:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:28:59,677 INFO L225 Difference]: With dead ends: 19280 [2025-01-09 18:28:59,678 INFO L226 Difference]: Without dead ends: 9692 [2025-01-09 18:28:59,693 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-01-09 18:28:59,694 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 832 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:28:59,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 2475 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 18:28:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2025-01-09 18:28:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9684. [2025-01-09 18:28:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9684 states, 7430 states have (on average 1.2714670255720053) internal successors, (9447), 7539 states have internal predecessors, (9447), 1579 states have call successors, (1579), 675 states have call predecessors, (1579), 674 states have return successors, (1599), 1559 states have call predecessors, (1599), 1578 states have call successors, (1599) [2025-01-09 18:28:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9684 states to 9684 states and 12625 transitions. [2025-01-09 18:28:59,977 INFO L78 Accepts]: Start accepts. Automaton has 9684 states and 12625 transitions. Word has length 147 [2025-01-09 18:28:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:28:59,978 INFO L471 AbstractCegarLoop]: Abstraction has 9684 states and 12625 transitions. [2025-01-09 18:28:59,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:28:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 9684 states and 12625 transitions. [2025-01-09 18:28:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 18:28:59,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:28:59,987 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:28:59,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 18:28:59,987 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:28:59,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:28:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash -178510288, now seen corresponding path program 1 times [2025-01-09 18:28:59,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:28:59,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401599378] [2025-01-09 18:28:59,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:28:59,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:00,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 18:29:00,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 18:29:00,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:00,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 18:29:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401599378] [2025-01-09 18:29:01,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401599378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:01,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:01,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 18:29:01,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259034604] [2025-01-09 18:29:01,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:01,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:29:01,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:01,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:29:01,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 18:29:01,178 INFO L87 Difference]: Start difference. First operand 9684 states and 12625 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:29:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:01,918 INFO L93 Difference]: Finished difference Result 23758 states and 31015 transitions. [2025-01-09 18:29:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:29:01,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 147 [2025-01-09 18:29:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:01,978 INFO L225 Difference]: With dead ends: 23758 [2025-01-09 18:29:01,978 INFO L226 Difference]: Without dead ends: 14820 [2025-01-09 18:29:02,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:29:02,004 INFO L435 NwaCegarLoop]: 1060 mSDtfsCounter, 1056 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:02,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 2946 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:29:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14820 states. [2025-01-09 18:29:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14820 to 14758. [2025-01-09 18:29:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14758 states, 11340 states have (on average 1.2731922398589066) internal successors, (14438), 11513 states have internal predecessors, (14438), 2389 states have call successors, (2389), 1029 states have call predecessors, (2389), 1028 states have return successors, (2421), 2347 states have call predecessors, (2421), 2388 states have call successors, (2421) [2025-01-09 18:29:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14758 states to 14758 states and 19248 transitions. [2025-01-09 18:29:02,682 INFO L78 Accepts]: Start accepts. Automaton has 14758 states and 19248 transitions. Word has length 147 [2025-01-09 18:29:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:02,682 INFO L471 AbstractCegarLoop]: Abstraction has 14758 states and 19248 transitions. [2025-01-09 18:29:02,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-01-09 18:29:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 14758 states and 19248 transitions. [2025-01-09 18:29:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 18:29:02,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:02,695 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:29:02,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:29:02,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:02,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1406441504, now seen corresponding path program 1 times [2025-01-09 18:29:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:02,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181666527] [2025-01-09 18:29:02,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:02,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:03,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 18:29:03,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 18:29:03,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:03,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 18:29:04,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:04,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181666527] [2025-01-09 18:29:04,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181666527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:04,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:04,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:29:04,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514532989] [2025-01-09 18:29:04,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:04,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:29:04,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:04,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:29:04,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:29:04,166 INFO L87 Difference]: Start difference. First operand 14758 states and 19248 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:29:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:29:04,595 INFO L93 Difference]: Finished difference Result 28980 states and 37991 transitions. [2025-01-09 18:29:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:29:04,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 147 [2025-01-09 18:29:04,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:29:04,651 INFO L225 Difference]: With dead ends: 28980 [2025-01-09 18:29:04,652 INFO L226 Difference]: Without dead ends: 14968 [2025-01-09 18:29:04,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:29:04,678 INFO L435 NwaCegarLoop]: 1058 mSDtfsCounter, 3 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4228 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:29:04,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4228 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:29:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14968 states. [2025-01-09 18:29:05,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14968 to 14911. [2025-01-09 18:29:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14911 states, 11448 states have (on average 1.2721872816212438) internal successors, (14564), 11630 states have internal predecessors, (14564), 2407 states have call successors, (2407), 1029 states have call predecessors, (2407), 1055 states have return successors, (2574), 2383 states have call predecessors, (2574), 2406 states have call successors, (2574) [2025-01-09 18:29:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14911 states to 14911 states and 19545 transitions. [2025-01-09 18:29:05,188 INFO L78 Accepts]: Start accepts. Automaton has 14911 states and 19545 transitions. Word has length 147 [2025-01-09 18:29:05,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:29:05,189 INFO L471 AbstractCegarLoop]: Abstraction has 14911 states and 19545 transitions. [2025-01-09 18:29:05,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 18:29:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 14911 states and 19545 transitions. [2025-01-09 18:29:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 18:29:05,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:29:05,202 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:29:05,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 18:29:05,202 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:29:05,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:29:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1231457088, now seen corresponding path program 1 times [2025-01-09 18:29:05,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:29:05,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417001284] [2025-01-09 18:29:05,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:29:05,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:29:06,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 18:29:06,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 18:29:06,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:29:06,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:29:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 18:29:09,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:29:09,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417001284] [2025-01-09 18:29:09,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417001284] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:29:09,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:29:09,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 18:29:09,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866978449] [2025-01-09 18:29:09,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:29:09,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 18:29:09,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:29:09,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 18:29:09,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 18:29:09,007 INFO L87 Difference]: Start difference. First operand 14911 states and 19545 transitions. Second operand has 12 states, 12 states have (on average 8.583333333333334) internal successors, (103), 10 states have internal predecessors, (103), 5 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14)