./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 07:29:48,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 07:29:48,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-17 07:29:48,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 07:29:48,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 07:29:48,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 07:29:48,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 07:29:48,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 07:29:48,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 07:29:48,167 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 07:29:48,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 07:29:48,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 07:29:48,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 07:29:48,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 07:29:48,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:29:48,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 07:29:48,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 07:29:48,169 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-17 07:29:48,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 07:29:48,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 07:29:48,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 07:29:48,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 07:29:48,405 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 07:29:48,406 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-17 07:29:49,555 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27df10f43/d1c31679c0eb4cfaa280747e013b9828/FLAG35b37b1b9 [2025-03-17 07:29:49,943 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 07:29:49,943 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-17 07:29:49,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27df10f43/d1c31679c0eb4cfaa280747e013b9828/FLAG35b37b1b9 [2025-03-17 07:29:49,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27df10f43/d1c31679c0eb4cfaa280747e013b9828 [2025-03-17 07:29:49,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 07:29:49,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 07:29:49,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 07:29:49,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 07:29:50,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 07:29:50,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:29:49" (1/1) ... [2025-03-17 07:29:50,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a12997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:50, skipping insertion in model container [2025-03-17 07:29:50,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:29:49" (1/1) ... [2025-03-17 07:29:50,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 07:29:51,060 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-17 07:29:51,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:29:51,143 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 07:29:51,247 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-17 07:29:51,249 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-17 07:29:51,249 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-17 07:29:51,253 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-17 07:29:51,254 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-17 07:29:51,316 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-17 07:29:51,370 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-17 07:29:51,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 07:29:51,527 INFO L204 MainTranslator]: Completed translation [2025-03-17 07:29:51,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51 WrapperNode [2025-03-17 07:29:51,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 07:29:51,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 07:29:51,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 07:29:51,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 07:29:51,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,633 INFO L138 Inliner]: procedures = 132, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1635 [2025-03-17 07:29:51,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 07:29:51,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 07:29:51,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 07:29:51,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 07:29:51,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,771 INFO L175 MemorySlicer]: Split 342 memory accesses to 8 slices as follows [2, 10, 8, 8, 3, 8, 42, 261]. 76 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 0, 8, 8, 0, 8, 0, 8]. The 214 writes are split as follows [0, 0, 0, 0, 0, 0, 42, 172]. [2025-03-17 07:29:51,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,843 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 07:29:51,873 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 07:29:51,873 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 07:29:51,874 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 07:29:51,874 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (1/1) ... [2025-03-17 07:29:51,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 07:29:51,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 07:29:51,903 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-17 07:29:51,910 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-17 07:29:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-03-17 07:29:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-03-17 07:29:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2025-03-17 07:29:51,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2025-03-17 07:29:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 07:29:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-17 07:29:51,932 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-17 07:29:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-03-17 07:29:51,933 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2025-03-17 07:29:51,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-17 07:29:51,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-17 07:29:51,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-17 07:29:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2025-03-17 07:29:51,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-03-17 07:29:51,935 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-17 07:29:51,935 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-03-17 07:29:51,935 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 07:29:51,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-03-17 07:29:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-03-17 07:29:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-17 07:29:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-17 07:29:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-17 07:29:51,938 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-17 07:29:51,938 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-17 07:29:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-03-17 07:29:51,939 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-03-17 07:29:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-03-17 07:29:51,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-03-17 07:29:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-03-17 07:29:51,939 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-03-17 07:29:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-03-17 07:29:51,939 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-03-17 07:29:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 07:29:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 07:29:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 07:29:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 07:29:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 07:29:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 07:29:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-03-17 07:29:51,941 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-17 07:29:51,941 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-17 07:29:51,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-17 07:29:51,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 07:29:51,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 07:29:52,278 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 07:29:52,280 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 07:29:52,362 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7025: havoc usb_register_driver_#t~nondet398#1; [2025-03-17 07:29:52,368 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7029: havoc #t~nondet399; [2025-03-17 07:29:52,426 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5809: call ULTIMATE.dealloc(~#cmd~0.base, ~#cmd~0.offset);havoc ~#cmd~0.base, ~#cmd~0.offset; [2025-03-17 07:29:52,458 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5248: havoc #t~mem35;havoc #t~bitwise36; [2025-03-17 07:29:52,474 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6912: havoc #t~malloc381.base, #t~malloc381.offset; [2025-03-17 07:29:52,530 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-03-17 07:29:52,649 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7015: havoc usb_bulk_msg_#t~nondet397#1; [2025-03-17 07:29:52,650 INFO L1322 $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-17 07:29:52,661 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7036: havoc usb_unlink_urb_#t~nondet400#1; [2025-03-17 07:29:52,718 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7001: havoc #t~nondet395; [2025-03-17 07:29:52,723 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6956: havoc #t~nondet387; [2025-03-17 07:29:52,742 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6915: havoc __kmalloc_#t~ret382#1.base, __kmalloc_#t~ret382#1.offset; [2025-03-17 07:29:52,752 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6963: havoc dev_set_drvdata_#t~nondet389#1; [2025-03-17 07:29:52,756 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4970: havoc #t~mem10.base, #t~mem10.offset; [2025-03-17 07:29:52,759 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6982: havoc #t~ret391.base, #t~ret391.offset; [2025-03-17 07:29:52,763 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6967: havoc #t~nondet390; [2025-03-17 07:29:58,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7005: havoc register_candev_#t~nondet396#1; [2025-03-17 07:29:58,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6959: havoc dev_get_drvdata_#t~ret388#1.base, dev_get_drvdata_#t~ret388#1.offset; [2025-03-17 07:29:58,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4881: havoc atomic_read_#t~mem4#1; [2025-03-17 07:29:58,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6997: havoc open_candev_#t~nondet394#1; [2025-03-17 07:29:58,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6934: havoc alloc_candev_#t~ret386#1.base, alloc_candev_#t~ret386#1.offset; [2025-03-17 07:29:58,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume false; [2025-03-17 07:29:58,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6673: assume !false; [2025-03-17 07:29:58,238 INFO L? ?]: Removed 488 outVars from TransFormulas that were not future-live. [2025-03-17 07:29:58,238 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 07:29:58,269 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 07:29:58,270 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 07:29:58,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:29:58 BoogieIcfgContainer [2025-03-17 07:29:58,270 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 07:29:58,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 07:29:58,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 07:29:58,277 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 07:29:58,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:29:49" (1/3) ... [2025-03-17 07:29:58,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12617c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:29:58, skipping insertion in model container [2025-03-17 07:29:58,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:29:51" (2/3) ... [2025-03-17 07:29:58,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12617c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:29:58, skipping insertion in model container [2025-03-17 07:29:58,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:29:58" (3/3) ... [2025-03-17 07:29:58,279 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-03-17 07:29:58,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 07:29:58,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i that has 39 procedures, 479 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-03-17 07:29:58,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 07:29:58,354 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;@15d72e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 07:29:58,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 07:29:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 329 states have (on average 1.3404255319148937) internal successors, (441), 339 states have internal predecessors, (441), 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-17 07:29:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-17 07:29:58,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:29:58,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 07:29:58,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:29:58,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:29:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2110256540, now seen corresponding path program 1 times [2025-03-17 07:29:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:29:58,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69610757] [2025-03-17 07:29:58,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:29:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:00,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-17 07:30:00,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-17 07:30:00,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:00,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:01,226 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-17 07:30:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69610757] [2025-03-17 07:30:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69610757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:01,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:01,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:30:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16732035] [2025-03-17 07:30:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:01,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:30:01,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:01,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:30:01,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:30:01,249 INFO L87 Difference]: Start difference. First operand has 478 states, 329 states have (on average 1.3404255319148937) internal successors, (441), 339 states have internal predecessors, (441), 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 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-17 07:30:05,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:30:09,352 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-17 07:30:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:09,895 INFO L93 Difference]: Finished difference Result 943 states and 1331 transitions. [2025-03-17 07:30:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:30:09,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 18 [2025-03-17 07:30:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:09,905 INFO L225 Difference]: With dead ends: 943 [2025-03-17 07:30:09,905 INFO L226 Difference]: Without dead ends: 472 [2025-03-17 07:30:09,909 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-17 07:30:09,911 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 0 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:09,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2481 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-03-17 07:30:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-17 07:30:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-17 07:30:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 324 states have (on average 1.2777777777777777) internal successors, (414), 332 states have internal predecessors, (414), 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-17 07:30:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 631 transitions. [2025-03-17 07:30:09,976 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 631 transitions. Word has length 18 [2025-03-17 07:30:09,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:09,977 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 631 transitions. [2025-03-17 07:30:09,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-17 07:30:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 631 transitions. [2025-03-17 07:30:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 07:30:09,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:09,981 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] [2025-03-17 07:30:09,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 07:30:09,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:09,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 217879469, now seen corresponding path program 1 times [2025-03-17 07:30:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:09,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294709327] [2025-03-17 07:30:09,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:11,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 07:30:11,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 07:30:11,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:11,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:12,024 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-17 07:30:12,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:12,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294709327] [2025-03-17 07:30:12,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294709327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:12,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 07:30:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615453821] [2025-03-17 07:30:12,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 07:30:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:12,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 07:30:12,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:30:12,028 INFO L87 Difference]: Start difference. First operand 472 states and 631 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-17 07:30:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:12,348 INFO L93 Difference]: Finished difference Result 1378 states and 1856 transitions. [2025-03-17 07:30:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 07:30:12,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 23 [2025-03-17 07:30:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:12,355 INFO L225 Difference]: With dead ends: 1378 [2025-03-17 07:30:12,355 INFO L226 Difference]: Without dead ends: 923 [2025-03-17 07:30:12,357 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-17 07:30:12,357 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 617 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:12,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1334 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:30:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-17 07:30:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 919. [2025-03-17 07:30:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 633 states have (on average 1.2780410742496051) internal successors, (809), 645 states have internal predecessors, (809), 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-17 07:30:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1235 transitions. [2025-03-17 07:30:12,425 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1235 transitions. Word has length 23 [2025-03-17 07:30:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:12,425 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1235 transitions. [2025-03-17 07:30:12,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-17 07:30:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1235 transitions. [2025-03-17 07:30:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 07:30:12,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:12,427 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] [2025-03-17 07:30:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 07:30:12,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:12,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:12,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1836194546, now seen corresponding path program 1 times [2025-03-17 07:30:12,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:12,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209271544] [2025-03-17 07:30:12,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:12,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:14,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 07:30:14,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 07:30:14,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:14,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:14,289 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-17 07:30:14,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:14,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209271544] [2025-03-17 07:30:14,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209271544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:14,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:14,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 07:30:14,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455333396] [2025-03-17 07:30:14,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:14,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 07:30:14,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:14,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 07:30:14,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:30:14,292 INFO L87 Difference]: Start difference. First operand 919 states and 1235 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 07:30:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:14,596 INFO L93 Difference]: Finished difference Result 2720 states and 3670 transitions. [2025-03-17 07:30:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 07:30:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 24 [2025-03-17 07:30:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:14,608 INFO L225 Difference]: With dead ends: 2720 [2025-03-17 07:30:14,608 INFO L226 Difference]: Without dead ends: 1811 [2025-03-17 07:30:14,612 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-17 07:30:14,613 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 616 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:14,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1226 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 07:30:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-03-17 07:30:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1800. [2025-03-17 07:30:14,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1241 states have (on average 1.2755842062852538) internal successors, (1583), 1260 states have internal predecessors, (1583), 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-17 07:30:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 2425 transitions. [2025-03-17 07:30:14,723 INFO L78 Accepts]: Start accepts. Automaton has 1800 states and 2425 transitions. Word has length 24 [2025-03-17 07:30:14,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:14,723 INFO L471 AbstractCegarLoop]: Abstraction has 1800 states and 2425 transitions. [2025-03-17 07:30:14,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-17 07:30:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1800 states and 2425 transitions. [2025-03-17 07:30:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-17 07:30:14,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:14,731 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] [2025-03-17 07:30:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 07:30:14,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:14,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash -654968369, now seen corresponding path program 1 times [2025-03-17 07:30:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:14,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312757698] [2025-03-17 07:30:14,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:14,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:16,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 07:30:16,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 07:30:16,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:16,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:16,877 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-17 07:30:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:16,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312757698] [2025-03-17 07:30:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312757698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:16,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 07:30:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892561144] [2025-03-17 07:30:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:16,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 07:30:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:16,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 07:30:16,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:30:16,880 INFO L87 Difference]: Start difference. First operand 1800 states and 2425 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-17 07:30:20,903 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-17 07:30:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:21,308 INFO L93 Difference]: Finished difference Result 4455 states and 6207 transitions. [2025-03-17 07:30:21,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 07:30:21,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 68 [2025-03-17 07:30:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:21,326 INFO L225 Difference]: With dead ends: 4455 [2025-03-17 07:30:21,327 INFO L226 Difference]: Without dead ends: 2667 [2025-03-17 07:30:21,333 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-17 07:30:21,335 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 248 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:21,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1283 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-17 07:30:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-03-17 07:30:21,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2655. [2025-03-17 07:30:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 1844 states have (on average 1.309652928416486) internal successors, (2415), 1879 states have internal predecessors, (2415), 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-17 07:30:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3769 transitions. [2025-03-17 07:30:21,475 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3769 transitions. Word has length 68 [2025-03-17 07:30:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:21,476 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 3769 transitions. [2025-03-17 07:30:21,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-17 07:30:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3769 transitions. [2025-03-17 07:30:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 07:30:21,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:21,481 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:30:21,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 07:30:21,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:21,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:21,481 INFO L85 PathProgramCache]: Analyzing trace with hash -611202783, now seen corresponding path program 1 times [2025-03-17 07:30:21,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:21,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36249361] [2025-03-17 07:30:21,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:21,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:23,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 07:30:23,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 07:30:23,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:23,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:30:23,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:23,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36249361] [2025-03-17 07:30:23,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36249361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:23,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:23,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 07:30:23,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961589355] [2025-03-17 07:30:23,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:23,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 07:30:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:23,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 07:30:23,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:30:23,427 INFO L87 Difference]: Start difference. First operand 2655 states and 3769 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 07:30:23,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:23,825 INFO L93 Difference]: Finished difference Result 5313 states and 7546 transitions. [2025-03-17 07:30:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 07:30:23,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 71 [2025-03-17 07:30:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:23,842 INFO L225 Difference]: With dead ends: 5313 [2025-03-17 07:30:23,842 INFO L226 Difference]: Without dead ends: 2671 [2025-03-17 07:30:23,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 07:30:23,852 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 0 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1831 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:23,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1831 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:30:23,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2671 states. [2025-03-17 07:30:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2671 to 2671. [2025-03-17 07:30:23,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 1860 states have (on average 1.3069892473118279) internal successors, (2431), 1895 states have internal predecessors, (2431), 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-17 07:30:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3785 transitions. [2025-03-17 07:30:23,955 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3785 transitions. Word has length 71 [2025-03-17 07:30:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:23,955 INFO L471 AbstractCegarLoop]: Abstraction has 2671 states and 3785 transitions. [2025-03-17 07:30:23,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-17 07:30:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3785 transitions. [2025-03-17 07:30:23,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-17 07:30:23,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:23,958 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:30:23,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 07:30:23,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:23,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:23,959 INFO L85 PathProgramCache]: Analyzing trace with hash 286190495, now seen corresponding path program 1 times [2025-03-17 07:30:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138322990] [2025-03-17 07:30:23,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:23,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:25,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 07:30:25,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 07:30:25,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:25,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:26,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:30:26,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138322990] [2025-03-17 07:30:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138322990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:26,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:26,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:30:26,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925026948] [2025-03-17 07:30:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:26,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:30:26,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:26,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:30:26,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:30:26,192 INFO L87 Difference]: Start difference. First operand 2671 states and 3785 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 07:30:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:26,871 INFO L93 Difference]: Finished difference Result 5345 states and 7578 transitions. [2025-03-17 07:30:26,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 07:30:26,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 71 [2025-03-17 07:30:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:26,887 INFO L225 Difference]: With dead ends: 5345 [2025-03-17 07:30:26,887 INFO L226 Difference]: Without dead ends: 2687 [2025-03-17 07:30:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:30:26,897 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 0 mSDsluCounter, 2433 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3044 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:26,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3044 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 07:30:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2025-03-17 07:30:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2687. [2025-03-17 07:30:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 1876 states have (on average 1.3043710021321961) internal successors, (2447), 1911 states have internal predecessors, (2447), 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-17 07:30:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 3801 transitions. [2025-03-17 07:30:26,990 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 3801 transitions. Word has length 71 [2025-03-17 07:30:26,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:26,990 INFO L471 AbstractCegarLoop]: Abstraction has 2687 states and 3801 transitions. [2025-03-17 07:30:26,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 07:30:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 3801 transitions. [2025-03-17 07:30:26,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 07:30:26,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:26,993 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:30:26,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 07:30:26,993 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:26,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:26,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1672345936, now seen corresponding path program 1 times [2025-03-17 07:30:26,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:26,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137603934] [2025-03-17 07:30:26,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:26,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:28,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 07:30:28,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 07:30:28,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:30:29,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:29,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137603934] [2025-03-17 07:30:29,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137603934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:29,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:29,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:30:29,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652646513] [2025-03-17 07:30:29,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:29,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:30:29,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:29,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:30:29,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:30:29,462 INFO L87 Difference]: Start difference. First operand 2687 states and 3801 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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-17 07:30:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:30,132 INFO L93 Difference]: Finished difference Result 4061 states and 5770 transitions. [2025-03-17 07:30:30,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:30:30,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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 72 [2025-03-17 07:30:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:30,148 INFO L225 Difference]: With dead ends: 4061 [2025-03-17 07:30:30,148 INFO L226 Difference]: Without dead ends: 2715 [2025-03-17 07:30:30,152 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-17 07:30:30,154 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 0 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3674 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.6s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:30,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3674 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 07:30:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2025-03-17 07:30:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2715. [2025-03-17 07:30:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2715 states, 1896 states have (on average 1.3011603375527425) internal successors, (2467), 1931 states have internal predecessors, (2467), 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-17 07:30:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 3845 transitions. [2025-03-17 07:30:30,239 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 3845 transitions. Word has length 72 [2025-03-17 07:30:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:30,239 INFO L471 AbstractCegarLoop]: Abstraction has 2715 states and 3845 transitions. [2025-03-17 07:30:30,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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-17 07:30:30,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 3845 transitions. [2025-03-17 07:30:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 07:30:30,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:30,243 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 07:30:30,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 07:30:30,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1778615858, now seen corresponding path program 1 times [2025-03-17 07:30:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:30,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074350926] [2025-03-17 07:30:30,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:31,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 07:30:31,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 07:30:31,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:31,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:32,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 07:30:32,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:32,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074350926] [2025-03-17 07:30:32,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074350926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:32,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:32,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 07:30:32,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999556624] [2025-03-17 07:30:32,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:32,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 07:30:32,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:32,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 07:30:32,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 07:30:32,905 INFO L87 Difference]: Start difference. First operand 2715 states and 3845 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 7 states have internal predecessors, (53), 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-17 07:30:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:34,286 INFO L93 Difference]: Finished difference Result 5653 states and 8076 transitions. [2025-03-17 07:30:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 07:30:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 7 states have internal predecessors, (53), 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 72 [2025-03-17 07:30:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:34,305 INFO L225 Difference]: With dead ends: 5653 [2025-03-17 07:30:34,305 INFO L226 Difference]: Without dead ends: 2951 [2025-03-17 07:30:34,315 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-17 07:30:34,315 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 52 mSDsluCounter, 5571 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 6279 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:34,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 6279 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 07:30:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2025-03-17 07:30:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2723. [2025-03-17 07:30:34,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 1902 states have (on average 1.2981072555205047) internal successors, (2469), 1937 states have internal predecessors, (2469), 670 states have call successors, (670), 141 states have call predecessors, (670), 150 states have return successors, (718), 660 states have call predecessors, (718), 666 states have call successors, (718) [2025-03-17 07:30:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 3857 transitions. [2025-03-17 07:30:34,406 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 3857 transitions. Word has length 72 [2025-03-17 07:30:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:34,406 INFO L471 AbstractCegarLoop]: Abstraction has 2723 states and 3857 transitions. [2025-03-17 07:30:34,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 7 states have internal predecessors, (53), 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-17 07:30:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 3857 transitions. [2025-03-17 07:30:34,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 07:30:34,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:34,409 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] [2025-03-17 07:30:34,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 07:30:34,409 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:34,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2135647061, now seen corresponding path program 1 times [2025-03-17 07:30:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447192469] [2025-03-17 07:30:34,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:35,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:30:35,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:30:35,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:35,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:36,429 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-17 07:30:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:36,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447192469] [2025-03-17 07:30:36,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447192469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:36,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:36,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:30:36,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811537756] [2025-03-17 07:30:36,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:36,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:30:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:36,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:30:36,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:30:36,430 INFO L87 Difference]: Start difference. First operand 2723 states and 3857 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-17 07:30:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:36,905 INFO L93 Difference]: Finished difference Result 5199 states and 7328 transitions. [2025-03-17 07:30:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:30:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 78 [2025-03-17 07:30:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:36,918 INFO L225 Difference]: With dead ends: 5199 [2025-03-17 07:30:36,918 INFO L226 Difference]: Without dead ends: 2489 [2025-03-17 07:30:36,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:30:36,925 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:36,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2445 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 07:30:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2025-03-17 07:30:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2489. [2025-03-17 07:30:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2489 states, 1746 states have (on average 1.2857961053837343) internal successors, (2245), 1765 states have internal predecessors, (2245), 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-17 07:30:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 3479 transitions. [2025-03-17 07:30:36,995 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 3479 transitions. Word has length 78 [2025-03-17 07:30:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:36,995 INFO L471 AbstractCegarLoop]: Abstraction has 2489 states and 3479 transitions. [2025-03-17 07:30:36,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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-17 07:30:36,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 3479 transitions. [2025-03-17 07:30:37,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-17 07:30:37,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:37,000 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] [2025-03-17 07:30:37,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 07:30:37,001 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:37,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:37,001 INFO L85 PathProgramCache]: Analyzing trace with hash 315310485, now seen corresponding path program 1 times [2025-03-17 07:30:37,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:37,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59797924] [2025-03-17 07:30:37,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:37,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:38,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 07:30:38,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 07:30:38,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:38,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:39,283 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-17 07:30:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:39,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59797924] [2025-03-17 07:30:39,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59797924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:39,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:39,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:30:39,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702776364] [2025-03-17 07:30:39,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:39,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:30:39,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:39,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:30:39,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:30:39,287 INFO L87 Difference]: Start difference. First operand 2489 states and 3479 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 07:30:43,310 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-17 07:30:47,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 07:30:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:56,600 INFO L93 Difference]: Finished difference Result 3874 states and 5465 transitions. [2025-03-17 07:30:56,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:30:56,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 78 [2025-03-17 07:30:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:56,618 INFO L225 Difference]: With dead ends: 3874 [2025-03-17 07:30:56,618 INFO L226 Difference]: Without dead ends: 3869 [2025-03-17 07:30:56,620 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-17 07:30:56,620 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 1629 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 443 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2025-03-17 07:30:56,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 1928 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 1174 Invalid, 2 Unknown, 0 Unchecked, 17.0s Time] [2025-03-17 07:30:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2025-03-17 07:30:56,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3841. [2025-03-17 07:30:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3841 states, 2692 states have (on average 1.2897473997028233) internal successors, (3472), 2727 states have internal predecessors, (3472), 924 states have call successors, (924), 207 states have call predecessors, (924), 224 states have return successors, (1036), 922 states have call predecessors, (1036), 920 states have call successors, (1036) [2025-03-17 07:30:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5432 transitions. [2025-03-17 07:30:56,741 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5432 transitions. Word has length 78 [2025-03-17 07:30:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:56,741 INFO L471 AbstractCegarLoop]: Abstraction has 3841 states and 5432 transitions. [2025-03-17 07:30:56,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-17 07:30:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5432 transitions. [2025-03-17 07:30:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 07:30:56,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:56,746 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] [2025-03-17 07:30:56,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 07:30:56,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1626519760, now seen corresponding path program 1 times [2025-03-17 07:30:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684398470] [2025-03-17 07:30:56,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:30:58,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 07:30:58,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 07:30:58,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:30:58,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:30:58,940 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-17 07:30:58,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:30:58,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684398470] [2025-03-17 07:30:58,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684398470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:30:58,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:30:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:30:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852803539] [2025-03-17 07:30:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:30:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:30:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:30:58,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:30:58,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:30:58,941 INFO L87 Difference]: Start difference. First operand 3841 states and 5432 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-17 07:30:59,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:30:59,431 INFO L93 Difference]: Finished difference Result 7047 states and 9989 transitions. [2025-03-17 07:30:59,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:30:59,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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 95 [2025-03-17 07:30:59,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:30:59,449 INFO L225 Difference]: With dead ends: 7047 [2025-03-17 07:30:59,449 INFO L226 Difference]: Without dead ends: 3219 [2025-03-17 07:30:59,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:30:59,458 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2446 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-17 07:30:59,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2446 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 07:30:59,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3219 states. [2025-03-17 07:30:59,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3219 to 3219. [2025-03-17 07:30:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 2262 states have (on average 1.290450928381963) internal successors, (2919), 2288 states have internal predecessors, (2919), 773 states have call successors, (773), 168 states have call predecessors, (773), 183 states have return successors, (871), 778 states have call predecessors, (871), 769 states have call successors, (871) [2025-03-17 07:30:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 4563 transitions. [2025-03-17 07:30:59,546 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 4563 transitions. Word has length 95 [2025-03-17 07:30:59,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:30:59,546 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 4563 transitions. [2025-03-17 07:30:59,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 4 states have internal predecessors, (63), 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-17 07:30:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 4563 transitions. [2025-03-17 07:30:59,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 07:30:59,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:30:59,549 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-17 07:30:59,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 07:30:59,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:30:59,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:30:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1258501040, now seen corresponding path program 1 times [2025-03-17 07:30:59,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:30:59,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311337681] [2025-03-17 07:30:59,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:30:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:31:01,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 07:31:01,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 07:31:01,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:31:01,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:31:01,956 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-17 07:31:01,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:31:01,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311337681] [2025-03-17 07:31:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311337681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:31:01,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:31:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 07:31:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831106171] [2025-03-17 07:31:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:31:01,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 07:31:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:31:01,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 07:31:01,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:31:01,957 INFO L87 Difference]: Start difference. First operand 3219 states and 4563 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-17 07:31:02,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:31:02,430 INFO L93 Difference]: Finished difference Result 5761 states and 8159 transitions. [2025-03-17 07:31:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 07:31:02,431 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-17 07:31:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:31:02,444 INFO L225 Difference]: With dead ends: 5761 [2025-03-17 07:31:02,445 INFO L226 Difference]: Without dead ends: 3021 [2025-03-17 07:31:02,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 07:31:02,452 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 0 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2445 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.4s IncrementalHoareTripleChecker+Time [2025-03-17 07:31:02,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2445 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 07:31:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2025-03-17 07:31:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 3021. [2025-03-17 07:31:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 2128 states have (on average 1.280545112781955) internal successors, (2725), 2140 states have internal predecessors, (2725), 709 states have call successors, (709), 166 states have call predecessors, (709), 183 states have return successors, (811), 726 states have call predecessors, (811), 705 states have call successors, (811) [2025-03-17 07:31:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 4245 transitions. [2025-03-17 07:31:02,542 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 4245 transitions. Word has length 85 [2025-03-17 07:31:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:31:02,542 INFO L471 AbstractCegarLoop]: Abstraction has 3021 states and 4245 transitions. [2025-03-17 07:31:02,542 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-17 07:31:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4245 transitions. [2025-03-17 07:31:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 07:31:02,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:31:02,545 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-17 07:31:02,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 07:31:02,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:31:02,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:31:02,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1124487534, now seen corresponding path program 1 times [2025-03-17 07:31:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:31:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593152093] [2025-03-17 07:31:02,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:31:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:31:04,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 07:31:04,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 07:31:04,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:31:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:31:05,347 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-17 07:31:05,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:31:05,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593152093] [2025-03-17 07:31:05,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593152093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:31:05,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:31:05,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 07:31:05,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105328202] [2025-03-17 07:31:05,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:31:05,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 07:31:05,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:31:05,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 07:31:05,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 07:31:05,353 INFO L87 Difference]: Start difference. First operand 3021 states and 4245 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-17 07:31:05,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:31:05,948 INFO L93 Difference]: Finished difference Result 4423 states and 6253 transitions. [2025-03-17 07:31:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 07:31:05,949 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-17 07:31:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:31:05,967 INFO L225 Difference]: With dead ends: 4423 [2025-03-17 07:31:05,967 INFO L226 Difference]: Without dead ends: 3029 [2025-03-17 07:31:05,972 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-17 07:31:05,972 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 0 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3668 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-17 07:31:05,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3668 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 07:31:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2025-03-17 07:31:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 3029. [2025-03-17 07:31:06,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3029 states, 2136 states have (on average 1.279494382022472) internal successors, (2733), 2144 states have internal predecessors, (2733), 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-17 07:31:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3029 states to 3029 states and 4253 transitions. [2025-03-17 07:31:06,059 INFO L78 Accepts]: Start accepts. Automaton has 3029 states and 4253 transitions. Word has length 85 [2025-03-17 07:31:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:31:06,059 INFO L471 AbstractCegarLoop]: Abstraction has 3029 states and 4253 transitions. [2025-03-17 07:31:06,059 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-17 07:31:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3029 states and 4253 transitions. [2025-03-17 07:31:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 07:31:06,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:31:06,062 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] [2025-03-17 07:31:06,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 07:31:06,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:31:06,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:31:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1826087408, now seen corresponding path program 1 times [2025-03-17 07:31:06,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:31:06,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577015009] [2025-03-17 07:31:06,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:31:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:31:07,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 07:31:07,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 07:31:07,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:31:07,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:31:08,046 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-17 07:31:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:31:08,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577015009] [2025-03-17 07:31:08,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577015009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:31:08,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:31:08,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 07:31:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478764847] [2025-03-17 07:31:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:31:08,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 07:31:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:31:08,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 07:31:08,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 07:31:08,048 INFO L87 Difference]: Start difference. First operand 3029 states and 4253 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-17 07:31:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 07:31:08,417 INFO L93 Difference]: Finished difference Result 4475 states and 6313 transitions. [2025-03-17 07:31:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 07:31:08,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 85 [2025-03-17 07:31:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 07:31:08,433 INFO L225 Difference]: With dead ends: 4475 [2025-03-17 07:31:08,434 INFO L226 Difference]: Without dead ends: 3077 [2025-03-17 07:31:08,440 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-17 07:31:08,440 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 7 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1214 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 07:31:08,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1214 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 07:31:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2025-03-17 07:31:08,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 3033. [2025-03-17 07:31:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2140 states have (on average 1.2789719626168223) internal successors, (2737), 2148 states have internal predecessors, (2737), 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-17 07:31:08,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 4257 transitions. [2025-03-17 07:31:08,539 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 4257 transitions. Word has length 85 [2025-03-17 07:31:08,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 07:31:08,539 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 4257 transitions. [2025-03-17 07:31:08,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-17 07:31:08,539 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 4257 transitions. [2025-03-17 07:31:08,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 07:31:08,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 07:31:08,543 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] [2025-03-17 07:31:08,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 07:31:08,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 07:31:08,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 07:31:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1529882227, now seen corresponding path program 1 times [2025-03-17 07:31:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 07:31:08,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757380463] [2025-03-17 07:31:08,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 07:31:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 07:31:10,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 07:31:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 07:31:10,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 07:31:10,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 07:31:10,750 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-17 07:31:10,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 07:31:10,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757380463] [2025-03-17 07:31:10,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757380463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 07:31:10,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 07:31:10,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 07:31:10,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866343413] [2025-03-17 07:31:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 07:31:10,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 07:31:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 07:31:10,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 07:31:10,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 07:31:10,751 INFO L87 Difference]: Start difference. First operand 3033 states and 4257 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)