./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 14:50:59,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:50:59,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 14:50:59,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:50:59,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:50:59,734 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:50:59,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:50:59,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:50:59,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:50:59,737 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:50:59,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:50:59,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:50:59,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:50:59,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:50:59,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:50:59,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:50:59,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:50:59,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:50:59,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:50:59,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:50:59,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:50:59,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:50:59,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:50:59,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:50:59,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:50:59,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:50:59,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:50:59,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:50:59,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:50:59,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:50:59,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:50:59,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:50:59,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:50:59,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:50:59,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:50:59,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:50:59,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:50:59,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:50:59,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:50:59,757 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-clean/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-clean/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-11 14:50:59,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:50:59,994 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:50:59,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:50:59,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:50:59,998 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:50:59,998 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-11 14:51:01,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:51:01,769 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:51:01,770 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-11 14:51:01,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a9d17fba/9436a9155a364b189f6c84857205fd38/FLAGab96fd618 [2024-10-11 14:51:01,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4a9d17fba/9436a9155a364b189f6c84857205fd38 [2024-10-11 14:51:01,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:51:01,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:51:01,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:51:01,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:51:01,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:51:01,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:51:01" (1/1) ... [2024-10-11 14:51:01,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d641490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:01, skipping insertion in model container [2024-10-11 14:51:01,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:51:01" (1/1) ... [2024-10-11 14:51:02,101 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:51:03,203 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-11 14:51:03,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:51:03,265 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:51:03,389 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-11 14:51:03,392 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-11 14:51:03,393 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-11 14:51:03,395 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-11 14:51:03,395 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-11 14:51:03,451 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-11 14:51:03,512 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-11 14:51:03,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:51:03,658 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:51:03,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03 WrapperNode [2024-10-11 14:51:03,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:51:03,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:51:03,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:51:03,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:51:03,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:03,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:03,802 INFO L138 Inliner]: procedures = 133, calls = 778, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1572 [2024-10-11 14:51:03,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:51:03,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:51:03,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:51:03,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:51:03,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:03,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:03,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:03,982 INFO L175 MemorySlicer]: Split 337 memory accesses to 8 slices as follows [2, 3, 8, 8, 8, 10, 258, 40]. 77 percent of accesses are in the largest equivalence class. The 152 initializations are split as follows [2, 0, 8, 8, 8, 0, 86, 40]. The 91 writes are split as follows [0, 0, 0, 0, 0, 0, 91, 0]. [2024-10-11 14:51:03,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:03,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:04,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:04,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:04,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:04,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:04,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:51:04,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:51:04,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:51:04,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:51:04,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (1/1) ... [2024-10-11 14:51:04,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:51:04,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:51:04,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:51:04,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:51:04,171 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-10-11 14:51:04,173 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-10-11 14:51:04,173 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2024-10-11 14:51:04,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-11 14:51:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2024-10-11 14:51:04,175 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2024-10-11 14:51:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-11 14:51:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-11 14:51:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-11 14:51:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-11 14:51:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-11 14:51:04,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-11 14:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2024-10-11 14:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-11 14:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 14:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 14:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2024-10-11 14:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-10-11 14:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 14:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-10-11 14:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 14:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 14:51:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 14:51:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2024-10-11 14:51:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2024-10-11 14:51:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2024-10-11 14:51:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2024-10-11 14:51:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2024-10-11 14:51:04,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2024-10-11 14:51:04,179 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-11 14:51:04,181 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-11 14:51:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2024-10-11 14:51:04,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2024-10-11 14:51:04,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:51:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2024-10-11 14:51:04,182 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2024-10-11 14:51:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:51:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2024-10-11 14:51:04,182 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2024-10-11 14:51:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 14:51:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 14:51:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 14:51:04,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 14:51:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 14:51:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 14:51:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 14:51:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 14:51:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 14:51:04,183 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2024-10-11 14:51:04,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2024-10-11 14:51:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-10-11 14:51:04,184 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-10-11 14:51:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-10-11 14:51:04,184 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 14:51:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-10-11 14:51:04,185 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-10-11 14:51:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2024-10-11 14:51:04,186 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2024-10-11 14:51:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-10-11 14:51:04,186 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-10-11 14:51:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2024-10-11 14:51:04,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2024-10-11 14:51:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 14:51:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 14:51:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 14:51:04,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 14:51:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 14:51:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 14:51:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 14:51:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 14:51:04,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 14:51:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2024-10-11 14:51:04,189 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2024-10-11 14:51:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 14:51:04,189 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 14:51:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2024-10-11 14:51:04,189 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2024-10-11 14:51:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-10-11 14:51:04,189 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-10-11 14:51:04,189 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-11 14:51:04,189 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-11 14:51:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-10-11 14:51:04,190 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-10-11 14:51:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2024-10-11 14:51:04,190 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2024-10-11 14:51:04,190 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-11 14:51:04,191 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-11 14:51:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2024-10-11 14:51:04,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2024-10-11 14:51:04,191 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-10-11 14:51:04,191 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-10-11 14:51:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure dev_warn [2024-10-11 14:51:04,192 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_warn [2024-10-11 14:51:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:51:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:51:04,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:51:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 14:51:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 14:51:04,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-10-11 14:51:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2024-10-11 14:51:04,194 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-11 14:51:04,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-11 14:51:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-11 14:51:04,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:51:04,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:51:04,551 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:51:04,554 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:51:04,689 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2024-10-11 14:51:04,874 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 14:51:05,660 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2024-10-11 14:51:05,660 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2024-10-11 14:51:05,841 INFO L? ?]: Removed 601 outVars from TransFormulas that were not future-live. [2024-10-11 14:51:05,841 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:51:05,962 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:51:05,962 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-11 14:51:05,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:51:05 BoogieIcfgContainer [2024-10-11 14:51:05,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:51:05,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:51:05,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:51:05,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:51:05,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:51:01" (1/3) ... [2024-10-11 14:51:05,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3862c0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:51:05, skipping insertion in model container [2024-10-11 14:51:05,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:03" (2/3) ... [2024-10-11 14:51:05,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3862c0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:51:05, skipping insertion in model container [2024-10-11 14:51:05,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:51:05" (3/3) ... [2024-10-11 14:51:05,973 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2024-10-11 14:51:05,990 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:51:05,991 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:51:06,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:51:06,072 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;@3808a1d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:51:06,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:51:06,082 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-11 14:51:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 14:51:06,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:06,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:06,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:06,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:06,094 INFO L85 PathProgramCache]: Analyzing trace with hash -216078356, now seen corresponding path program 1 times [2024-10-11 14:51:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884518063] [2024-10-11 14:51:06,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:06,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:06,999 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-11 14:51:06,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:07,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884518063] [2024-10-11 14:51:07,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884518063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:07,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:07,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:51:07,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910542936] [2024-10-11 14:51:07,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:51:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:07,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:51:07,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:51:07,057 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-11 14:51:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:09,289 INFO L93 Difference]: Finished difference Result 879 states and 1293 transitions. [2024-10-11 14:51:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:51:09,293 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-11 14:51:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:09,310 INFO L225 Difference]: With dead ends: 879 [2024-10-11 14:51:09,310 INFO L226 Difference]: Without dead ends: 441 [2024-10-11 14:51:09,316 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-11 14:51:09,318 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:09,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2157 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 14:51:09,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-11 14:51:09,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2024-10-11 14:51:09,400 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-11 14:51:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 600 transitions. [2024-10-11 14:51:09,407 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 600 transitions. Word has length 16 [2024-10-11 14:51:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 600 transitions. [2024-10-11 14:51:09,408 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-11 14:51:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 600 transitions. [2024-10-11 14:51:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 14:51:09,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:09,410 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-11 14:51:09,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:51:09,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash 732212446, now seen corresponding path program 1 times [2024-10-11 14:51:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871189316] [2024-10-11 14:51:09,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:09,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 14:51:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:09,927 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-11 14:51:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871189316] [2024-10-11 14:51:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871189316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:09,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:09,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:51:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434594687] [2024-10-11 14:51:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:09,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:51:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:09,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:51:09,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:51:09,929 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-11 14:51:11,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:11,172 INFO L93 Difference]: Finished difference Result 1287 states and 1765 transitions. [2024-10-11 14:51:11,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:51:11,174 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-11 14:51:11,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:11,186 INFO L225 Difference]: With dead ends: 1287 [2024-10-11 14:51:11,186 INFO L226 Difference]: Without dead ends: 862 [2024-10-11 14:51:11,187 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-11 14:51:11,194 INFO L432 NwaCegarLoop]: 657 mSDtfsCounter, 586 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:11,194 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.2s Time] [2024-10-11 14:51:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2024-10-11 14:51:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 858. [2024-10-11 14:51:11,292 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-11 14:51:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1174 transitions. [2024-10-11 14:51:11,305 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1174 transitions. Word has length 20 [2024-10-11 14:51:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:11,305 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1174 transitions. [2024-10-11 14:51:11,305 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-11 14:51:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1174 transitions. [2024-10-11 14:51:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 14:51:11,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:11,306 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-11 14:51:11,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:51:11,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:11,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1223504060, now seen corresponding path program 1 times [2024-10-11 14:51:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:11,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54936239] [2024-10-11 14:51:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:11,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:11,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 14:51:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:11,778 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-11 14:51:11,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:11,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54936239] [2024-10-11 14:51:11,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54936239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:11,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:11,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:51:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853677225] [2024-10-11 14:51:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:51:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:51:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:51:11,781 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-11 14:51:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:12,880 INFO L93 Difference]: Finished difference Result 2539 states and 3489 transitions. [2024-10-11 14:51:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:51:12,881 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-11 14:51:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:12,900 INFO L225 Difference]: With dead ends: 2539 [2024-10-11 14:51:12,900 INFO L226 Difference]: Without dead ends: 1691 [2024-10-11 14:51:12,907 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-11 14:51:12,912 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 585 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:12,912 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.0s Time] [2024-10-11 14:51:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-10-11 14:51:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1680. [2024-10-11 14:51:13,035 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-11 14:51:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2305 transitions. [2024-10-11 14:51:13,049 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2305 transitions. Word has length 21 [2024-10-11 14:51:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:13,049 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2305 transitions. [2024-10-11 14:51:13,050 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-11 14:51:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2305 transitions. [2024-10-11 14:51:13,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 14:51:13,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:13,056 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-11 14:51:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:51:13,057 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:13,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:13,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1056657358, now seen corresponding path program 1 times [2024-10-11 14:51:13,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:13,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977279212] [2024-10-11 14:51:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:13,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 14:51:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 14:51:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 14:51:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 14:51:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:51:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 14:51:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:13,916 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-11 14:51:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977279212] [2024-10-11 14:51:13,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977279212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:13,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:13,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:51:13,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061494539] [2024-10-11 14:51:13,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:51:13,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:13,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:51:13,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:51:13,918 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-11 14:51:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:16,749 INFO L93 Difference]: Finished difference Result 4292 states and 6142 transitions. [2024-10-11 14:51:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:51:16,750 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-11 14:51:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:16,762 INFO L225 Difference]: With dead ends: 4292 [2024-10-11 14:51:16,763 INFO L226 Difference]: Without dead ends: 2623 [2024-10-11 14:51:16,768 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-11 14:51:16,771 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 443 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:16,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1406 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 14:51:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-10-11 14:51:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2531. [2024-10-11 14:51:16,856 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-11 14:51:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2531 states to 2531 states and 3645 transitions. [2024-10-11 14:51:16,866 INFO L78 Accepts]: Start accepts. Automaton has 2531 states and 3645 transitions. Word has length 60 [2024-10-11 14:51:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:16,867 INFO L471 AbstractCegarLoop]: Abstraction has 2531 states and 3645 transitions. [2024-10-11 14:51:16,867 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-11 14:51:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 2531 states and 3645 transitions. [2024-10-11 14:51:16,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 14:51:16,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:16,871 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-11 14:51:16,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:51:16,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:16,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:16,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1621838694, now seen corresponding path program 1 times [2024-10-11 14:51:16,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995122555] [2024-10-11 14:51:16,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:51:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 14:51:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:51:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 14:51:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 14:51:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:17,584 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-11 14:51:17,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:17,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995122555] [2024-10-11 14:51:17,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995122555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:17,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:17,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601520881] [2024-10-11 14:51:17,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:17,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:17,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:17,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:17,588 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-11 14:51:22,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:51:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:23,742 INFO L93 Difference]: Finished difference Result 5146 states and 7487 transitions. [2024-10-11 14:51:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:51:23,742 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-11 14:51:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:23,756 INFO L225 Difference]: With dead ends: 5146 [2024-10-11 14:51:23,756 INFO L226 Difference]: Without dead ends: 2627 [2024-10-11 14:51:23,763 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-11 14:51:23,764 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 106 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 2428 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.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:23,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 2428 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-10-11 14:51:23,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2024-10-11 14:51:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2579. [2024-10-11 14:51:23,840 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-11 14:51:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2579 states to 2579 states and 3711 transitions. [2024-10-11 14:51:23,852 INFO L78 Accepts]: Start accepts. Automaton has 2579 states and 3711 transitions. Word has length 64 [2024-10-11 14:51:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:23,853 INFO L471 AbstractCegarLoop]: Abstraction has 2579 states and 3711 transitions. [2024-10-11 14:51:23,853 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-11 14:51:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2579 states and 3711 transitions. [2024-10-11 14:51:23,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 14:51:23,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:23,858 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-11 14:51:23,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:51:23,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1282557075, now seen corresponding path program 1 times [2024-10-11 14:51:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:23,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665550238] [2024-10-11 14:51:23,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:23,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:51:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:51:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 14:51:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 14:51:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:51:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:24,836 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-11 14:51:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:24,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665550238] [2024-10-11 14:51:24,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665550238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:24,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:51:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300163930] [2024-10-11 14:51:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:24,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:51:24,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:24,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:51:24,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:51:24,838 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-11 14:51:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:30,417 INFO L93 Difference]: Finished difference Result 3923 states and 5712 transitions. [2024-10-11 14:51:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:51:30,418 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-11 14:51:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:30,431 INFO L225 Difference]: With dead ends: 3923 [2024-10-11 14:51:30,431 INFO L226 Difference]: Without dead ends: 2623 [2024-10-11 14:51:30,436 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-11 14:51:30,437 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 104 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2863 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:30,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 2863 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 14:51:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2024-10-11 14:51:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2591. [2024-10-11 14:51:30,517 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-11 14:51:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 3729 transitions. [2024-10-11 14:51:30,528 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 3729 transitions. Word has length 65 [2024-10-11 14:51:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:30,529 INFO L471 AbstractCegarLoop]: Abstraction has 2591 states and 3729 transitions. [2024-10-11 14:51:30,530 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-11 14:51:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 3729 transitions. [2024-10-11 14:51:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 14:51:30,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:30,533 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-11 14:51:30,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:51:30,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:30,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -931757138, now seen corresponding path program 1 times [2024-10-11 14:51:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:30,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359021384] [2024-10-11 14:51:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:30,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:51:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:51:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 14:51:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 14:51:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 14:51:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:31,383 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-11 14:51:31,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:31,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359021384] [2024-10-11 14:51:31,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359021384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:31,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:31,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:51:31,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204861224] [2024-10-11 14:51:31,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:31,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:51:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:31,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:51:31,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:51:31,387 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-11 14:51:41,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:51:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:41,569 INFO L93 Difference]: Finished difference Result 5438 states and 7933 transitions. [2024-10-11 14:51:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 14:51:41,570 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-11 14:51:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:41,582 INFO L225 Difference]: With dead ends: 5438 [2024-10-11 14:51:41,582 INFO L226 Difference]: Without dead ends: 2859 [2024-10-11 14:51:41,588 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-11 14:51:41,588 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 162 mSDsluCounter, 4546 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 5086 SdHoareTripleChecker+Invalid, 2934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:41,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 5086 Invalid, 2934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2024-10-11 14:51:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-10-11 14:51:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2595. [2024-10-11 14:51:41,661 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-11 14:51:41,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3729 transitions. [2024-10-11 14:51:41,670 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3729 transitions. Word has length 65 [2024-10-11 14:51:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:41,671 INFO L471 AbstractCegarLoop]: Abstraction has 2595 states and 3729 transitions. [2024-10-11 14:51:41,671 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-11 14:51:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3729 transitions. [2024-10-11 14:51:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 14:51:41,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:41,674 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-11 14:51:41,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:51:41,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:41,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 107202000, now seen corresponding path program 1 times [2024-10-11 14:51:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247395831] [2024-10-11 14:51:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:51:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:51:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 14:51:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:51:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:42,327 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-11 14:51:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247395831] [2024-10-11 14:51:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247395831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:51:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908962673] [2024-10-11 14:51:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:42,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:51:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:42,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:51:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:51:42,332 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-11 14:51:47,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:51:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:47,726 INFO L93 Difference]: Finished difference Result 4982 states and 7161 transitions. [2024-10-11 14:51:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:51:47,726 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-11 14:51:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:47,738 INFO L225 Difference]: With dead ends: 4982 [2024-10-11 14:51:47,738 INFO L226 Difference]: Without dead ends: 2399 [2024-10-11 14:51:47,744 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-11 14:51:47,744 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 288 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:47,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1811 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 14:51:47,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2399 states. [2024-10-11 14:51:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2399 to 2371. [2024-10-11 14:51:47,812 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-11 14:51:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3367 transitions. [2024-10-11 14:51:47,820 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3367 transitions. Word has length 74 [2024-10-11 14:51:47,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:47,821 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3367 transitions. [2024-10-11 14:51:47,821 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-11 14:51:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3367 transitions. [2024-10-11 14:51:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 14:51:47,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:47,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:51:47,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:51:47,823 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:47,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:47,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1216923859, now seen corresponding path program 1 times [2024-10-11 14:51:47,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:47,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037259797] [2024-10-11 14:51:47,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:47,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:51:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 14:51:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:51:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:51:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:51:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:48,738 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-11 14:51:48,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037259797] [2024-10-11 14:51:48,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037259797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:48,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:48,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:51:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110258090] [2024-10-11 14:51:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:48,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:51:48,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:48,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:51:48,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:51:48,741 INFO L87 Difference]: Start difference. First operand 2371 states and 3367 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 6 states have internal predecessors, (57), 6 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-11 14:51:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:51:56,899 INFO L93 Difference]: Finished difference Result 3732 states and 5377 transitions. [2024-10-11 14:51:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 14:51:56,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 6 states have internal predecessors, (57), 6 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 88 [2024-10-11 14:51:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:51:56,917 INFO L225 Difference]: With dead ends: 3732 [2024-10-11 14:51:56,917 INFO L226 Difference]: Without dead ends: 3727 [2024-10-11 14:51:56,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2024-10-11 14:51:56,920 INFO L432 NwaCegarLoop]: 668 mSDtfsCounter, 2236 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 1428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2380 SdHoareTripleChecker+Valid, 2439 SdHoareTripleChecker+Invalid, 3426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1428 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:51:56,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2380 Valid, 2439 Invalid, 3426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1428 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2024-10-11 14:51:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2024-10-11 14:51:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3665. [2024-10-11 14:51:57,064 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-11 14:51:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5266 transitions. [2024-10-11 14:51:57,079 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5266 transitions. Word has length 88 [2024-10-11 14:51:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:51:57,080 INFO L471 AbstractCegarLoop]: Abstraction has 3665 states and 5266 transitions. [2024-10-11 14:51:57,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 6 states have internal predecessors, (57), 6 states have call successors, (14), 7 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-11 14:51:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5266 transitions. [2024-10-11 14:51:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 14:51:57,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:51:57,085 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-11 14:51:57,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:51:57,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:51:57,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:51:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1089116023, now seen corresponding path program 1 times [2024-10-11 14:51:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:51:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404145611] [2024-10-11 14:51:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:51:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:51:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:51:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 14:51:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:51:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:51:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:51:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:51:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:51:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:51:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 14:51:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 14:51:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:51:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 14:51:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:51:57,802 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-11 14:51:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:51:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404145611] [2024-10-11 14:51:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404145611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:51:57,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:51:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 14:51:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879351879] [2024-10-11 14:51:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:51:57,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 14:51:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:51:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 14:51:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-11 14:51:57,804 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) [2024-10-11 14:52:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:06,392 INFO L93 Difference]: Finished difference Result 7013 states and 10225 transitions. [2024-10-11 14:52:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 14:52:06,396 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 85 [2024-10-11 14:52:06,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:06,422 INFO L225 Difference]: With dead ends: 7013 [2024-10-11 14:52:06,423 INFO L226 Difference]: Without dead ends: 4407 [2024-10-11 14:52:06,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:52:06,430 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 272 mSDsluCounter, 4346 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 4928 SdHoareTripleChecker+Invalid, 2910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:06,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 4928 Invalid, 2910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-10-11 14:52:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4407 states. [2024-10-11 14:52:06,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4407 to 3681. [2024-10-11 14:52:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 2529 states have (on average 1.309608540925267) internal successors, (3312), 2556 states have internal predecessors, (3312), 924 states have call successors, (924), 207 states have call predecessors, (924), 227 states have return successors, (1046), 933 states have call predecessors, (1046), 920 states have call successors, (1046) [2024-10-11 14:52:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 5282 transitions. [2024-10-11 14:52:06,632 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 5282 transitions. Word has length 85 [2024-10-11 14:52:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:06,633 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 5282 transitions. [2024-10-11 14:52:06,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-10-11 14:52:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 5282 transitions. [2024-10-11 14:52:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 14:52:06,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:06,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:52:06,636 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:06,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1270148139, now seen corresponding path program 1 times [2024-10-11 14:52:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:06,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279915744] [2024-10-11 14:52:06,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 14:52:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 14:52:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:52:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 14:52:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:52:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:52:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:52:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 14:52:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:07,277 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-11 14:52:07,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:07,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279915744] [2024-10-11 14:52:07,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279915744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:07,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:07,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 14:52:07,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350034991] [2024-10-11 14:52:07,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:07,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 14:52:07,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 14:52:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:52:07,279 INFO L87 Difference]: Start difference. First operand 3681 states and 5282 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:52:11,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:11,433 INFO L93 Difference]: Finished difference Result 6766 states and 9755 transitions. [2024-10-11 14:52:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:52:11,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 88 [2024-10-11 14:52:11,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:11,446 INFO L225 Difference]: With dead ends: 6766 [2024-10-11 14:52:11,446 INFO L226 Difference]: Without dead ends: 3097 [2024-10-11 14:52:11,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:52:11,454 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 277 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:11,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 2040 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 14:52:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3097 states. [2024-10-11 14:52:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3097 to 3071. [2024-10-11 14:52:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2112 states have (on average 1.3082386363636365) internal successors, (2763), 2138 states have internal predecessors, (2763), 773 states have call successors, (773), 168 states have call predecessors, (773), 185 states have return successors, (879), 780 states have call predecessors, (879), 769 states have call successors, (879) [2024-10-11 14:52:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4415 transitions. [2024-10-11 14:52:11,550 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4415 transitions. Word has length 88 [2024-10-11 14:52:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:11,551 INFO L471 AbstractCegarLoop]: Abstraction has 3071 states and 4415 transitions. [2024-10-11 14:52:11,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:52:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4415 transitions. [2024-10-11 14:52:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 14:52:11,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:11,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:11,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:52:11,553 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:11,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2029252471, now seen corresponding path program 1 times [2024-10-11 14:52:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:11,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759656746] [2024-10-11 14:52:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:11,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:11,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:52:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 14:52:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:52:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 14:52:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 14:52:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 14:52:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 14:52:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 14:52:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 14:52:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:52:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759656746] [2024-10-11 14:52:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759656746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:12,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:12,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:52:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770149147] [2024-10-11 14:52:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:52:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:12,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:52:12,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:52:12,057 INFO L87 Difference]: Start difference. First operand 3071 states and 4415 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:52:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:16,272 INFO L93 Difference]: Finished difference Result 6222 states and 8968 transitions. [2024-10-11 14:52:16,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:52:16,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 84 [2024-10-11 14:52:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:16,285 INFO L225 Difference]: With dead ends: 6222 [2024-10-11 14:52:16,285 INFO L226 Difference]: Without dead ends: 3156 [2024-10-11 14:52:16,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:52:16,295 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 208 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:16,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1611 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 14:52:16,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2024-10-11 14:52:16,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3077. [2024-10-11 14:52:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 2115 states have (on average 1.3073286052009456) internal successors, (2765), 2143 states have internal predecessors, (2765), 774 states have call successors, (774), 170 states have call predecessors, (774), 187 states have return successors, (880), 779 states have call predecessors, (880), 770 states have call successors, (880) [2024-10-11 14:52:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4419 transitions. [2024-10-11 14:52:16,515 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4419 transitions. Word has length 84 [2024-10-11 14:52:16,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:16,519 INFO L471 AbstractCegarLoop]: Abstraction has 3077 states and 4419 transitions. [2024-10-11 14:52:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:52:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4419 transitions. [2024-10-11 14:52:16,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 14:52:16,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:16,521 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:16,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 14:52:16,521 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:16,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1041232481, now seen corresponding path program 1 times [2024-10-11 14:52:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124420462] [2024-10-11 14:52:16,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:52:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 14:52:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 14:52:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 14:52:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 14:52:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 14:52:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:52:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:52:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 14:52:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 14:52:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 14:52:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 14:52:17,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:17,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124420462] [2024-10-11 14:52:17,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124420462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:52:17,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531477329] [2024-10-11 14:52:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:17,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:52:17,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:52:17,343 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:52:17,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:52:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:18,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 1393 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 14:52:18,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:52:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 14:52:18,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:52:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531477329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:18,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 14:52:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 14:52:18,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920328285] [2024-10-11 14:52:18,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:18,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:52:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:18,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:52:18,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:52:18,147 INFO L87 Difference]: Start difference. First operand 3077 states and 4419 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:52:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:19,214 INFO L93 Difference]: Finished difference Result 6152 states and 8838 transitions. [2024-10-11 14:52:19,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:52:19,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-10-11 14:52:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:19,248 INFO L225 Difference]: With dead ends: 6152 [2024-10-11 14:52:19,248 INFO L226 Difference]: Without dead ends: 3087 [2024-10-11 14:52:19,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:52:19,271 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:19,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1066 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 14:52:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2024-10-11 14:52:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 3087. [2024-10-11 14:52:19,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3087 states, 2125 states have (on average 1.3058823529411765) internal successors, (2775), 2153 states have internal predecessors, (2775), 774 states have call successors, (774), 170 states have call predecessors, (774), 187 states have return successors, (880), 779 states have call predecessors, (880), 770 states have call successors, (880) [2024-10-11 14:52:19,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3087 states to 3087 states and 4429 transitions. [2024-10-11 14:52:19,464 INFO L78 Accepts]: Start accepts. Automaton has 3087 states and 4429 transitions. Word has length 90 [2024-10-11 14:52:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:19,464 INFO L471 AbstractCegarLoop]: Abstraction has 3087 states and 4429 transitions. [2024-10-11 14:52:19,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 14:52:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3087 states and 4429 transitions. [2024-10-11 14:52:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 14:52:19,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:19,466 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:19,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:52:19,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 14:52:19,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:19,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1304607446, now seen corresponding path program 1 times [2024-10-11 14:52:19,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:19,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851862014] [2024-10-11 14:52:19,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:52:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:52:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:52:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 14:52:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:52:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:52:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:20,296 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-11 14:52:20,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851862014] [2024-10-11 14:52:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851862014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:20,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 14:52:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782720068] [2024-10-11 14:52:20,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:20,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 14:52:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:20,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 14:52:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 14:52:20,298 INFO L87 Difference]: Start difference. First operand 3087 states and 4429 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 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-11 14:52:25,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 14:52:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:52:27,192 INFO L93 Difference]: Finished difference Result 5555 states and 7988 transitions. [2024-10-11 14:52:27,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:52:27,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 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 82 [2024-10-11 14:52:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:52:27,210 INFO L225 Difference]: With dead ends: 5555 [2024-10-11 14:52:27,214 INFO L226 Difference]: Without dead ends: 2917 [2024-10-11 14:52:27,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:52:27,229 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 190 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-10-11 14:52:27,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 2317 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2024-10-11 14:52:27,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2917 states. [2024-10-11 14:52:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2917 to 2883. [2024-10-11 14:52:27,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2883 states, 1987 states have (on average 1.2959235027679918) internal successors, (2575), 2001 states have internal predecessors, (2575), 710 states have call successors, (710), 168 states have call predecessors, (710), 185 states have return successors, (812), 725 states have call predecessors, (812), 706 states have call successors, (812) [2024-10-11 14:52:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 4097 transitions. [2024-10-11 14:52:27,429 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 4097 transitions. Word has length 82 [2024-10-11 14:52:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:52:27,430 INFO L471 AbstractCegarLoop]: Abstraction has 2883 states and 4097 transitions. [2024-10-11 14:52:27,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 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-11 14:52:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 4097 transitions. [2024-10-11 14:52:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 14:52:27,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:52:27,435 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:52:27,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:52:27,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:52:27,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:52:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash -772601897, now seen corresponding path program 1 times [2024-10-11 14:52:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:52:27,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803475550] [2024-10-11 14:52:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:52:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:52:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 14:52:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 14:52:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 14:52:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:52:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 14:52:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 14:52:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 14:52:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 14:52:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:52:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 14:52:28,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:52:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803475550] [2024-10-11 14:52:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803475550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:52:28,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:52:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 14:52:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294705084] [2024-10-11 14:52:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:52:28,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 14:52:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:52:28,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 14:52:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:52:28,230 INFO L87 Difference]: Start difference. First operand 2883 states and 4097 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10)