./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 03:11:12,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 03:11:12,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 03:11:12,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 03:11:12,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 03:11:12,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 03:11:12,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 03:11:12,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 03:11:12,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 03:11:12,471 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 03:11:12,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 03:11:12,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 03:11:12,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 03:11:12,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 03:11:12,473 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 03:11:12,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 03:11:12,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 03:11:12,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 03:11:12,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 03:11:12,473 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 03:11:12,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 03:11:12,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 03:11:12,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:11:12,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 03:11:12,475 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2025-03-04 03:11:12,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 03:11:12,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 03:11:12,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 03:11:12,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 03:11:12,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 03:11:12,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-03-04 03:11:13,932 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d01689df/c73cb2a9d5fc495bbebb1c4d0790cb6f/FLAG24f36989f [2025-03-04 03:11:14,376 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 03:11:14,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-03-04 03:11:14,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d01689df/c73cb2a9d5fc495bbebb1c4d0790cb6f/FLAG24f36989f [2025-03-04 03:11:14,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d01689df/c73cb2a9d5fc495bbebb1c4d0790cb6f [2025-03-04 03:11:14,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 03:11:14,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 03:11:14,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 03:11:14,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 03:11:14,442 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 03:11:14,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:11:14" (1/1) ... [2025-03-04 03:11:14,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ce86567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:14, skipping insertion in model container [2025-03-04 03:11:14,445 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:11:14" (1/1) ... [2025-03-04 03:11:14,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 03:11:15,514 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-03-04 03:11:15,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:11:15,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 03:11:15,709 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4831-4837] [2025-03-04 03:11:15,711 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [4844-4850] [2025-03-04 03:11:15,712 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "btr %2,%1\n\t" "sbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [4857-4864] [2025-03-04 03:11:15,713 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "incl %0": "+m" (v->counter)); [4894-4900] [2025-03-04 03:11:15,715 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".section .smp_locks,\"a\"\n" ".balign 4\n" ".long 671f - .\n" ".previous\n" "671:" "\n\tlock; " "decl %0": "+m" (v->counter)); [4907-4913] [2025-03-04 03:11:15,770 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n" ".pushsection __bug_table,\"a\"\n" "2:\t.long 1b - 2b, %c0 - 2b\n" "\t.word %c1, 0\n" "\t.org 2b+%c2\n" ".popsection": : "i" ("/anthill/stuff/tacas-comp/work/current--X--drivers/net/can/usb/ems_usb.ko--X--bulklinux-3.0.1--X--68_1/linux-3.0.1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/68_1/drivers/net/can/usb/ems_usb.c.common.c"), "i" (510), "i" (sizeof(struct bug_entry ))); [5717-5723] [2025-03-04 03:11:15,854 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-03-04 03:11:15,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 03:11:15,974 INFO L204 MainTranslator]: Completed translation [2025-03-04 03:11:15,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15 WrapperNode [2025-03-04 03:11:15,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 03:11:15,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 03:11:15,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 03:11:15,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 03:11:15,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,097 INFO L138 Inliner]: procedures = 132, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1635 [2025-03-04 03:11:16,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 03:11:16,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 03:11:16,098 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 03:11:16,098 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 03:11:16,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,237 INFO L175 MemorySlicer]: Split 342 memory accesses to 8 slices as follows [42, 2, 8, 3, 8, 10, 8, 261]. 76 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [0, 2, 8, 0, 8, 0, 8, 8]. The 214 writes are split as follows [42, 0, 0, 0, 0, 0, 0, 172]. [2025-03-04 03:11:16,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,319 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 03:11:16,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 03:11:16,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 03:11:16,322 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 03:11:16,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (1/1) ... [2025-03-04 03:11:16,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 03:11:16,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 03:11:16,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 03:11:16,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 03:11:16,372 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-04 03:11:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-04 03:11:16,372 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2025-03-04 03:11:16,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2025-03-04 03:11:16,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-04 03:11:16,373 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 03:11:16,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-04 03:11:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 03:11:16,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2025-03-04 03:11:16,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2025-03-04 03:11:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-04 03:11:16,376 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-04 03:11:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-04 03:11:16,377 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-04 03:11:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 03:11:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 03:11:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 03:11:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 03:11:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 03:11:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 03:11:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 03:11:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 03:11:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-04 03:11:16,378 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-04 03:11:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-04 03:11:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-04 03:11:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-04 03:11:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-04 03:11:16,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-03-04 03:11:16,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-04 03:11:16,380 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-04 03:11:16,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 03:11:16,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 03:11:16,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 03:11:16,652 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 03:11:16,654 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 03:11:16,711 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7025: havoc usb_register_driver_#t~nondet398#1; [2025-03-04 03:11:16,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7029: havoc #t~nondet399; [2025-03-04 03:11:16,752 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809: call ULTIMATE.dealloc(~#cmd~0.base, ~#cmd~0.offset);havoc ~#cmd~0.base, ~#cmd~0.offset; [2025-03-04 03:11:16,777 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5248: havoc #t~mem35;havoc #t~bitwise36; [2025-03-04 03:11:16,788 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6912: havoc #t~malloc381.base, #t~malloc381.offset; [2025-03-04 03:11:16,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-03-04 03:11:16,952 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5780: call ULTIMATE.dealloc(~#actual_length~0#1.base, ~#actual_length~0#1.offset);havoc ~#actual_length~0#1.base, ~#actual_length~0#1.offset; [2025-03-04 03:11:16,952 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7015: havoc usb_bulk_msg_#t~nondet397#1; [2025-03-04 03:11:16,974 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7036: havoc usb_unlink_urb_#t~nondet400#1; [2025-03-04 03:11:17,033 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7001: havoc #t~nondet395; [2025-03-04 03:11:17,037 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6956: havoc #t~nondet387; [2025-03-04 03:11:17,052 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6915: havoc __kmalloc_#t~ret382#1.base, __kmalloc_#t~ret382#1.offset; [2025-03-04 03:11:17,068 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6963: havoc dev_set_drvdata_#t~nondet389#1; [2025-03-04 03:11:17,072 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4970: havoc #t~mem10.base, #t~mem10.offset; [2025-03-04 03:11:17,075 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6982: havoc #t~ret391.base, #t~ret391.offset; [2025-03-04 03:11:17,081 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6967: havoc #t~nondet390; [2025-03-04 03:11:22,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7005: havoc register_candev_#t~nondet396#1; [2025-03-04 03:11:22,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6959: havoc dev_get_drvdata_#t~ret388#1.base, dev_get_drvdata_#t~ret388#1.offset; [2025-03-04 03:11:22,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4881: havoc atomic_read_#t~mem4#1; [2025-03-04 03:11:22,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: havoc open_candev_#t~nondet394#1; [2025-03-04 03:11:22,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6934: havoc alloc_candev_#t~ret386#1.base, alloc_candev_#t~ret386#1.offset; [2025-03-04 03:11:22,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume false; [2025-03-04 03:11:22,391 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume !false; [2025-03-04 03:11:22,594 INFO L? ?]: Removed 597 outVars from TransFormulas that were not future-live. [2025-03-04 03:11:22,594 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 03:11:22,622 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 03:11:22,627 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 03:11:22,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:11:22 BoogieIcfgContainer [2025-03-04 03:11:22,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 03:11:22,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 03:11:22,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 03:11:22,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 03:11:22,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:11:14" (1/3) ... [2025-03-04 03:11:22,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191f5c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:11:22, skipping insertion in model container [2025-03-04 03:11:22,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:11:15" (2/3) ... [2025-03-04 03:11:22,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191f5c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:11:22, skipping insertion in model container [2025-03-04 03:11:22,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:11:22" (3/3) ... [2025-03-04 03:11:22,634 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-03-04 03:11:22,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 03:11:22,646 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i that has 39 procedures, 519 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-03-04 03:11:22,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 03:11:22,705 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;@62c4837b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 03:11:22,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 03:11:22,712 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 367 states have (on average 1.3106267029972751) internal successors, (481), 379 states have internal predecessors, (481), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-04 03:11:22,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 03:11:22,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:22,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:22,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:22,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1344637608, now seen corresponding path program 1 times [2025-03-04 03:11:22,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543622695] [2025-03-04 03:11:22,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:22,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:24,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 03:11:24,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 03:11:24,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:24,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543622695] [2025-03-04 03:11:25,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543622695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:25,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:25,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:11:25,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977967366] [2025-03-04 03:11:25,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:25,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:11:25,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:25,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:11:25,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:11:25,560 INFO L87 Difference]: Start difference. First operand has 518 states, 367 states have (on average 1.3106267029972751) internal successors, (481), 379 states have internal predecessors, (481), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:11:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:25,946 INFO L93 Difference]: Finished difference Result 1020 states and 1408 transitions. [2025-03-04 03:11:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:11:25,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-04 03:11:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:25,957 INFO L225 Difference]: With dead ends: 1020 [2025-03-04 03:11:25,959 INFO L226 Difference]: Without dead ends: 511 [2025-03-04 03:11:25,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:11:25,967 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 0 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:25,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2641 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:11:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-04 03:11:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-04 03:11:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 363 states have (on average 1.2479338842975207) internal successors, (453), 371 states have internal predecessors, (453), 110 states have call successors, (110), 37 states have call predecessors, (110), 37 states have return successors, (107), 105 states have call predecessors, (107), 106 states have call successors, (107) [2025-03-04 03:11:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 670 transitions. [2025-03-04 03:11:26,029 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 670 transitions. Word has length 21 [2025-03-04 03:11:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:26,030 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 670 transitions. [2025-03-04 03:11:26,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 03:11:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 670 transitions. [2025-03-04 03:11:26,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 03:11:26,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:26,031 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:26,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 03:11:26,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:26,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:26,032 INFO L85 PathProgramCache]: Analyzing trace with hash 131661629, now seen corresponding path program 1 times [2025-03-04 03:11:26,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:26,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348160493] [2025-03-04 03:11:26,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:26,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:27,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 03:11:27,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 03:11:27,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:27,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 03:11:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348160493] [2025-03-04 03:11:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348160493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:28,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:28,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:11:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237818978] [2025-03-04 03:11:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:11:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:28,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:11:28,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:28,046 INFO L87 Difference]: Start difference. First operand 511 states and 670 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 03:11:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:28,321 INFO L93 Difference]: Finished difference Result 1489 states and 1967 transitions. [2025-03-04 03:11:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:11:28,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-04 03:11:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:28,327 INFO L225 Difference]: With dead ends: 1489 [2025-03-04 03:11:28,327 INFO L226 Difference]: Without dead ends: 998 [2025-03-04 03:11:28,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:28,331 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 654 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:28,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1538 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:11:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-04 03:11:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 994. [2025-03-04 03:11:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 708 states have (on average 1.2485875706214689) internal successors, (884), 720 states have internal predecessors, (884), 213 states have call successors, (213), 72 states have call predecessors, (213), 72 states have return successors, (213), 206 states have call predecessors, (213), 209 states have call successors, (213) [2025-03-04 03:11:28,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1310 transitions. [2025-03-04 03:11:28,392 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1310 transitions. Word has length 26 [2025-03-04 03:11:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:28,393 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1310 transitions. [2025-03-04 03:11:28,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 03:11:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1310 transitions. [2025-03-04 03:11:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 03:11:28,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:28,394 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:28,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 03:11:28,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:28,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:28,394 INFO L85 PathProgramCache]: Analyzing trace with hash -214008906, now seen corresponding path program 1 times [2025-03-04 03:11:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:28,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012311430] [2025-03-04 03:11:28,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:28,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:30,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 03:11:30,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 03:11:30,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:30,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:30,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 03:11:30,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012311430] [2025-03-04 03:11:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012311430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:30,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:30,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:11:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328609685] [2025-03-04 03:11:30,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:30,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:11:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:30,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:11:30,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:30,188 INFO L87 Difference]: Start difference. First operand 994 states and 1310 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 03:11:30,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:30,436 INFO L93 Difference]: Finished difference Result 2939 states and 3889 transitions. [2025-03-04 03:11:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:11:30,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-04 03:11:30,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:30,449 INFO L225 Difference]: With dead ends: 2939 [2025-03-04 03:11:30,449 INFO L226 Difference]: Without dead ends: 1957 [2025-03-04 03:11:30,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:30,454 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 653 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:30,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1449 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:11:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2025-03-04 03:11:30,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1946. [2025-03-04 03:11:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1387 states have (on average 1.2465753424657535) internal successors, (1729), 1406 states have internal predecessors, (1729), 418 states have call successors, (418), 141 states have call predecessors, (418), 140 states have return successors, (424), 406 states have call predecessors, (424), 414 states have call successors, (424) [2025-03-04 03:11:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2571 transitions. [2025-03-04 03:11:30,537 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2571 transitions. Word has length 27 [2025-03-04 03:11:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:30,537 INFO L471 AbstractCegarLoop]: Abstraction has 1946 states and 2571 transitions. [2025-03-04 03:11:30,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 03:11:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2571 transitions. [2025-03-04 03:11:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 03:11:30,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:30,540 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:30,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 03:11:30,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:30,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash -263472553, now seen corresponding path program 1 times [2025-03-04 03:11:30,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:30,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960122087] [2025-03-04 03:11:30,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:32,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 03:11:32,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 03:11:32,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:32,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 03:11:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960122087] [2025-03-04 03:11:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960122087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:32,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:32,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:11:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644716478] [2025-03-04 03:11:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:32,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:11:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:32,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:11:32,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:32,513 INFO L87 Difference]: Start difference. First operand 1946 states and 2571 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:32,778 INFO L93 Difference]: Finished difference Result 4788 states and 6540 transitions. [2025-03-04 03:11:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:11:32,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-04 03:11:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:32,791 INFO L225 Difference]: With dead ends: 4788 [2025-03-04 03:11:32,791 INFO L226 Difference]: Without dead ends: 2857 [2025-03-04 03:11:32,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:11:32,798 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 261 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:32,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1338 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:11:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2857 states. [2025-03-04 03:11:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2857 to 2845. [2025-03-04 03:11:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2034 states have (on average 1.2807276302851525) internal successors, (2605), 2069 states have internal predecessors, (2605), 670 states have call successors, (670), 141 states have call predecessors, (670), 140 states have return successors, (684), 650 states have call predecessors, (684), 666 states have call successors, (684) [2025-03-04 03:11:32,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3959 transitions. [2025-03-04 03:11:32,888 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3959 transitions. Word has length 76 [2025-03-04 03:11:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:32,888 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 3959 transitions. [2025-03-04 03:11:32,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:32,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3959 transitions. [2025-03-04 03:11:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 03:11:32,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:32,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:11:32,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 03:11:32,892 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2124010396, now seen corresponding path program 1 times [2025-03-04 03:11:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:32,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707752837] [2025-03-04 03:11:32,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:32,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:34,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 03:11:34,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 03:11:34,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:34,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:34,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:34,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707752837] [2025-03-04 03:11:34,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707752837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:34,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:34,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 03:11:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395843382] [2025-03-04 03:11:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:34,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 03:11:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:34,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 03:11:34,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:34,917 INFO L87 Difference]: Start difference. First operand 2845 states and 3959 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:35,250 INFO L93 Difference]: Finished difference Result 5690 states and 7923 transitions. [2025-03-04 03:11:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 03:11:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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 79 [2025-03-04 03:11:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:35,265 INFO L225 Difference]: With dead ends: 5690 [2025-03-04 03:11:35,265 INFO L226 Difference]: Without dead ends: 2861 [2025-03-04 03:11:35,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 03:11:35,273 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 0 mSDsluCounter, 1296 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:35,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1948 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:11:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2025-03-04 03:11:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2861. [2025-03-04 03:11:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2050 states have (on average 1.2785365853658537) internal successors, (2621), 2085 states have internal predecessors, (2621), 670 states have call successors, (670), 141 states have call predecessors, (670), 140 states have return successors, (684), 650 states have call predecessors, (684), 666 states have call successors, (684) [2025-03-04 03:11:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 3975 transitions. [2025-03-04 03:11:35,357 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 3975 transitions. Word has length 79 [2025-03-04 03:11:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:35,358 INFO L471 AbstractCegarLoop]: Abstraction has 2861 states and 3975 transitions. [2025-03-04 03:11:35,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 3975 transitions. [2025-03-04 03:11:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 03:11:35,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:35,362 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:35,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 03:11:35,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:35,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:35,363 INFO L85 PathProgramCache]: Analyzing trace with hash -427638302, now seen corresponding path program 1 times [2025-03-04 03:11:35,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:35,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987873455] [2025-03-04 03:11:35,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:35,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:37,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 03:11:37,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 03:11:37,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:37,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987873455] [2025-03-04 03:11:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987873455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:37,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:11:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873631083] [2025-03-04 03:11:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:37,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:11:37,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:37,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:11:37,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:11:37,467 INFO L87 Difference]: Start difference. First operand 2861 states and 3975 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:37,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:37,959 INFO L93 Difference]: Finished difference Result 5722 states and 7955 transitions. [2025-03-04 03:11:37,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 03:11:37,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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 80 [2025-03-04 03:11:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:37,976 INFO L225 Difference]: With dead ends: 5722 [2025-03-04 03:11:37,976 INFO L226 Difference]: Without dead ends: 2877 [2025-03-04 03:11:37,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:11:37,987 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 0 mSDsluCounter, 2588 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3238 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:37,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3238 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:11:37,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2877 states. [2025-03-04 03:11:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2877 to 2877. [2025-03-04 03:11:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2877 states, 2066 states have (on average 1.276379477250726) internal successors, (2637), 2101 states have internal predecessors, (2637), 670 states have call successors, (670), 141 states have call predecessors, (670), 140 states have return successors, (684), 650 states have call predecessors, (684), 666 states have call successors, (684) [2025-03-04 03:11:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3991 transitions. [2025-03-04 03:11:38,077 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3991 transitions. Word has length 80 [2025-03-04 03:11:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:38,077 INFO L471 AbstractCegarLoop]: Abstraction has 2877 states and 3991 transitions. [2025-03-04 03:11:38,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3991 transitions. [2025-03-04 03:11:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 03:11:38,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:38,080 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:38,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 03:11:38,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:38,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:38,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1030029539, now seen corresponding path program 1 times [2025-03-04 03:11:38,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:38,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560337837] [2025-03-04 03:11:38,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:38,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:39,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 03:11:39,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 03:11:39,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:40,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:40,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560337837] [2025-03-04 03:11:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560337837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:40,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:11:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594730382] [2025-03-04 03:11:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:40,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:11:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:40,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:11:40,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:40,558 INFO L87 Difference]: Start difference. First operand 2877 states and 3991 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:41,137 INFO L93 Difference]: Finished difference Result 4345 states and 6054 transitions. [2025-03-04 03:11:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:11:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-03-04 03:11:41,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:41,153 INFO L225 Difference]: With dead ends: 4345 [2025-03-04 03:11:41,154 INFO L226 Difference]: Without dead ends: 2905 [2025-03-04 03:11:41,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:41,159 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 0 mSDsluCounter, 3256 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3908 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:41,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3908 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 03:11:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2025-03-04 03:11:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2905. [2025-03-04 03:11:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2905 states, 2086 states have (on average 1.2737296260786193) internal successors, (2657), 2121 states have internal predecessors, (2657), 670 states have call successors, (670), 141 states have call predecessors, (670), 148 states have return successors, (708), 658 states have call predecessors, (708), 666 states have call successors, (708) [2025-03-04 03:11:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 4035 transitions. [2025-03-04 03:11:41,245 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 4035 transitions. Word has length 80 [2025-03-04 03:11:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:41,246 INFO L471 AbstractCegarLoop]: Abstraction has 2905 states and 4035 transitions. [2025-03-04 03:11:41,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 4035 transitions. [2025-03-04 03:11:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 03:11:41,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:41,248 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:41,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 03:11:41,248 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:41,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:41,249 INFO L85 PathProgramCache]: Analyzing trace with hash 842311879, now seen corresponding path program 1 times [2025-03-04 03:11:41,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:41,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626219471] [2025-03-04 03:11:41,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:41,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:42,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:11:42,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:11:42,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:42,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:11:43,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:43,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626219471] [2025-03-04 03:11:43,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626219471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:43,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:43,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:11:43,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414863017] [2025-03-04 03:11:43,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:43,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:11:43,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:43,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:11:43,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:11:43,375 INFO L87 Difference]: Start difference. First operand 2905 states and 4035 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:43,808 INFO L93 Difference]: Finished difference Result 5552 states and 7685 transitions. [2025-03-04 03:11:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:11:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-04 03:11:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:43,826 INFO L225 Difference]: With dead ends: 5552 [2025-03-04 03:11:43,827 INFO L226 Difference]: Without dead ends: 2663 [2025-03-04 03:11:43,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:11:43,837 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 0 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:43,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2609 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:11:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2025-03-04 03:11:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2663. [2025-03-04 03:11:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 1920 states have (on average 1.2640625) internal successors, (2427), 1937 states have internal predecessors, (2427), 594 states have call successors, (594), 139 states have call predecessors, (594), 148 states have return successors, (640), 594 states have call predecessors, (640), 590 states have call successors, (640) [2025-03-04 03:11:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3661 transitions. [2025-03-04 03:11:43,930 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3661 transitions. Word has length 85 [2025-03-04 03:11:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:43,932 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3661 transitions. [2025-03-04 03:11:43,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3661 transitions. [2025-03-04 03:11:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 03:11:43,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:43,938 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:43,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 03:11:43,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:43,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:43,942 INFO L85 PathProgramCache]: Analyzing trace with hash 670241, now seen corresponding path program 1 times [2025-03-04 03:11:43,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318777812] [2025-03-04 03:11:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:45,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 03:11:45,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 03:11:45,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:45,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:46,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 03:11:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318777812] [2025-03-04 03:11:46,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318777812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:46,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:46,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 03:11:46,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564860593] [2025-03-04 03:11:46,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:46,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 03:11:46,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:46,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 03:11:46,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 03:11:46,503 INFO L87 Difference]: Start difference. First operand 2663 states and 3661 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:47,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:47,504 INFO L93 Difference]: Finished difference Result 5322 states and 7339 transitions. [2025-03-04 03:11:47,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 03:11:47,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-03-04 03:11:47,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:47,518 INFO L225 Difference]: With dead ends: 5322 [2025-03-04 03:11:47,518 INFO L226 Difference]: Without dead ends: 2675 [2025-03-04 03:11:47,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 03:11:47,526 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 57 mSDsluCounter, 5203 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 5865 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:47,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 5865 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 03:11:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2675 states. [2025-03-04 03:11:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2675 to 2659. [2025-03-04 03:11:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 1916 states have (on average 1.260438413361169) internal successors, (2415), 1935 states have internal predecessors, (2415), 594 states have call successors, (594), 139 states have call predecessors, (594), 148 states have return successors, (640), 592 states have call predecessors, (640), 590 states have call successors, (640) [2025-03-04 03:11:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 3649 transitions. [2025-03-04 03:11:47,599 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 3649 transitions. Word has length 80 [2025-03-04 03:11:47,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:47,600 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 3649 transitions. [2025-03-04 03:11:47,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:11:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3649 transitions. [2025-03-04 03:11:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 03:11:47,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:47,603 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 03:11:47,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:47,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:47,606 INFO L85 PathProgramCache]: Analyzing trace with hash -589996795, now seen corresponding path program 1 times [2025-03-04 03:11:47,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:47,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431220321] [2025-03-04 03:11:47,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:47,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:49,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:11:49,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:11:49,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:49,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 03:11:49,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:49,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431220321] [2025-03-04 03:11:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431220321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 03:11:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202809478] [2025-03-04 03:11:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 03:11:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:49,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 03:11:49,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:49,977 INFO L87 Difference]: Start difference. First operand 2659 states and 3649 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 03:11:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:11:50,467 INFO L93 Difference]: Finished difference Result 3998 states and 5499 transitions. [2025-03-04 03:11:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:11:50,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-03-04 03:11:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:11:50,482 INFO L225 Difference]: With dead ends: 3998 [2025-03-04 03:11:50,483 INFO L226 Difference]: Without dead ends: 2667 [2025-03-04 03:11:50,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:11:50,487 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 3262 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:11:50,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3916 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:11:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-03-04 03:11:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2667. [2025-03-04 03:11:50,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2667 states, 1924 states have (on average 1.2593555093555093) internal successors, (2423), 1939 states have internal predecessors, (2423), 594 states have call successors, (594), 139 states have call predecessors, (594), 148 states have return successors, (640), 596 states have call predecessors, (640), 590 states have call successors, (640) [2025-03-04 03:11:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 3657 transitions. [2025-03-04 03:11:50,561 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 3657 transitions. Word has length 85 [2025-03-04 03:11:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:11:50,562 INFO L471 AbstractCegarLoop]: Abstraction has 2667 states and 3657 transitions. [2025-03-04 03:11:50,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 03:11:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 3657 transitions. [2025-03-04 03:11:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 03:11:50,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:11:50,564 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:11:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 03:11:50,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:11:50,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:11:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1404147911, now seen corresponding path program 1 times [2025-03-04 03:11:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:11:50,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886759883] [2025-03-04 03:11:50,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:11:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:11:52,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 03:11:52,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 03:11:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:11:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:11:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:11:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:11:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886759883] [2025-03-04 03:11:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886759883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:11:52,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:11:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:11:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564860144] [2025-03-04 03:11:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:11:52,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:11:52,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:11:52,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:11:52,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:11:52,863 INFO L87 Difference]: Start difference. First operand 2667 states and 3657 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:11:56,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:12:00,939 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-03-04 03:12:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:10,827 INFO L93 Difference]: Finished difference Result 4150 states and 5741 transitions. [2025-03-04 03:12:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:12:10,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 85 [2025-03-04 03:12:10,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:10,857 INFO L225 Difference]: With dead ends: 4150 [2025-03-04 03:12:10,858 INFO L226 Difference]: Without dead ends: 4145 [2025-03-04 03:12:10,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:12:10,864 INFO L435 NwaCegarLoop]: 1001 mSDtfsCounter, 1342 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 226 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.7s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:10,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 2593 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1489 Invalid, 2 Unknown, 0 Unchecked, 17.7s Time] [2025-03-04 03:12:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4145 states. [2025-03-04 03:12:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4145 to 4115. [2025-03-04 03:12:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4115 states, 2966 states have (on average 1.26298044504383) internal successors, (3746), 2995 states have internal predecessors, (3746), 924 states have call successors, (924), 207 states have call predecessors, (924), 224 states have return successors, (1036), 928 states have call predecessors, (1036), 920 states have call successors, (1036) [2025-03-04 03:12:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 5706 transitions. [2025-03-04 03:12:10,987 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 5706 transitions. Word has length 85 [2025-03-04 03:12:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:10,988 INFO L471 AbstractCegarLoop]: Abstraction has 4115 states and 5706 transitions. [2025-03-04 03:12:10,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:12:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 5706 transitions. [2025-03-04 03:12:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 03:12:10,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:10,992 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:12:10,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 03:12:10,992 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:10,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1345155355, now seen corresponding path program 1 times [2025-03-04 03:12:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:10,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032347822] [2025-03-04 03:12:10,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:10,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:12,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 03:12:12,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 03:12:12,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:12,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:12:13,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:13,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032347822] [2025-03-04 03:12:13,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032347822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:13,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:13,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:12:13,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817103311] [2025-03-04 03:12:13,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:13,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:12:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:13,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:12:13,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:13,122 INFO L87 Difference]: Start difference. First operand 4115 states and 5706 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:12:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:13,574 INFO L93 Difference]: Finished difference Result 7549 states and 10491 transitions. [2025-03-04 03:12:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:12:13,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-03-04 03:12:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:13,590 INFO L225 Difference]: With dead ends: 7549 [2025-03-04 03:12:13,591 INFO L226 Difference]: Without dead ends: 3450 [2025-03-04 03:12:13,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:13,602 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:13,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2606 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 03:12:13,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2025-03-04 03:12:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3450. [2025-03-04 03:12:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2493 states have (on average 1.263537906137184) internal successors, (3150), 2515 states have internal predecessors, (3150), 773 states have call successors, (773), 168 states have call predecessors, (773), 183 states have return successors, (871), 782 states have call predecessors, (871), 769 states have call successors, (871) [2025-03-04 03:12:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4794 transitions. [2025-03-04 03:12:13,698 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4794 transitions. Word has length 105 [2025-03-04 03:12:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:13,699 INFO L471 AbstractCegarLoop]: Abstraction has 3450 states and 4794 transitions. [2025-03-04 03:12:13,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 03:12:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4794 transitions. [2025-03-04 03:12:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 03:12:13,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:13,703 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 03:12:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 03:12:13,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash 276048867, now seen corresponding path program 1 times [2025-03-04 03:12:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:13,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540771730] [2025-03-04 03:12:13,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:13,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:15,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 03:12:15,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 03:12:15,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:15,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:12:16,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:16,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540771730] [2025-03-04 03:12:16,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540771730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:16,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:16,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 03:12:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344738151] [2025-03-04 03:12:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:16,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 03:12:16,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:16,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 03:12:16,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:16,323 INFO L87 Difference]: Start difference. First operand 3450 states and 4794 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:12:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:16,729 INFO L93 Difference]: Finished difference Result 6166 states and 8564 transitions. [2025-03-04 03:12:16,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 03:12:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-03-04 03:12:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:16,743 INFO L225 Difference]: With dead ends: 6166 [2025-03-04 03:12:16,743 INFO L226 Difference]: Without dead ends: 3232 [2025-03-04 03:12:16,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 03:12:16,752 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 0 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:16,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2601 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 03:12:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-03-04 03:12:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3232. [2025-03-04 03:12:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3232 states, 2339 states have (on average 1.255237280889269) internal successors, (2936), 2347 states have internal predecessors, (2936), 709 states have call successors, (709), 166 states have call predecessors, (709), 183 states have return successors, (811), 730 states have call predecessors, (811), 705 states have call successors, (811) [2025-03-04 03:12:16,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3232 states to 3232 states and 4456 transitions. [2025-03-04 03:12:16,865 INFO L78 Accepts]: Start accepts. Automaton has 3232 states and 4456 transitions. Word has length 93 [2025-03-04 03:12:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:16,865 INFO L471 AbstractCegarLoop]: Abstraction has 3232 states and 4456 transitions. [2025-03-04 03:12:16,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:12:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3232 states and 4456 transitions. [2025-03-04 03:12:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 03:12:16,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:16,869 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:12:16,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 03:12:16,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:16,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:16,870 INFO L85 PathProgramCache]: Analyzing trace with hash 265701923, now seen corresponding path program 1 times [2025-03-04 03:12:16,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:16,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712804235] [2025-03-04 03:12:16,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:16,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:18,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 03:12:18,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 03:12:18,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:18,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:12:18,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712804235] [2025-03-04 03:12:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712804235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:18,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:18,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 03:12:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000480719] [2025-03-04 03:12:18,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:18,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 03:12:18,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:18,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 03:12:18,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:12:18,768 INFO L87 Difference]: Start difference. First operand 3232 states and 4456 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:12:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:19,055 INFO L93 Difference]: Finished difference Result 4780 states and 6618 transitions. [2025-03-04 03:12:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 03:12:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-03-04 03:12:19,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:19,070 INFO L225 Difference]: With dead ends: 4780 [2025-03-04 03:12:19,070 INFO L226 Difference]: Without dead ends: 3288 [2025-03-04 03:12:19,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 03:12:19,075 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 8 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:19,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1302 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 03:12:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2025-03-04 03:12:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3240. [2025-03-04 03:12:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3240 states, 2347 states have (on average 1.254367277375373) internal successors, (2944), 2355 states have internal predecessors, (2944), 709 states have call successors, (709), 166 states have call predecessors, (709), 183 states have return successors, (811), 730 states have call predecessors, (811), 705 states have call successors, (811) [2025-03-04 03:12:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4464 transitions. [2025-03-04 03:12:19,197 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4464 transitions. Word has length 93 [2025-03-04 03:12:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:19,197 INFO L471 AbstractCegarLoop]: Abstraction has 3240 states and 4464 transitions. [2025-03-04 03:12:19,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 03:12:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4464 transitions. [2025-03-04 03:12:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-04 03:12:19,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:19,200 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:12:19,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 03:12:19,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:19,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1106755504, now seen corresponding path program 1 times [2025-03-04 03:12:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:19,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571857619] [2025-03-04 03:12:19,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:19,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 03:12:21,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 03:12:21,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 03:12:21,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 03:12:21,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 03:12:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 03:12:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 03:12:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571857619] [2025-03-04 03:12:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571857619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 03:12:21,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 03:12:21,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 03:12:21,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753352143] [2025-03-04 03:12:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 03:12:21,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 03:12:21,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 03:12:21,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 03:12:21,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 03:12:21,734 INFO L87 Difference]: Start difference. First operand 3240 states and 4464 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:12:25,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:12:29,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 03:12:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 03:12:38,277 INFO L93 Difference]: Finished difference Result 4757 states and 6587 transitions. [2025-03-04 03:12:38,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 03:12:38,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 94 [2025-03-04 03:12:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 03:12:38,295 INFO L225 Difference]: With dead ends: 4757 [2025-03-04 03:12:38,295 INFO L226 Difference]: Without dead ends: 4754 [2025-03-04 03:12:38,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 03:12:38,299 INFO L435 NwaCegarLoop]: 1032 mSDtfsCounter, 1768 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 425 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1864 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-03-04 03:12:38,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1864 Valid, 2147 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1225 Invalid, 2 Unknown, 0 Unchecked, 16.3s Time] [2025-03-04 03:12:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2025-03-04 03:12:38,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 4719. [2025-03-04 03:12:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4719 states, 3417 states have (on average 1.2569505414105941) internal successors, (4295), 3434 states have internal predecessors, (4295), 1039 states have call successors, (1039), 234 states have call predecessors, (1039), 262 states have return successors, (1215), 1070 states have call predecessors, (1215), 1035 states have call successors, (1215) [2025-03-04 03:12:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 6549 transitions. [2025-03-04 03:12:38,420 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 6549 transitions. Word has length 94 [2025-03-04 03:12:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 03:12:38,421 INFO L471 AbstractCegarLoop]: Abstraction has 4719 states and 6549 transitions. [2025-03-04 03:12:38,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 5 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 03:12:38,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 6549 transitions. [2025-03-04 03:12:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 03:12:38,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 03:12:38,424 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 03:12:38,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 03:12:38,424 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 03:12:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 03:12:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -899940958, now seen corresponding path program 1 times [2025-03-04 03:12:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 03:12:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908774081] [2025-03-04 03:12:38,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 03:12:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms