./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-24 13:05:00,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 13:05:00,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 13:05:00,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 13:05:00,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 13:05:00,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 13:05:00,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 13:05:00,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 13:05:00,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 13:05:00,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 13:05:00,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 13:05:00,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 13:05:00,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 13:05:00,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 13:05:00,266 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 13:05:00,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 13:05:00,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 13:05:00,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 13:05:00,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 13:05:00,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 13:05:00,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 13:05:00,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 13:05:00,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 13:05:00,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 13:05:00,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 13:05:00,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 13:05:00,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 13:05:00,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 13:05:00,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 13:05:00,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:05:00,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 13:05:00,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 13:05:00,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 13:05:00,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 13:05:00,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 13:05:00,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 13:05:00,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 13:05:00,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 13:05:00,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 13:05:00,279 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-10-24 13:05:00,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 13:05:00,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 13:05:00,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 13:05:00,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 13:05:00,616 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 13:05:00,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /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-10-24 13:05:02,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 13:05:02,484 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 13:05:02,485 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-10-24 13:05:02,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92673919/ae76120fec7148afac06fcfc6a073194/FLAGda17e0ce0 [2024-10-24 13:05:02,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a92673919/ae76120fec7148afac06fcfc6a073194 [2024-10-24 13:05:02,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 13:05:02,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 13:05:02,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 13:05:02,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 13:05:02,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 13:05:02,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:05:02" (1/1) ... [2024-10-24 13:05:02,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532d2415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:02, skipping insertion in model container [2024-10-24 13:05:02,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:05:02" (1/1) ... [2024-10-24 13:05:02,749 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 13:05:04,048 WARN L248 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-10-24 13:05:04,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:05:04,133 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 13:05:04,291 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-10-24 13:05:04,295 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-10-24 13:05:04,296 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-10-24 13:05:04,298 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-10-24 13:05:04,299 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-10-24 13:05:04,410 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-10-24 13:05:04,493 WARN L248 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-10-24 13:05:04,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:05:04,723 INFO L204 MainTranslator]: Completed translation [2024-10-24 13:05:04,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04 WrapperNode [2024-10-24 13:05:04,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 13:05:04,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 13:05:04,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 13:05:04,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 13:05:04,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:04,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:04,907 INFO L138 Inliner]: procedures = 133, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1572 [2024-10-24 13:05:04,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 13:05:04,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 13:05:04,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 13:05:04,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 13:05:04,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:04,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:04,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,128 INFO L175 MemorySlicer]: Split 337 memory accesses to 8 slices as follows [2, 258, 3, 8, 40, 10, 8, 8]. 77 percent of accesses are in the largest equivalence class. The 152 initializations are split as follows [2, 86, 0, 8, 40, 0, 8, 8]. The 91 writes are split as follows [0, 91, 0, 0, 0, 0, 0, 0]. [2024-10-24 13:05:05,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,193 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 13:05:05,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 13:05:05,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 13:05:05,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 13:05:05,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (1/1) ... [2024-10-24 13:05:05,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:05:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:05:05,291 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-10-24 13:05:05,296 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-10-24 13:05:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-10-24 13:05:05,350 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-10-24 13:05:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2024-10-24 13:05:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2024-10-24 13:05:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-24 13:05:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-24 13:05:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-24 13:05:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-24 13:05:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-24 13:05:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-24 13:05:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-24 13:05:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-24 13:05:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2024-10-24 13:05:05,352 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2024-10-24 13:05:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-24 13:05:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-24 13:05:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-24 13:05:05,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-24 13:05:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-24 13:05:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-24 13:05:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-24 13:05:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-24 13:05:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-24 13:05:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-24 13:05:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-24 13:05:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-24 13:05:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-24 13:05:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-24 13:05:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-24 13:05:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-24 13:05:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-24 13:05:05,357 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-24 13:05:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2024-10-24 13:05:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2024-10-24 13:05:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-24 13:05:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-24 13:05:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 13:05:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 13:05:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2024-10-24 13:05:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2024-10-24 13:05:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-10-24 13:05:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-10-24 13:05:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 13:05:05,358 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 13:05:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-10-24 13:05:05,359 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-10-24 13:05:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 13:05:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 13:05:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 13:05:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 13:05:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 13:05:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 13:05:05,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 13:05:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 13:05:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2024-10-24 13:05:05,363 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2024-10-24 13:05:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2024-10-24 13:05:05,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2024-10-24 13:05:05,363 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-10-24 13:05:05,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-10-24 13:05:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-24 13:05:05,364 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-24 13:05:05,364 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2024-10-24 13:05:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2024-10-24 13:05:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 13:05:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2024-10-24 13:05:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2024-10-24 13:05:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 13:05:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-24 13:05:05,365 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-24 13:05:05,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 13:05:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 13:05:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 13:05:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 13:05:05,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 13:05:05,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 13:05:05,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 13:05:05,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 13:05:05,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 13:05:05,368 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2024-10-24 13:05:05,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2024-10-24 13:05:05,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-10-24 13:05:05,368 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-10-24 13:05:05,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-10-24 13:05:05,368 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-10-24 13:05:05,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 13:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 13:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 13:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 13:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 13:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 13:05:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 13:05:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 13:05:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-10-24 13:05:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-10-24 13:05:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2024-10-24 13:05:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2024-10-24 13:05:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-10-24 13:05:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-10-24 13:05:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2024-10-24 13:05:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2024-10-24 13:05:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 13:05:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 13:05:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 13:05:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 13:05:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 13:05:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 13:05:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 13:05:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 13:05:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 13:05:05,372 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-24 13:05:05,372 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-24 13:05:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-24 13:05:05,373 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-24 13:05:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-24 13:05:05,373 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-24 13:05:05,373 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-10-24 13:05:05,373 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-10-24 13:05:05,374 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-24 13:05:05,374 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-24 13:05:05,374 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-10-24 13:05:05,374 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-10-24 13:05:05,374 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2024-10-24 13:05:05,374 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2024-10-24 13:05:05,375 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-24 13:05:05,375 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-24 13:05:05,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2024-10-24 13:05:05,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2024-10-24 13:05:05,375 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-10-24 13:05:05,375 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-10-24 13:05:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2024-10-24 13:05:05,376 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2024-10-24 13:05:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 13:05:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 13:05:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 13:05:05,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 13:05:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 13:05:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 13:05:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 13:05:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 13:05:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-10-24 13:05:05,377 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-10-24 13:05:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2024-10-24 13:05:05,378 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2024-10-24 13:05:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-24 13:05:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-24 13:05:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-24 13:05:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-24 13:05:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-24 13:05:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-24 13:05:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-24 13:05:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-24 13:05:05,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 13:05:05,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 13:05:05,788 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 13:05:05,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 13:05:06,024 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2024-10-24 13:05:06,327 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 13:05:07,467 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2024-10-24 13:05:07,468 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2024-10-24 13:05:07,655 INFO L? ?]: Removed 601 outVars from TransFormulas that were not future-live. [2024-10-24 13:05:07,655 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 13:05:07,781 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 13:05:07,785 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-24 13:05:07,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:05:07 BoogieIcfgContainer [2024-10-24 13:05:07,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 13:05:07,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 13:05:07,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 13:05:07,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 13:05:07,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:05:02" (1/3) ... [2024-10-24 13:05:07,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c64730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:05:07, skipping insertion in model container [2024-10-24 13:05:07,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:05:04" (2/3) ... [2024-10-24 13:05:07,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25c64730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:05:07, skipping insertion in model container [2024-10-24 13:05:07,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:05:07" (3/3) ... [2024-10-24 13:05:07,795 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2024-10-24 13:05:07,810 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 13:05:07,810 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 13:05:07,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 13:05:07,898 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;@79cd35b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 13:05:07,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 13:05:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 445 states, 294 states have (on average 1.4319727891156462) internal successors, (421), 306 states have internal predecessors, (421), 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-10-24 13:05:07,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-24 13:05:07,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:07,916 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:07,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash -216078356, now seen corresponding path program 1 times [2024-10-24 13:05:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681359160] [2024-10-24 13:05:07,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:07,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:09,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 13:05:09,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:09,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681359160] [2024-10-24 13:05:09,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681359160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:09,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:09,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 13:05:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725508222] [2024-10-24 13:05:09,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:09,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 13:05:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:09,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 13:05:09,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 13:05:09,329 INFO L87 Difference]: Start difference. First operand has 445 states, 294 states have (on average 1.4319727891156462) internal successors, (421), 306 states have internal predecessors, (421), 112 states have call successors, (112), 38 states have call predecessors, (112), 37 states have return successors, (110), 108 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-10-24 13:05:12,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 13:05:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:05:13,484 INFO L93 Difference]: Finished difference Result 879 states and 1293 transitions. [2024-10-24 13:05:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 13:05:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 16 [2024-10-24 13:05:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:05:13,508 INFO L225 Difference]: With dead ends: 879 [2024-10-24 13:05:13,508 INFO L226 Difference]: Without dead ends: 441 [2024-10-24 13:05:13,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 13:05:13,516 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-24 13:05:13,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2157 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-24 13:05:13,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-24 13:05:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-10-24 13:05:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 293 states have (on average 1.3071672354948805) internal successors, (383), 301 states have internal predecessors, (383), 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-10-24 13:05:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 600 transitions. [2024-10-24 13:05:13,600 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 600 transitions. Word has length 16 [2024-10-24 13:05:13,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:05:13,603 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 600 transitions. [2024-10-24 13:05:13,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-10-24 13:05:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 600 transitions. [2024-10-24 13:05:13,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 13:05:13,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:13,604 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:13,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 13:05:13,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:13,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 732212446, now seen corresponding path program 1 times [2024-10-24 13:05:13,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252557971] [2024-10-24 13:05:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:14,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:14,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 13:05:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 13:05:14,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:14,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252557971] [2024-10-24 13:05:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252557971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:14,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 13:05:14,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929987003] [2024-10-24 13:05:14,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:14,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 13:05:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:14,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 13:05:14,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 13:05:14,337 INFO L87 Difference]: Start difference. First operand 441 states and 600 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 13:05:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:05:16,125 INFO L93 Difference]: Finished difference Result 1287 states and 1765 transitions. [2024-10-24 13:05:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 13:05:16,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 20 [2024-10-24 13:05:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:05:16,137 INFO L225 Difference]: With dead ends: 1287 [2024-10-24 13:05:16,138 INFO L226 Difference]: Without dead ends: 862 [2024-10-24 13:05:16,140 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-10-24 13:05:16,141 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 586 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 13:05:16,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 1171 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 13:05:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-10-24 13:05:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 858. [2024-10-24 13:05:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 572 states have (on average 1.3076923076923077) internal successors, (748), 584 states have internal predecessors, (748), 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-10-24 13:05:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1174 transitions. [2024-10-24 13:05:16,239 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1174 transitions. Word has length 20 [2024-10-24 13:05:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:05:16,241 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1174 transitions. [2024-10-24 13:05:16,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-24 13:05:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1174 transitions. [2024-10-24 13:05:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-24 13:05:16,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:16,243 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:16,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 13:05:16,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:16,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1223504060, now seen corresponding path program 1 times [2024-10-24 13:05:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:16,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909879870] [2024-10-24 13:05:16,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:16,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:16,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-24 13:05:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:16,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 13:05:16,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:16,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909879870] [2024-10-24 13:05:16,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909879870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:16,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:16,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 13:05:16,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206421010] [2024-10-24 13:05:16,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:16,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 13:05:16,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:16,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 13:05:16,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 13:05:16,974 INFO L87 Difference]: Start difference. First operand 858 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-10-24 13:05:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:05:18,964 INFO L93 Difference]: Finished difference Result 2539 states and 3489 transitions. [2024-10-24 13:05:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 13:05:18,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 21 [2024-10-24 13:05:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:05:18,975 INFO L225 Difference]: With dead ends: 2539 [2024-10-24 13:05:18,976 INFO L226 Difference]: Without dead ends: 1691 [2024-10-24 13:05:18,980 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-10-24 13:05:18,981 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 585 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 13:05:18,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1070 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 13:05:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-10-24 13:05:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1680. [2024-10-24 13:05:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1121 states have (on average 1.305084745762712) internal successors, (1463), 1140 states have internal predecessors, (1463), 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-10-24 13:05:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2305 transitions. [2024-10-24 13:05:19,079 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2305 transitions. Word has length 21 [2024-10-24 13:05:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:05:19,080 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2305 transitions. [2024-10-24 13:05:19,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-10-24 13:05:19,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2305 transitions. [2024-10-24 13:05:19,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 13:05:19,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:19,086 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:19,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 13:05:19,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:19,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:19,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1056657358, now seen corresponding path program 1 times [2024-10-24 13:05:19,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409392335] [2024-10-24 13:05:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 13:05:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:05:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 13:05:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 13:05:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 13:05:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:05:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 13:05:19,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:19,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409392335] [2024-10-24 13:05:19,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409392335] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:19,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:19,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 13:05:19,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187177246] [2024-10-24 13:05:19,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:19,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 13:05:19,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:19,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 13:05:19,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 13:05:19,838 INFO L87 Difference]: Start difference. First operand 1680 states and 2305 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 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-10-24 13:05:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:05:23,810 INFO L93 Difference]: Finished difference Result 4292 states and 6142 transitions. [2024-10-24 13:05:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 13:05:23,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 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 60 [2024-10-24 13:05:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:05:23,831 INFO L225 Difference]: With dead ends: 4292 [2024-10-24 13:05:23,831 INFO L226 Difference]: Without dead ends: 2623 [2024-10-24 13:05:23,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:05:23,840 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 443 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-24 13:05:23,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1406 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-24 13:05:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-10-24 13:05:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2531. [2024-10-24 13:05:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2531 states, 1720 states have (on average 1.3319767441860466) internal successors, (2291), 1755 states have internal predecessors, (2291), 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-10-24 13:05:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3645 transitions. [2024-10-24 13:05:23,981 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3645 transitions. Word has length 60 [2024-10-24 13:05:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:05:23,982 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3645 transitions. [2024-10-24 13:05:23,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 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-10-24 13:05:23,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3645 transitions. [2024-10-24 13:05:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 13:05:23,988 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:23,988 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:23,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 13:05:23,988 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:23,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:23,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1621838694, now seen corresponding path program 1 times [2024-10-24 13:05:23,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:23,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208211233] [2024-10-24 13:05:23,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:23,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 13:05:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 13:05:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:05:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:05:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 13:05:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 13:05:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 13:05:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 13:05:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:24,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208211233] [2024-10-24 13:05:24,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208211233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:24,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:24,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 13:05:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275154808] [2024-10-24 13:05:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:24,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 13:05:24,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 13:05:24,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:05:24,746 INFO L87 Difference]: Start difference. First operand 2531 states and 3645 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 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-10-24 13:05:30,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 13:05:31,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:05:31,540 INFO L93 Difference]: Finished difference Result 5146 states and 7487 transitions. [2024-10-24 13:05:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 13:05:31,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 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 64 [2024-10-24 13:05:31,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:05:31,560 INFO L225 Difference]: With dead ends: 5146 [2024-10-24 13:05:31,564 INFO L226 Difference]: Without dead ends: 2627 [2024-10-24 13:05:31,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:05:31,576 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 106 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-24 13:05:31,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 2442 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-24 13:05:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2024-10-24 13:05:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2579. [2024-10-24 13:05:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2579 states, 1762 states have (on average 1.3251986379114642) internal successors, (2335), 1799 states have internal predecessors, (2335), 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-10-24 13:05:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3711 transitions. [2024-10-24 13:05:31,783 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3711 transitions. Word has length 64 [2024-10-24 13:05:31,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:05:31,783 INFO L471 AbstractCegarLoop]: Abstraction has 2579 states and 3711 transitions. [2024-10-24 13:05:31,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 6 states have internal predecessors, (45), 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-10-24 13:05:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3711 transitions. [2024-10-24 13:05:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 13:05:31,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:31,788 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:31,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 13:05:31,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:31,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:31,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1282557075, now seen corresponding path program 1 times [2024-10-24 13:05:31,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:31,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388754804] [2024-10-24 13:05:31,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:31,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 13:05:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 13:05:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:05:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:05:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 13:05:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 13:05:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:05:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:32,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 13:05:32,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:32,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388754804] [2024-10-24 13:05:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388754804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:32,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 13:05:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913500737] [2024-10-24 13:05:32,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:32,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 13:05:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:32,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 13:05:32,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-24 13:05:32,927 INFO L87 Difference]: Start difference. First operand 2579 states and 3711 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 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-10-24 13:05:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:05:39,795 INFO L93 Difference]: Finished difference Result 3923 states and 5712 transitions. [2024-10-24 13:05:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 13:05:39,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 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) Word has length 65 [2024-10-24 13:05:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:05:39,815 INFO L225 Difference]: With dead ends: 3923 [2024-10-24 13:05:39,815 INFO L226 Difference]: Without dead ends: 2623 [2024-10-24 13:05:39,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-24 13:05:39,824 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 104 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-10-24 13:05:39,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2871 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-10-24 13:05:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-10-24 13:05:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2591. [2024-10-24 13:05:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2591 states, 1770 states have (on average 1.3225988700564972) internal successors, (2341), 1807 states have internal predecessors, (2341), 670 states have call successors, (670), 141 states have call predecessors, (670), 150 states have return successors, (718), 658 states have call predecessors, (718), 666 states have call successors, (718) [2024-10-24 13:05:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3729 transitions. [2024-10-24 13:05:39,961 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3729 transitions. Word has length 65 [2024-10-24 13:05:39,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:05:39,962 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 3729 transitions. [2024-10-24 13:05:39,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 5 states have internal predecessors, (46), 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-10-24 13:05:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3729 transitions. [2024-10-24 13:05:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 13:05:39,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:39,966 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:39,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 13:05:39,966 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:39,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash -931757138, now seen corresponding path program 1 times [2024-10-24 13:05:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892502483] [2024-10-24 13:05:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 13:05:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 13:05:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:05:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:05:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 13:05:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 13:05:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:05:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 13:05:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:40,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892502483] [2024-10-24 13:05:40,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892502483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:40,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:40,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 13:05:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546278360] [2024-10-24 13:05:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:40,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 13:05:40,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 13:05:40,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-24 13:05:40,957 INFO L87 Difference]: Start difference. First operand 2591 states and 3729 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 13:05:48,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 13:05:54,684 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 [] [2024-10-24 13:05:56,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 13:05:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:05:57,018 INFO L93 Difference]: Finished difference Result 5438 states and 7933 transitions. [2024-10-24 13:05:57,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 13:05:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 65 [2024-10-24 13:05:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:05:57,036 INFO L225 Difference]: With dead ends: 5438 [2024-10-24 13:05:57,037 INFO L226 Difference]: Without dead ends: 2859 [2024-10-24 13:05:57,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-10-24 13:05:57,046 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 162 mSDsluCounter, 4546 mSDsCounter, 0 mSdLazyCounter, 2826 mSolverCounterSat, 107 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2826 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2024-10-24 13:05:57,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 5086 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2826 Invalid, 1 Unknown, 0 Unchecked, 15.8s Time] [2024-10-24 13:05:57,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-10-24 13:05:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2595. [2024-10-24 13:05:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 1774 states have (on average 1.3196166854565952) internal successors, (2341), 1809 states have internal predecessors, (2341), 670 states have call successors, (670), 141 states have call predecessors, (670), 150 states have return successors, (718), 660 states have call predecessors, (718), 666 states have call successors, (718) [2024-10-24 13:05:57,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3729 transitions. [2024-10-24 13:05:57,168 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3729 transitions. Word has length 65 [2024-10-24 13:05:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:05:57,169 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3729 transitions. [2024-10-24 13:05:57,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 13:05:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3729 transitions. [2024-10-24 13:05:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 13:05:57,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:05:57,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:05:57,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 13:05:57,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:05:57,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:05:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash 107202000, now seen corresponding path program 1 times [2024-10-24 13:05:57,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:05:57,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997178185] [2024-10-24 13:05:57,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:05:57,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:05:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:57,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:05:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:57,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 13:05:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:57,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 13:05:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:58,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:05:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:58,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:05:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:58,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 13:05:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:58,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:05:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:58,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:05:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 13:05:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:05:58,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 13:05:58,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:05:58,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997178185] [2024-10-24 13:05:58,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997178185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:05:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:05:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 13:05:58,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980951501] [2024-10-24 13:05:58,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:05:58,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 13:05:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:05:58,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 13:05:58,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 13:05:58,151 INFO L87 Difference]: Start difference. First operand 2595 states and 3729 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 13:06:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:06:01,371 INFO L93 Difference]: Finished difference Result 4982 states and 7161 transitions. [2024-10-24 13:06:01,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 13:06:01,371 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2024-10-24 13:06:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:06:01,389 INFO L225 Difference]: With dead ends: 4982 [2024-10-24 13:06:01,389 INFO L226 Difference]: Without dead ends: 2399 [2024-10-24 13:06:01,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 13:06:01,399 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 288 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 13:06:01,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1806 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 13:06:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-24 13:06:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2371. [2024-10-24 13:06:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1626 states have (on average 1.3081180811808117) internal successors, (2127), 1645 states have internal predecessors, (2127), 594 states have call successors, (594), 139 states have call predecessors, (594), 150 states have return successors, (646), 594 states have call predecessors, (646), 590 states have call successors, (646) [2024-10-24 13:06:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3367 transitions. [2024-10-24 13:06:01,529 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3367 transitions. Word has length 74 [2024-10-24 13:06:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:06:01,530 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3367 transitions. [2024-10-24 13:06:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-24 13:06:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3367 transitions. [2024-10-24 13:06:01,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 13:06:01,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:06:01,534 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:06:01,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 13:06:01,534 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:06:01,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:06:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1700693298, now seen corresponding path program 1 times [2024-10-24 13:06:01,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:06:01,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541282525] [2024-10-24 13:06:01,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:06:01,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:06:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:06:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:06:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 13:06:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 13:06:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:06:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:06:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 13:06:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:06:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:06:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 13:06:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-24 13:06:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:06:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541282525] [2024-10-24 13:06:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541282525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:06:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:06:02,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 13:06:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437964830] [2024-10-24 13:06:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:06:02,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 13:06:02,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:06:02,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 13:06:02,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-24 13:06:02,430 INFO L87 Difference]: Start difference. First operand 2371 states and 3367 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 13:06:12,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:06:12,692 INFO L93 Difference]: Finished difference Result 3732 states and 5377 transitions. [2024-10-24 13:06:12,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 13:06:12,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 74 [2024-10-24 13:06:12,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:06:12,714 INFO L225 Difference]: With dead ends: 3732 [2024-10-24 13:06:12,714 INFO L226 Difference]: Without dead ends: 3727 [2024-10-24 13:06:12,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-10-24 13:06:12,717 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 1432 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1577 SdHoareTripleChecker+Valid, 3312 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-10-24 13:06:12,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1577 Valid, 3312 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2024-10-24 13:06:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2024-10-24 13:06:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3665. [2024-10-24 13:06:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 2513 states have (on average 1.3115797851173896) internal successors, (3296), 2548 states have internal predecessors, (3296), 924 states have call successors, (924), 207 states have call predecessors, (924), 227 states have return successors, (1046), 925 states have call predecessors, (1046), 920 states have call successors, (1046) [2024-10-24 13:06:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5266 transitions. [2024-10-24 13:06:12,899 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5266 transitions. Word has length 74 [2024-10-24 13:06:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:06:12,899 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 5266 transitions. [2024-10-24 13:06:12,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 6 states have internal predecessors, (49), 6 states have call successors, (11), 6 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-24 13:06:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5266 transitions. [2024-10-24 13:06:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 13:06:12,906 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:06:12,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 13:06:12,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 13:06:12,907 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:06:12,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:06:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1089116023, now seen corresponding path program 1 times [2024-10-24 13:06:12,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:06:12,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718970855] [2024-10-24 13:06:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:06:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:06:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:06:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:06:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 13:06:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 13:06:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:06:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-24 13:06:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 13:06:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:06:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 13:06:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 13:06:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 13:06:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 13:06:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 13:06:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 13:06:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:06:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 13:06:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:06:13,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718970855] [2024-10-24 13:06:13,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718970855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:06:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:06:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 13:06:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784031359] [2024-10-24 13:06:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:06:13,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 13:06:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:06:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 13:06:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-24 13:06:13,925 INFO L87 Difference]: Start difference. First operand 3665 states and 5266 transitions. Second operand has 13 states, 12 states have (on average 4.666666666666667) internal successors, (56), 7 states have internal predecessors, (56), 3 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)