./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 17:35:41,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 17:35:41,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 17:35:41,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 17:35:41,884 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 17:35:41,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 17:35:41,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 17:35:41,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 17:35:41,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 17:35:41,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 17:35:41,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 17:35:41,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 17:35:41,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 17:35:41,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 17:35:41,907 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 17:35:41,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 17:35:41,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 17:35:41,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 17:35:41,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 17:35:41,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 17:35:41,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 17:35:41,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 17:35:41,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 17:35:41,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 17:35:41,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 17:35:41,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 17:35:41,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:35:41,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:35:41,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:35:41,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:35:41,909 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 17:35:41,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 17:35:41,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 17:35:41,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 17:35:41,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:35:41,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 17:35:41,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 17:35:41,911 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2025-01-09 17:35:42,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 17:35:42,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 17:35:42,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 17:35:42,224 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 17:35:42,225 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 17:35:42,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-01-09 17:35:43,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/530dfcdd7/664ef751d81e4d5ba56f440b50507089/FLAGbf139945e [2025-01-09 17:35:44,152 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 17:35:44,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-01-09 17:35:44,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/530dfcdd7/664ef751d81e4d5ba56f440b50507089/FLAGbf139945e [2025-01-09 17:35:44,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/530dfcdd7/664ef751d81e4d5ba56f440b50507089 [2025-01-09 17:35:44,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 17:35:44,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 17:35:44,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 17:35:44,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 17:35:44,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 17:35:44,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:35:44" (1/1) ... [2025-01-09 17:35:44,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674bb3d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:44, skipping insertion in model container [2025-01-09 17:35:44,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:35:44" (1/1) ... [2025-01-09 17:35:44,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 17:35:45,660 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-01-09 17:35:45,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:35:45,743 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 17:35:45,866 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-01-09 17:35:45,869 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-01-09 17:35:45,869 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-01-09 17:35:45,872 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-01-09 17:35:45,873 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-01-09 17:35:45,937 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-01-09 17:35:46,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2025-01-09 17:35:46,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 17:35:46,221 INFO L204 MainTranslator]: Completed translation [2025-01-09 17:35:46,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46 WrapperNode [2025-01-09 17:35:46,222 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 17:35:46,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 17:35:46,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 17:35:46,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 17:35:46,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,378 INFO L138 Inliner]: procedures = 132, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1635 [2025-01-09 17:35:46,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 17:35:46,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 17:35:46,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 17:35:46,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 17:35:46,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,551 INFO L175 MemorySlicer]: Split 342 memory accesses to 8 slices as follows [2, 261, 8, 8, 8, 10, 42, 3]. 76 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 8, 8, 8, 8, 0, 0, 0]. The 214 writes are split as follows [0, 172, 0, 0, 0, 0, 42, 0]. [2025-01-09 17:35:46,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,627 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,671 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 17:35:46,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 17:35:46,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 17:35:46,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 17:35:46,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (1/1) ... [2025-01-09 17:35:46,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 17:35:46,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 17:35:46,736 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 17:35:46,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 17:35:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2025-01-09 17:35:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2025-01-09 17:35:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2025-01-09 17:35:46,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2025-01-09 17:35:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 17:35:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 17:35:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 17:35:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 17:35:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 17:35:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 17:35:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 17:35:46,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-01-09 17:35:46,766 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 17:35:46,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2025-01-09 17:35:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2025-01-09 17:35:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-01-09 17:35:46,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-01-09 17:35:46,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 17:35:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2025-01-09 17:35:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2025-01-09 17:35:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 17:35:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2025-01-09 17:35:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2025-01-09 17:35:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2025-01-09 17:35:46,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2025-01-09 17:35:46,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2025-01-09 17:35:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2025-01-09 17:35:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2025-01-09 17:35:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2025-01-09 17:35:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2025-01-09 17:35:46,769 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 17:35:46,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 17:35:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 17:35:46,773 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2025-01-09 17:35:46,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2025-01-09 17:35:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2025-01-09 17:35:46,774 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2025-01-09 17:35:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2025-01-09 17:35:46,774 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2025-01-09 17:35:46,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 17:35:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 17:35:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 17:35:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 17:35:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 17:35:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 17:35:46,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 17:35:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 17:35:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2025-01-09 17:35:46,776 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2025-01-09 17:35:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-01-09 17:35:46,776 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-01-09 17:35:46,776 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-01-09 17:35:46,776 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2025-01-09 17:35:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-01-09 17:35:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 17:35:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-01-09 17:35:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2025-01-09 17:35:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-01-09 17:35:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-01-09 17:35:46,777 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-01-09 17:35:46,777 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-01-09 17:35:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2025-01-09 17:35:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2025-01-09 17:35:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2025-01-09 17:35:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2025-01-09 17:35:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2025-01-09 17:35:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-01-09 17:35:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-01-09 17:35:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 17:35:46,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 17:35:46,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 17:35:46,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 17:35:46,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 17:35:46,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 17:35:46,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 17:35:46,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 17:35:46,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 17:35:46,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 17:35:47,234 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 17:35:47,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 17:35:47,526 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2025-01-09 17:35:47,833 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-09 17:35:55,972 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2025-01-09 17:35:55,972 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2025-01-09 17:35:56,169 INFO L? ?]: Removed 597 outVars from TransFormulas that were not future-live. [2025-01-09 17:35:56,169 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 17:35:56,196 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 17:35:56,201 INFO L312 CfgBuilder]: Removed 13 assume(true) statements. [2025-01-09 17:35:56,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:35:56 BoogieIcfgContainer [2025-01-09 17:35:56,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 17:35:56,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 17:35:56,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 17:35:56,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 17:35:56,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:35:44" (1/3) ... [2025-01-09 17:35:56,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0bae90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:35:56, skipping insertion in model container [2025-01-09 17:35:56,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:35:46" (2/3) ... [2025-01-09 17:35:56,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0bae90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:35:56, skipping insertion in model container [2025-01-09 17:35:56,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:35:56" (3/3) ... [2025-01-09 17:35:56,212 INFO L128 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2025-01-09 17:35:56,227 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 17:35:56,228 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i that has 39 procedures, 509 locations, 1 initial locations, 16 loop locations, and 1 error locations. [2025-01-09 17:35:56,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 17:35:56,309 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;@169c01c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 17:35:56,309 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 17:35:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 508 states, 359 states have (on average 1.3119777158774373) internal successors, (471), 369 states have internal predecessors, (471), 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-01-09 17:35:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 17:35:56,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:35:56,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:35:56,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:35:56,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:35:56,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1992794621, now seen corresponding path program 1 times [2025-01-09 17:35:56,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:35:56,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845687228] [2025-01-09 17:35:56,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:35:56,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:35:58,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 17:35:59,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 17:35:59,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:35:59,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:35:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:35:59,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:35:59,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845687228] [2025-01-09 17:35:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845687228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:35:59,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:35:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:35:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012559692] [2025-01-09 17:35:59,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:35:59,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:35:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:00,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:36:00,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:00,013 INFO L87 Difference]: Start difference. First operand has 508 states, 359 states have (on average 1.3119777158774373) internal successors, (471), 369 states have internal predecessors, (471), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:36:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:00,223 INFO L93 Difference]: Finished difference Result 1000 states and 1388 transitions. [2025-01-09 17:36:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:36:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-09 17:36:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:00,244 INFO L225 Difference]: With dead ends: 1000 [2025-01-09 17:36:00,244 INFO L226 Difference]: Without dead ends: 501 [2025-01-09 17:36:00,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:00,256 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 0 mSDsluCounter, 1982 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:00,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2645 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-01-09 17:36:00,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2025-01-09 17:36:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 353 states have (on average 1.254957507082153) internal successors, (443), 361 states have internal predecessors, (443), 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-01-09 17:36:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 660 transitions. [2025-01-09 17:36:00,356 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 660 transitions. Word has length 21 [2025-01-09 17:36:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:00,357 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 660 transitions. [2025-01-09 17:36:00,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 17:36:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 660 transitions. [2025-01-09 17:36:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 17:36:00,359 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:00,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:00,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 17:36:00,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:00,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash 322456403, now seen corresponding path program 1 times [2025-01-09 17:36:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465695695] [2025-01-09 17:36:00,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:02,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 17:36:02,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 17:36:02,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:02,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 17:36:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:02,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465695695] [2025-01-09 17:36:02,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465695695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:02,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:02,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:02,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34755722] [2025-01-09 17:36:02,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:02,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:02,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:02,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:02,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:02,674 INFO L87 Difference]: Start difference. First operand 501 states and 660 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:36:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:02,812 INFO L93 Difference]: Finished difference Result 1459 states and 1937 transitions. [2025-01-09 17:36:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:02,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-01-09 17:36:02,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:02,825 INFO L225 Difference]: With dead ends: 1459 [2025-01-09 17:36:02,826 INFO L226 Difference]: Without dead ends: 978 [2025-01-09 17:36:02,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:02,830 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 644 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:02,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1417 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:02,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-01-09 17:36:02,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2025-01-09 17:36:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 688 states have (on average 1.255813953488372) internal successors, (864), 700 states have internal predecessors, (864), 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-01-09 17:36:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1290 transitions. [2025-01-09 17:36:02,920 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1290 transitions. Word has length 26 [2025-01-09 17:36:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:02,920 INFO L471 AbstractCegarLoop]: Abstraction has 974 states and 1290 transitions. [2025-01-09 17:36:02,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:36:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1290 transitions. [2025-01-09 17:36:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 17:36:02,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:02,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:02,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 17:36:02,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:02,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1405967457, now seen corresponding path program 1 times [2025-01-09 17:36:02,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:02,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034469065] [2025-01-09 17:36:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:02,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:04,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 17:36:04,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 17:36:04,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:04,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 17:36:04,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034469065] [2025-01-09 17:36:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034469065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:04,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603472561] [2025-01-09 17:36:04,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:04,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:04,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:04,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:04,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:04,993 INFO L87 Difference]: Start difference. First operand 974 states and 1290 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:36:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:05,120 INFO L93 Difference]: Finished difference Result 2879 states and 3829 transitions. [2025-01-09 17:36:05,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:05,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-01-09 17:36:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:05,136 INFO L225 Difference]: With dead ends: 2879 [2025-01-09 17:36:05,136 INFO L226 Difference]: Without dead ends: 1917 [2025-01-09 17:36:05,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:05,141 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 643 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:05,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1303 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:05,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-01-09 17:36:05,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1906. [2025-01-09 17:36:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1347 states have (on average 1.2538975501113585) internal successors, (1689), 1366 states have internal predecessors, (1689), 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-01-09 17:36:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2531 transitions. [2025-01-09 17:36:05,247 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2531 transitions. Word has length 27 [2025-01-09 17:36:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:05,248 INFO L471 AbstractCegarLoop]: Abstraction has 1906 states and 2531 transitions. [2025-01-09 17:36:05,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 17:36:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2531 transitions. [2025-01-09 17:36:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 17:36:05,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:05,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:05,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 17:36:05,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -107932883, now seen corresponding path program 1 times [2025-01-09 17:36:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164421034] [2025-01-09 17:36:05,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:05,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:06,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 17:36:06,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 17:36:06,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:06,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 17:36:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:07,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164421034] [2025-01-09 17:36:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164421034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595178721] [2025-01-09 17:36:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:07,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:07,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:07,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:07,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:07,312 INFO L87 Difference]: Start difference. First operand 1906 states and 2531 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 17:36:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:07,507 INFO L93 Difference]: Finished difference Result 4700 states and 6452 transitions. [2025-01-09 17:36:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 73 [2025-01-09 17:36:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:07,528 INFO L225 Difference]: With dead ends: 4700 [2025-01-09 17:36:07,528 INFO L226 Difference]: Without dead ends: 2809 [2025-01-09 17:36:07,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:07,537 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 260 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:07,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1287 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2025-01-09 17:36:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2797. [2025-01-09 17:36:07,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 1986 states have (on average 1.2875125881168177) internal successors, (2557), 2021 states have internal predecessors, (2557), 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-01-09 17:36:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 3911 transitions. [2025-01-09 17:36:07,678 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 3911 transitions. Word has length 73 [2025-01-09 17:36:07,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:07,678 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 3911 transitions. [2025-01-09 17:36:07,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-01-09 17:36:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 3911 transitions. [2025-01-09 17:36:07,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 17:36:07,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:07,684 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] [2025-01-09 17:36:07,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 17:36:07,684 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:07,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash 623275741, now seen corresponding path program 1 times [2025-01-09 17:36:07,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050555043] [2025-01-09 17:36:07,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:09,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 17:36:09,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 17:36:09,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:09,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 17:36:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050555043] [2025-01-09 17:36:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050555043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:10,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 17:36:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506468943] [2025-01-09 17:36:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 17:36:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:10,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 17:36:10,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 17:36:10,259 INFO L87 Difference]: Start difference. First operand 2797 states and 3911 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-01-09 17:36:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:10,468 INFO L93 Difference]: Finished difference Result 5594 states and 7827 transitions. [2025-01-09 17:36:10,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 17:36:10,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 80 [2025-01-09 17:36:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:10,491 INFO L225 Difference]: With dead ends: 5594 [2025-01-09 17:36:10,492 INFO L226 Difference]: Without dead ends: 2813 [2025-01-09 17:36:10,503 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-01-09 17:36:10,504 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 0 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:10,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1951 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:10,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2025-01-09 17:36:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2813. [2025-01-09 17:36:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2002 states have (on average 1.2852147852147853) internal successors, (2573), 2037 states have internal predecessors, (2573), 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-01-09 17:36:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 3927 transitions. [2025-01-09 17:36:10,648 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 3927 transitions. Word has length 80 [2025-01-09 17:36:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:10,649 INFO L471 AbstractCegarLoop]: Abstraction has 2813 states and 3927 transitions. [2025-01-09 17:36:10,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-01-09 17:36:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 3927 transitions. [2025-01-09 17:36:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 17:36:10,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:10,654 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] [2025-01-09 17:36:10,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 17:36:10,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:10,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 768228429, now seen corresponding path program 1 times [2025-01-09 17:36:10,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078180376] [2025-01-09 17:36:10,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:12,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 17:36:12,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 17:36:12,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:12,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 17:36:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078180376] [2025-01-09 17:36:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078180376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:12,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:36:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082758108] [2025-01-09 17:36:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:36:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:12,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:36:12,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:12,949 INFO L87 Difference]: Start difference. First operand 2813 states and 3927 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-01-09 17:36:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:13,162 INFO L93 Difference]: Finished difference Result 5368 states and 7469 transitions. [2025-01-09 17:36:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:36:13,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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 81 [2025-01-09 17:36:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:13,182 INFO L225 Difference]: With dead ends: 5368 [2025-01-09 17:36:13,182 INFO L226 Difference]: Without dead ends: 2571 [2025-01-09 17:36:13,192 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-01-09 17:36:13,194 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 0 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:13,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2601 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:13,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2025-01-09 17:36:13,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2571. [2025-01-09 17:36:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 1836 states have (on average 1.276143790849673) internal successors, (2343), 1853 states have internal predecessors, (2343), 594 states have call successors, (594), 139 states have call predecessors, (594), 140 states have return successors, (616), 586 states have call predecessors, (616), 590 states have call successors, (616) [2025-01-09 17:36:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3553 transitions. [2025-01-09 17:36:13,307 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3553 transitions. Word has length 81 [2025-01-09 17:36:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:13,307 INFO L471 AbstractCegarLoop]: Abstraction has 2571 states and 3553 transitions. [2025-01-09 17:36:13,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 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-01-09 17:36:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3553 transitions. [2025-01-09 17:36:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 17:36:13,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:13,313 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, 1, 1, 1, 1] [2025-01-09 17:36:13,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 17:36:13,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1627020185, now seen corresponding path program 1 times [2025-01-09 17:36:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622590261] [2025-01-09 17:36:13,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:15,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 17:36:15,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 17:36:15,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:36:16,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:16,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622590261] [2025-01-09 17:36:16,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622590261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:16,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:16,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:36:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860585868] [2025-01-09 17:36:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:16,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:36:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:16,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:36:16,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:36:16,207 INFO L87 Difference]: Start difference. First operand 2571 states and 3553 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-01-09 17:36:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:16,437 INFO L93 Difference]: Finished difference Result 4019 states and 5604 transitions. [2025-01-09 17:36:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:36:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 76 [2025-01-09 17:36:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:16,458 INFO L225 Difference]: With dead ends: 4019 [2025-01-09 17:36:16,458 INFO L226 Difference]: Without dead ends: 2599 [2025-01-09 17:36:16,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:36:16,466 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 0 mSDsluCounter, 3261 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3914 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:16,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3914 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:16,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2025-01-09 17:36:16,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2599. [2025-01-09 17:36:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2599 states, 1856 states have (on average 1.2731681034482758) internal successors, (2363), 1873 states have internal predecessors, (2363), 594 states have call successors, (594), 139 states have call predecessors, (594), 148 states have return successors, (640), 594 states have call predecessors, (640), 590 states have call successors, (640) [2025-01-09 17:36:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2599 states to 2599 states and 3597 transitions. [2025-01-09 17:36:16,634 INFO L78 Accepts]: Start accepts. Automaton has 2599 states and 3597 transitions. Word has length 76 [2025-01-09 17:36:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:16,635 INFO L471 AbstractCegarLoop]: Abstraction has 2599 states and 3597 transitions. [2025-01-09 17:36:16,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-01-09 17:36:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2599 states and 3597 transitions. [2025-01-09 17:36:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 17:36:16,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:16,638 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, 1, 1, 1, 1] [2025-01-09 17:36:16,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 17:36:16,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:16,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash 323280070, now seen corresponding path program 1 times [2025-01-09 17:36:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:16,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107311164] [2025-01-09 17:36:16,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:18,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 17:36:18,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 17:36:18,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:18,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 17:36:19,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:19,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107311164] [2025-01-09 17:36:19,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107311164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:19,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:19,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 17:36:19,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091280975] [2025-01-09 17:36:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:19,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 17:36:19,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:19,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 17:36:19,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:36:19,666 INFO L87 Difference]: Start difference. First operand 2599 states and 3597 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 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-01-09 17:36:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:20,435 INFO L93 Difference]: Finished difference Result 5194 states and 7211 transitions. [2025-01-09 17:36:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 17:36:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 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 76 [2025-01-09 17:36:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:20,459 INFO L225 Difference]: With dead ends: 5194 [2025-01-09 17:36:20,460 INFO L226 Difference]: Without dead ends: 2611 [2025-01-09 17:36:20,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 17:36:20,471 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 57 mSDsluCounter, 5187 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 5847 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:20,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 5847 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 17:36:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2025-01-09 17:36:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2595. [2025-01-09 17:36:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 1852 states have (on average 1.269438444924406) internal successors, (2351), 1871 states have internal predecessors, (2351), 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-01-09 17:36:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3585 transitions. [2025-01-09 17:36:20,586 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3585 transitions. Word has length 76 [2025-01-09 17:36:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:20,589 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3585 transitions. [2025-01-09 17:36:20,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 7 states have internal predecessors, (57), 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-01-09 17:36:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3585 transitions. [2025-01-09 17:36:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 17:36:20,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:20,595 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] [2025-01-09 17:36:20,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 17:36:20,595 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:20,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash -141939859, now seen corresponding path program 1 times [2025-01-09 17:36:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832848428] [2025-01-09 17:36:20,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:20,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:22,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 17:36:22,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 17:36:22,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:22,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 17:36:23,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832848428] [2025-01-09 17:36:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832848428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:23,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:23,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 17:36:23,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804055396] [2025-01-09 17:36:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:23,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 17:36:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:23,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 17:36:23,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 17:36:23,257 INFO L87 Difference]: Start difference. First operand 2595 states and 3585 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-01-09 17:36:27,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:36:31,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 17:36:41,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:41,441 INFO L93 Difference]: Finished difference Result 4042 states and 5633 transitions. [2025-01-09 17:36:41,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:36:41,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 81 [2025-01-09 17:36:41,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:41,468 INFO L225 Difference]: With dead ends: 4042 [2025-01-09 17:36:41,468 INFO L226 Difference]: Without dead ends: 4037 [2025-01-09 17:36:41,472 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-01-09 17:36:41,474 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 1663 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 392 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1754 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:41,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1754 Valid, 2257 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 1266 Invalid, 2 Unknown, 0 Unchecked, 17.8s Time] [2025-01-09 17:36:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4037 states. [2025-01-09 17:36:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4037 to 4007. [2025-01-09 17:36:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 2858 states have (on average 1.2729181245626313) internal successors, (3638), 2893 states have internal predecessors, (3638), 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-01-09 17:36:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 5598 transitions. [2025-01-09 17:36:41,659 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 5598 transitions. Word has length 81 [2025-01-09 17:36:41,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:41,660 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 5598 transitions. [2025-01-09 17:36:41,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-01-09 17:36:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 5598 transitions. [2025-01-09 17:36:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 17:36:41,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:41,671 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] [2025-01-09 17:36:41,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 17:36:41,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:41,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:41,672 INFO L85 PathProgramCache]: Analyzing trace with hash -720627639, now seen corresponding path program 1 times [2025-01-09 17:36:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:41,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387689717] [2025-01-09 17:36:41,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:41,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 17:36:43,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 17:36:43,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 17:36:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387689717] [2025-01-09 17:36:44,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387689717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:44,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:44,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:36:44,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135314734] [2025-01-09 17:36:44,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:44,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:36:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:44,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:36:44,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:44,480 INFO L87 Difference]: Start difference. First operand 4007 states and 5598 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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-01-09 17:36:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:44,685 INFO L93 Difference]: Finished difference Result 6637 states and 9283 transitions. [2025-01-09 17:36:44,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:36:44,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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 88 [2025-01-09 17:36:44,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:44,710 INFO L225 Difference]: With dead ends: 6637 [2025-01-09 17:36:44,711 INFO L226 Difference]: Without dead ends: 3791 [2025-01-09 17:36:44,721 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-01-09 17:36:44,722 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 0 mSDsluCounter, 1952 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:44,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2605 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2025-01-09 17:36:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3791. [2025-01-09 17:36:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3791 states, 2705 states have (on average 1.266173752310536) internal successors, (3425), 2727 states have internal predecessors, (3425), 860 states have call successors, (860), 205 states have call predecessors, (860), 225 states have return successors, (978), 870 states have call predecessors, (978), 856 states have call successors, (978) [2025-01-09 17:36:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3791 states to 3791 states and 5263 transitions. [2025-01-09 17:36:44,879 INFO L78 Accepts]: Start accepts. Automaton has 3791 states and 5263 transitions. Word has length 88 [2025-01-09 17:36:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:44,879 INFO L471 AbstractCegarLoop]: Abstraction has 3791 states and 5263 transitions. [2025-01-09 17:36:44,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 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-01-09 17:36:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3791 states and 5263 transitions. [2025-01-09 17:36:44,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 17:36:44,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:44,884 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] [2025-01-09 17:36:44,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 17:36:44,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -787634392, now seen corresponding path program 1 times [2025-01-09 17:36:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403366590] [2025-01-09 17:36:44,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:46,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 17:36:46,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 17:36:46,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:46,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 17:36:47,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:47,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403366590] [2025-01-09 17:36:47,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403366590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:47,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:47,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 17:36:47,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035523256] [2025-01-09 17:36:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:47,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 17:36:47,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:47,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 17:36:47,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:36:47,962 INFO L87 Difference]: Start difference. First operand 3791 states and 5263 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 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-01-09 17:36:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:48,230 INFO L93 Difference]: Finished difference Result 5831 states and 8130 transitions. [2025-01-09 17:36:48,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 17:36:48,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 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 88 [2025-01-09 17:36:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:48,275 INFO L225 Difference]: With dead ends: 5831 [2025-01-09 17:36:48,275 INFO L226 Difference]: Without dead ends: 3803 [2025-01-09 17:36:48,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 17:36:48,285 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 0 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:48,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3922 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:36:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3803 states. [2025-01-09 17:36:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3803 to 3803. [2025-01-09 17:36:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3803 states, 2717 states have (on average 1.2649981597350017) internal successors, (3437), 2733 states have internal predecessors, (3437), 860 states have call successors, (860), 205 states have call predecessors, (860), 225 states have return successors, (978), 876 states have call predecessors, (978), 856 states have call successors, (978) [2025-01-09 17:36:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 5275 transitions. [2025-01-09 17:36:48,437 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 5275 transitions. Word has length 88 [2025-01-09 17:36:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:48,437 INFO L471 AbstractCegarLoop]: Abstraction has 3803 states and 5275 transitions. [2025-01-09 17:36:48,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 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-01-09 17:36:48,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 5275 transitions. [2025-01-09 17:36:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-01-09 17:36:48,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:48,441 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:48,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 17:36:48,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:48,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash -436834455, now seen corresponding path program 1 times [2025-01-09 17:36:48,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:48,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927267357] [2025-01-09 17:36:48,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:48,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:50,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 17:36:50,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 17:36:50,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:50,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 17:36:50,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:50,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927267357] [2025-01-09 17:36:50,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927267357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:50,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:50,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 17:36:50,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061076605] [2025-01-09 17:36:50,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:50,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 17:36:50,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:50,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 17:36:50,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:50,538 INFO L87 Difference]: Start difference. First operand 3803 states and 5275 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-01-09 17:36:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:50,779 INFO L93 Difference]: Finished difference Result 5311 states and 7397 transitions. [2025-01-09 17:36:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 17:36:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 88 [2025-01-09 17:36:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:50,805 INFO L225 Difference]: With dead ends: 5311 [2025-01-09 17:36:50,806 INFO L226 Difference]: Without dead ends: 3859 [2025-01-09 17:36:50,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 17:36:50,812 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 9 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:50,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1290 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 17:36:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3859 states. [2025-01-09 17:36:50,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3859 to 3807. [2025-01-09 17:36:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3807 states, 2721 states have (on average 1.264608599779493) internal successors, (3441), 2737 states have internal predecessors, (3441), 860 states have call successors, (860), 205 states have call predecessors, (860), 225 states have return successors, (978), 876 states have call predecessors, (978), 856 states have call successors, (978) [2025-01-09 17:36:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3807 states to 3807 states and 5279 transitions. [2025-01-09 17:36:50,986 INFO L78 Accepts]: Start accepts. Automaton has 3807 states and 5279 transitions. Word has length 88 [2025-01-09 17:36:50,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:50,987 INFO L471 AbstractCegarLoop]: Abstraction has 3807 states and 5279 transitions. [2025-01-09 17:36:50,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-01-09 17:36:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3807 states and 5279 transitions. [2025-01-09 17:36:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 17:36:50,992 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:50,992 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:50,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 17:36:50,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:50,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:50,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1516067139, now seen corresponding path program 1 times [2025-01-09 17:36:50,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:50,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488173555] [2025-01-09 17:36:50,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:50,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 17:36:53,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 17:36:53,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 17:36:53,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 17:36:53,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 17:36:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 17:36:53,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 17:36:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488173555] [2025-01-09 17:36:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488173555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 17:36:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 17:36:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 17:36:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815856126] [2025-01-09 17:36:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 17:36:53,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 17:36:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 17:36:53,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 17:36:53,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 17:36:53,826 INFO L87 Difference]: Start difference. First operand 3807 states and 5279 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-01-09 17:36:54,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 17:36:54,068 INFO L93 Difference]: Finished difference Result 6949 states and 9652 transitions. [2025-01-09 17:36:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 17:36:54,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 101 [2025-01-09 17:36:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 17:36:54,089 INFO L225 Difference]: With dead ends: 6949 [2025-01-09 17:36:54,089 INFO L226 Difference]: Without dead ends: 3158 [2025-01-09 17:36:54,102 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-01-09 17:36:54,103 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 0 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 17:36:54,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2602 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 17:36:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3158 states. [2025-01-09 17:36:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3158 to 3158. [2025-01-09 17:36:54,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 2265 states have (on average 1.2635761589403973) internal successors, (2862), 2273 states have internal predecessors, (2862), 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-01-09 17:36:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 4382 transitions. [2025-01-09 17:36:54,227 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 4382 transitions. Word has length 101 [2025-01-09 17:36:54,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 17:36:54,228 INFO L471 AbstractCegarLoop]: Abstraction has 3158 states and 4382 transitions. [2025-01-09 17:36:54,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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-01-09 17:36:54,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 4382 transitions. [2025-01-09 17:36:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-09 17:36:54,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 17:36:54,232 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 17:36:54,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 17:36:54,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 17:36:54,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 17:36:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1586975256, now seen corresponding path program 1 times [2025-01-09 17:36:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 17:36:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227420247] [2025-01-09 17:36:54,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 17:36:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms