./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 03:26:12,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 03:26:12,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-09 03:26:12,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 03:26:12,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 03:26:12,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 03:26:12,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 03:26:12,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 03:26:12,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 03:26:12,695 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 03:26:12,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 03:26:12,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 03:26:12,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 03:26:12,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 03:26:12,697 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 03:26:12,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 03:26:12,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 03:26:12,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 03:26:12,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 03:26:12,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 03:26:12,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 03:26:12,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 03:26:12,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 03:26:12,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 03:26:12,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 03:26:12,705 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 03:26:12,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 03:26:12,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 03:26:12,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 03:26:12,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 03:26:12,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 03:26:12,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 03:26:12,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 03:26:12,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 03:26:12,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 03:26:12,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 03:26:12,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 03:26:12,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 03:26:12,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 03:26:12,710 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2024-11-09 03:26:12,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 03:26:12,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 03:26:12,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 03:26:12,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 03:26:12,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 03:26:12,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2024-11-09 03:26:14,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 03:26:14,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 03:26:14,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2024-11-09 03:26:14,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5383549f3/5ce8f904fe2442d2b6b40728cb3a9ac6/FLAG6106e44b8 [2024-11-09 03:26:14,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5383549f3/5ce8f904fe2442d2b6b40728cb3a9ac6 [2024-11-09 03:26:14,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 03:26:14,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 03:26:14,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 03:26:14,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 03:26:14,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 03:26:14,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:14" (1/1) ... [2024-11-09 03:26:14,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438691b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:14, skipping insertion in model container [2024-11-09 03:26:14,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:26:14" (1/1) ... [2024-11-09 03:26:14,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 03:26:15,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2024-11-09 03:26:15,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 03:26:15,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 03:26:16,083 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] [2024-11-09 03:26:16,087 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] [2024-11-09 03:26:16,087 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] [2024-11-09 03:26:16,090 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] [2024-11-09 03:26:16,090 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] [2024-11-09 03:26:16,174 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] [2024-11-09 03:26:16,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2024-11-09 03:26:16,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 03:26:16,526 INFO L204 MainTranslator]: Completed translation [2024-11-09 03:26:16,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16 WrapperNode [2024-11-09 03:26:16,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 03:26:16,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 03:26:16,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 03:26:16,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 03:26:16,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,561 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,662 INFO L138 Inliner]: procedures = 132, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1708 [2024-11-09 03:26:16,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 03:26:16,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 03:26:16,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 03:26:16,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 03:26:16,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,824 INFO L175 MemorySlicer]: Split 342 memory accesses to 8 slices as follows [2, 8, 10, 3, 261, 42, 8, 8]. 76 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 8, 0, 0, 8, 0, 8, 8]. The 214 writes are split as follows [0, 0, 0, 0, 172, 42, 0, 0]. [2024-11-09 03:26:16,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,867 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 03:26:16,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 03:26:16,920 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 03:26:16,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 03:26:16,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (1/1) ... [2024-11-09 03:26:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 03:26:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 03:26:16,961 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 03:26:16,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 03:26:17,013 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-11-09 03:26:17,015 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2024-11-09 03:26:17,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-09 03:26:17,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-09 03:26:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-09 03:26:17,016 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2024-11-09 03:26:17,016 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2024-11-09 03:26:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-11-09 03:26:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-11-09 03:26:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-11-09 03:26:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-11-09 03:26:17,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-11-09 03:26:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-11-09 03:26:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-11-09 03:26:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-11-09 03:26:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-09 03:26:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-09 03:26:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-09 03:26:17,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-09 03:26:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-09 03:26:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-09 03:26:17,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-11-09 03:26:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2024-11-09 03:26:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-11-09 03:26:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-11-09 03:26:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-09 03:26:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-09 03:26:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2024-11-09 03:26:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2024-11-09 03:26:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-11-09 03:26:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-11-09 03:26:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-09 03:26:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-09 03:26:17,021 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-11-09 03:26:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-11-09 03:26:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 03:26:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 03:26:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 03:26:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 03:26:17,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 03:26:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 03:26:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 03:26:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-09 03:26:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2024-11-09 03:26:17,023 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2024-11-09 03:26:17,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2024-11-09 03:26:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2024-11-09 03:26:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-11-09 03:26:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-11-09 03:26:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-11-09 03:26:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-11-09 03:26:17,024 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2024-11-09 03:26:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2024-11-09 03:26:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 03:26:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2024-11-09 03:26:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2024-11-09 03:26:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 03:26:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-11-09 03:26:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2024-11-09 03:26:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2024-11-09 03:26:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-11-09 03:26:17,026 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-11-09 03:26:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-11-09 03:26:17,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-11-09 03:26:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 03:26:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 03:26:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 03:26:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 03:26:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-09 03:26:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-09 03:26:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-09 03:26:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-09 03:26:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-11-09 03:26:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-11-09 03:26:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2024-11-09 03:26:17,028 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2024-11-09 03:26:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-11-09 03:26:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-11-09 03:26:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2024-11-09 03:26:17,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2024-11-09 03:26:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 03:26:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-11-09 03:26:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-11-09 03:26:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-11-09 03:26:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-11-09 03:26:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-11-09 03:26:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-11-09 03:26:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-11-09 03:26:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-11-09 03:26:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-11-09 03:26:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-11-09 03:26:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-11-09 03:26:17,030 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-11-09 03:26:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2024-11-09 03:26:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-11-09 03:26:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2024-11-09 03:26:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-11-09 03:26:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2024-11-09 03:26:17,031 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 03:26:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 03:26:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 03:26:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-09 03:26:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-11-09 03:26:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-11-09 03:26:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2024-11-09 03:26:17,032 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2024-11-09 03:26:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-11-09 03:26:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-11-09 03:26:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-11-09 03:26:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-11-09 03:26:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-11-09 03:26:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-11-09 03:26:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-11-09 03:26:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-11-09 03:26:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 03:26:17,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 03:26:17,383 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 03:26:17,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 03:26:17,574 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2024-11-09 03:26:17,819 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 03:26:24,782 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2024-11-09 03:26:24,782 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2024-11-09 03:26:24,907 INFO L? ?]: Removed 601 outVars from TransFormulas that were not future-live. [2024-11-09 03:26:24,907 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 03:26:24,927 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 03:26:24,928 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-09 03:26:24,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:24 BoogieIcfgContainer [2024-11-09 03:26:24,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 03:26:24,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 03:26:24,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 03:26:24,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 03:26:24,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:26:14" (1/3) ... [2024-11-09 03:26:24,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec141e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:24, skipping insertion in model container [2024-11-09 03:26:24,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:26:16" (2/3) ... [2024-11-09 03:26:24,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec141e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:26:24, skipping insertion in model container [2024-11-09 03:26:24,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:26:24" (3/3) ... [2024-11-09 03:26:24,936 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2024-11-09 03:26:24,952 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 03:26:24,952 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 03:26:25,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 03:26:25,039 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;@29710333, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 03:26:25,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 03:26:25,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 521 states, 370 states have (on average 1.3432432432432433) internal successors, (497), 382 states have internal predecessors, (497), 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) [2024-11-09 03:26:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 03:26:25,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:25,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:26:25,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:25,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:25,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1540023497, now seen corresponding path program 1 times [2024-11-09 03:26:25,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:25,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835013133] [2024-11-09 03:26:25,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:25,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:28,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:26:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:28,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 03:26:28,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:28,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835013133] [2024-11-09 03:26:28,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835013133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:28,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:28,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 03:26:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613762370] [2024-11-09 03:26:28,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:28,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 03:26:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 03:26:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 03:26:28,887 INFO L87 Difference]: Start difference. First operand has 521 states, 370 states have (on average 1.3432432432432433) internal successors, (497), 382 states have internal predecessors, (497), 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) [2024-11-09 03:26:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:29,044 INFO L93 Difference]: Finished difference Result 1026 states and 1440 transitions. [2024-11-09 03:26:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 03:26:29,046 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 [2024-11-09 03:26:29,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:29,062 INFO L225 Difference]: With dead ends: 1026 [2024-11-09 03:26:29,063 INFO L226 Difference]: Without dead ends: 514 [2024-11-09 03:26:29,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 03:26:29,078 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 0 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2697 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 [2024-11-09 03:26:29,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2697 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 03:26:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-09 03:26:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-11-09 03:26:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 366 states have (on average 1.2459016393442623) internal successors, (456), 374 states have internal predecessors, (456), 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) [2024-11-09 03:26:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 673 transitions. [2024-11-09 03:26:29,179 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 673 transitions. Word has length 21 [2024-11-09 03:26:29,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:29,181 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 673 transitions. [2024-11-09 03:26:29,181 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) [2024-11-09 03:26:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 673 transitions. [2024-11-09 03:26:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 03:26:29,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:29,183 INFO L215 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] [2024-11-09 03:26:29,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 03:26:29,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash -942975973, now seen corresponding path program 1 times [2024-11-09 03:26:29,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023246192] [2024-11-09 03:26:29,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:26:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 03:26:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 03:26:32,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:32,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023246192] [2024-11-09 03:26:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023246192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:32,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:32,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 03:26:32,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718029872] [2024-11-09 03:26:32,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:32,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 03:26:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:32,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 03:26:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:26:32,144 INFO L87 Difference]: Start difference. First operand 514 states and 673 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) [2024-11-09 03:26:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:32,306 INFO L93 Difference]: Finished difference Result 1498 states and 1976 transitions. [2024-11-09 03:26:32,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 03:26:32,307 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 [2024-11-09 03:26:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:32,313 INFO L225 Difference]: With dead ends: 1498 [2024-11-09 03:26:32,313 INFO L226 Difference]: Without dead ends: 1004 [2024-11-09 03:26:32,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:26:32,315 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 657 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1383 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 [2024-11-09 03:26:32,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1383 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 03:26:32,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2024-11-09 03:26:32,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 1000. [2024-11-09 03:26:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 714 states have (on average 1.246498599439776) internal successors, (890), 726 states have internal predecessors, (890), 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) [2024-11-09 03:26:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1316 transitions. [2024-11-09 03:26:32,361 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1316 transitions. Word has length 26 [2024-11-09 03:26:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:32,362 INFO L471 AbstractCegarLoop]: Abstraction has 1000 states and 1316 transitions. [2024-11-09 03:26:32,362 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) [2024-11-09 03:26:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1316 transitions. [2024-11-09 03:26:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 03:26:32,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:32,363 INFO L215 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] [2024-11-09 03:26:32,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 03:26:32,363 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:32,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 832270623, now seen corresponding path program 1 times [2024-11-09 03:26:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838444532] [2024-11-09 03:26:32,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:26:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 03:26:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 03:26:34,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:34,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838444532] [2024-11-09 03:26:34,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838444532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:34,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:34,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 03:26:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943812364] [2024-11-09 03:26:34,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:34,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 03:26:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 03:26:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:26:34,447 INFO L87 Difference]: Start difference. First operand 1000 states and 1316 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) [2024-11-09 03:26:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:34,552 INFO L93 Difference]: Finished difference Result 2957 states and 3907 transitions. [2024-11-09 03:26:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 03:26:34,553 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 [2024-11-09 03:26:34,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:34,563 INFO L225 Difference]: With dead ends: 2957 [2024-11-09 03:26:34,564 INFO L226 Difference]: Without dead ends: 1969 [2024-11-09 03:26:34,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 03:26:34,569 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 656 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1331 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.0s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:34,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1331 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 03:26:34,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2024-11-09 03:26:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1958. [2024-11-09 03:26:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 1399 states have (on average 1.2444603288062903) internal successors, (1741), 1418 states have internal predecessors, (1741), 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) [2024-11-09 03:26:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 2583 transitions. [2024-11-09 03:26:34,655 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 2583 transitions. Word has length 27 [2024-11-09 03:26:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:34,656 INFO L471 AbstractCegarLoop]: Abstraction has 1958 states and 2583 transitions. [2024-11-09 03:26:34,656 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) [2024-11-09 03:26:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 2583 transitions. [2024-11-09 03:26:34,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 03:26:34,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:34,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:26:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 03:26:34,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -863698126, now seen corresponding path program 1 times [2024-11-09 03:26:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188278402] [2024-11-09 03:26:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:26:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 03:26:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 03:26:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 03:26:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 03:26:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 03:26:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 03:26:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 03:26:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 03:26:36,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188278402] [2024-11-09 03:26:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188278402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:36,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 03:26:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811622008] [2024-11-09 03:26:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:36,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 03:26:36,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:36,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 03:26:36,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 03:26:36,921 INFO L87 Difference]: Start difference. First operand 1958 states and 2583 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 03:26:40,955 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 [] [2024-11-09 03:26:45,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:26:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:26:53,963 INFO L93 Difference]: Finished difference Result 4932 states and 6782 transitions. [2024-11-09 03:26:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 03:26:53,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2024-11-09 03:26:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:26:54,002 INFO L225 Difference]: With dead ends: 4932 [2024-11-09 03:26:54,005 INFO L226 Difference]: Without dead ends: 2989 [2024-11-09 03:26:54,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 03:26:54,020 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 544 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 370 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2024-11-09 03:26:54,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1432 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 773 Invalid, 2 Unknown, 0 Unchecked, 16.7s Time] [2024-11-09 03:26:54,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2024-11-09 03:26:54,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2865. [2024-11-09 03:26:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 2054 states have (on average 1.2779941577409932) internal successors, (2625), 2089 states have internal predecessors, (2625), 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) [2024-11-09 03:26:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 3979 transitions. [2024-11-09 03:26:54,120 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 3979 transitions. Word has length 76 [2024-11-09 03:26:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:26:54,121 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 3979 transitions. [2024-11-09 03:26:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 03:26:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 3979 transitions. [2024-11-09 03:26:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 03:26:54,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:26:54,129 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:26:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 03:26:54,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:26:54,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:26:54,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2056923021, now seen corresponding path program 1 times [2024-11-09 03:26:54,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:26:54,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638385092] [2024-11-09 03:26:54,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:26:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:26:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:26:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:26:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:26:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 03:26:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 03:26:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:26:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 03:26:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 03:26:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 03:26:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:26:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 03:26:56,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:26:56,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638385092] [2024-11-09 03:26:56,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638385092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:26:56,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:26:56,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 03:26:56,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973118976] [2024-11-09 03:26:56,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:26:56,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 03:26:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:26:56,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 03:26:56,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 03:26:56,596 INFO L87 Difference]: Start difference. First operand 2865 states and 3979 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:27:00,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:27:04,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:27:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:27:11,240 INFO L93 Difference]: Finished difference Result 5810 states and 8143 transitions. [2024-11-09 03:27:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 03:27:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2024-11-09 03:27:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:27:11,261 INFO L225 Difference]: With dead ends: 5810 [2024-11-09 03:27:11,261 INFO L226 Difference]: Without dead ends: 2961 [2024-11-09 03:27:11,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 03:27:11,273 INFO L432 NwaCegarLoop]: 507 mSDtfsCounter, 148 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 107 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1987 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-09 03:27:11,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1987 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 881 Invalid, 2 Unknown, 0 Unchecked, 14.4s Time] [2024-11-09 03:27:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2024-11-09 03:27:11,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2899. [2024-11-09 03:27:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2899 states, 2082 states have (on average 1.2752161383285303) internal successors, (2655), 2119 states have internal predecessors, (2655), 670 states have call successors, (670), 141 states have call predecessors, (670), 146 states have return successors, (706), 654 states have call predecessors, (706), 666 states have call successors, (706) [2024-11-09 03:27:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2899 states to 2899 states and 4031 transitions. [2024-11-09 03:27:11,405 INFO L78 Accepts]: Start accepts. Automaton has 2899 states and 4031 transitions. Word has length 78 [2024-11-09 03:27:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:27:11,406 INFO L471 AbstractCegarLoop]: Abstraction has 2899 states and 4031 transitions. [2024-11-09 03:27:11,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:27:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2899 states and 4031 transitions. [2024-11-09 03:27:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 03:27:11,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:27:11,412 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:27:11,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 03:27:11,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:27:11,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:27:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash -479661540, now seen corresponding path program 1 times [2024-11-09 03:27:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:27:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955835010] [2024-11-09 03:27:11,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:27:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:27:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:27:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:27:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:27:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 03:27:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 03:27:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:27:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 03:27:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 03:27:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 03:27:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 03:27:14,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:27:14,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955835010] [2024-11-09 03:27:14,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955835010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:27:14,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:27:14,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 03:27:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471180136] [2024-11-09 03:27:14,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:27:14,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 03:27:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:27:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 03:27:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 03:27:14,379 INFO L87 Difference]: Start difference. First operand 2899 states and 4031 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:27:18,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:27:22,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 03:27:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 03:27:33,451 INFO L93 Difference]: Finished difference Result 5860 states and 8211 transitions. [2024-11-09 03:27:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 03:27:33,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2024-11-09 03:27:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 03:27:33,476 INFO L225 Difference]: With dead ends: 5860 [2024-11-09 03:27:33,476 INFO L226 Difference]: Without dead ends: 2977 [2024-11-09 03:27:33,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 03:27:33,490 INFO L432 NwaCegarLoop]: 506 mSDtfsCounter, 148 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 107 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2024-11-09 03:27:33,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 2828 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1386 Invalid, 2 Unknown, 0 Unchecked, 18.9s Time] [2024-11-09 03:27:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2977 states. [2024-11-09 03:27:33,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2977 to 2915. [2024-11-09 03:27:33,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2915 states, 2098 states have (on average 1.273117254528122) internal successors, (2671), 2135 states have internal predecessors, (2671), 670 states have call successors, (670), 141 states have call predecessors, (670), 146 states have return successors, (706), 654 states have call predecessors, (706), 666 states have call successors, (706) [2024-11-09 03:27:33,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2915 states to 2915 states and 4047 transitions. [2024-11-09 03:27:33,637 INFO L78 Accepts]: Start accepts. Automaton has 2915 states and 4047 transitions. Word has length 79 [2024-11-09 03:27:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 03:27:33,638 INFO L471 AbstractCegarLoop]: Abstraction has 2915 states and 4047 transitions. [2024-11-09 03:27:33,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:27:33,638 INFO L276 IsEmpty]: Start isEmpty. Operand 2915 states and 4047 transitions. [2024-11-09 03:27:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 03:27:33,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 03:27:33,643 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 03:27:33,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 03:27:33,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 03:27:33,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 03:27:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2123920677, now seen corresponding path program 1 times [2024-11-09 03:27:33,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 03:27:33,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693969691] [2024-11-09 03:27:33,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 03:27:33,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 03:27:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:36,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 03:27:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 03:27:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:36,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 03:27:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 03:27:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:36,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 03:27:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-09 03:27:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:37,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 03:27:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:37,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 03:27:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:37,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 03:27:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 03:27:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 03:27:37,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 03:27:37,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693969691] [2024-11-09 03:27:37,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693969691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 03:27:37,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 03:27:37,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 03:27:37,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65698461] [2024-11-09 03:27:37,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 03:27:37,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 03:27:37,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 03:27:37,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 03:27:37,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-09 03:27:37,540 INFO L87 Difference]: Start difference. First operand 2915 states and 4047 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 03:27:41,570 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 [] [2024-11-09 03:27:45,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []