./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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 08:01:43,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 08:01:43,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-13 08:01:43,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 08:01:43,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 08:01:43,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 08:01:43,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 08:01:43,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 08:01:43,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 08:01:43,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 08:01:43,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 08:01:43,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 08:01:43,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 08:01:43,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 08:01:43,771 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 08:01:43,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 08:01:43,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 08:01:43,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 08:01:43,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 08:01:43,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 08:01:43,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 08:01:43,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 08:01:43,776 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 08:01:43,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 08:01:43,776 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 08:01:43,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 08:01:43,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 08:01:43,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 08:01:43,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 08:01:43,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 08:01:43,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 08:01:43,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 08:01:43,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 08:01:43,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 08:01:43,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 08:01:43,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 08:01:43,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 08:01:43,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 08:01:43,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 08:01:43,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83293f5c81ac30df7449dd9c03263a4edbba62be916a9a4fda92d2518792b8d4 [2024-10-13 08:01:43,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 08:01:44,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 08:01:44,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 08:01:44,027 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 08:01:44,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 08:01:44,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2024-10-13 08:01:45,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 08:01:45,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 08:01:45,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2024-10-13 08:01:45,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834776985/312b78864f874af3b6d9fc32881835c8/FLAG4f73eddaf [2024-10-13 08:01:45,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834776985/312b78864f874af3b6d9fc32881835c8 [2024-10-13 08:01:45,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 08:01:45,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 08:01:45,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 08:01:45,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 08:01:45,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 08:01:45,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:01:45" (1/1) ... [2024-10-13 08:01:45,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e27e964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:45, skipping insertion in model container [2024-10-13 08:01:45,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:01:45" (1/1) ... [2024-10-13 08:01:46,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 08:01:46,800 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2024-10-13 08:01:47,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 08:01:47,172 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 08:01:47,255 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [5402] [2024-10-13 08:01:47,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; bts %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5440] [2024-10-13 08:01:47,258 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %1,%0": "+m" (*((long volatile *)addr)): "Ir" (nr)); [5447] [2024-10-13 08:01:47,259 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; btr %2,%1\n\tsbb %0,%0": "=r" (oldbit), "+m" (*((long volatile *)addr)): "Ir" (nr): "memory"); [5455-5456] [2024-10-13 08:01:47,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; incl %0": "+m" (v->counter)); [5484] [2024-10-13 08:01:47,261 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile (".pushsection .smp_locks,\"a\"\n.balign 4\n.long 671f - .\n.popsection\n671:\n\tlock; decl %0": "+m" (v->counter)); [5491] [2024-10-13 08:01:47,270 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i[163669,163682] [2024-10-13 08:01:47,311 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6228/dscv_tempdir/dscv/ri/144_2a/drivers/net/can/usb/usb_8dev.o.c.prepared"), "i" (621), "i" (12UL)); [6324-6325] [2024-10-13 08:01:47,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 08:01:47,505 INFO L204 MainTranslator]: Completed translation [2024-10-13 08:01:47,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47 WrapperNode [2024-10-13 08:01:47,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 08:01:47,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 08:01:47,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 08:01:47,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 08:01:47,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:47,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:47,682 INFO L138 Inliner]: procedures = 175, calls = 824, calls flagged for inlining = 87, calls inlined = 87, statements flattened = 2645 [2024-10-13 08:01:47,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 08:01:47,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 08:01:47,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 08:01:47,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 08:01:47,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:47,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:47,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,005 INFO L175 MemorySlicer]: Split 455 memory accesses to 8 slices as follows [31, 2, 334, 9, 1, 42, 31, 5]. 73 percent of accesses are in the largest equivalence class. The 124 initializations are split as follows [0, 2, 80, 0, 0, 42, 0, 0]. The 144 writes are split as follows [0, 0, 125, 0, 0, 0, 18, 1]. [2024-10-13 08:01:48,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 08:01:48,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 08:01:48,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 08:01:48,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 08:01:48,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (1/1) ... [2024-10-13 08:01:48,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 08:01:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 08:01:48,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 08:01:48,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 08:01:48,220 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2024-10-13 08:01:48,221 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2024-10-13 08:01:48,221 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2024-10-13 08:01:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2024-10-13 08:01:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2024-10-13 08:01:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2024-10-13 08:01:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_15 [2024-10-13 08:01:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_15 [2024-10-13 08:01:48,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-13 08:01:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-13 08:01:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-10-13 08:01:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-10-13 08:01:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-10-13 08:01:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-10-13 08:01:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-10-13 08:01:48,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-10-13 08:01:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2024-10-13 08:01:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2024-10-13 08:01:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2024-10-13 08:01:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2024-10-13 08:01:48,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2024-10-13 08:01:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2024-10-13 08:01:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2024-10-13 08:01:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2024-10-13 08:01:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2024-10-13 08:01:48,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2024-10-13 08:01:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-10-13 08:01:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-10-13 08:01:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-10-13 08:01:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-10-13 08:01:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-10-13 08:01:48,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2024-10-13 08:01:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-13 08:01:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 08:01:48,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 08:01:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 08:01:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 08:01:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-13 08:01:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-13 08:01:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2024-10-13 08:01:48,228 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2024-10-13 08:01:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_present [2024-10-13 08:01:48,228 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_present [2024-10-13 08:01:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2024-10-13 08:01:48,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#0 [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#1 [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#2 [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#3 [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#4 [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#5 [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#6 [2024-10-13 08:01:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy#7 [2024-10-13 08:01:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#0 [2024-10-13 08:01:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#1 [2024-10-13 08:01:48,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#2 [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#3 [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#4 [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#5 [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#6 [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy#7 [2024-10-13 08:01:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2024-10-13 08:01:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-13 08:01:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2024-10-13 08:01:48,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_read_bulk_callback [2024-10-13 08:01:48,232 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_read_bulk_callback [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2024-10-13 08:01:48,232 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2024-10-13 08:01:48,232 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-13 08:01:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-13 08:01:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-13 08:01:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-10-13 08:01:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2024-10-13 08:01:48,233 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 08:01:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 08:01:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 08:01:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-10-13 08:01:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-10-13 08:01:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-10-13 08:01:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-10-13 08:01:48,234 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2024-10-13 08:01:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 08:01:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 08:01:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2024-10-13 08:01:48,236 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2024-10-13 08:01:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 08:01:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_err [2024-10-13 08:01:48,237 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_err [2024-10-13 08:01:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2024-10-13 08:01:48,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2024-10-13 08:01:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2024-10-13 08:01:48,237 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2024-10-13 08:01:48,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 08:01:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 08:01:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-13 08:01:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-13 08:01:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-13 08:01:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 08:01:48,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-13 08:01:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2024-10-13 08:01:48,240 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2024-10-13 08:01:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2024-10-13 08:01:48,240 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2024-10-13 08:01:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 08:01:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 08:01:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 08:01:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 08:01:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 08:01:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-13 08:01:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-13 08:01:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-13 08:01:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2024-10-13 08:01:48,242 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure netif_rx [2024-10-13 08:01:48,243 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_rx [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2024-10-13 08:01:48,243 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure can_led_event [2024-10-13 08:01:48,243 INFO L138 BoogieDeclarations]: Found implementation of procedure can_led_event [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-13 08:01:48,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_disconnect [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_disconnect [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_warn [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_warn [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_info [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_info [2024-10-13 08:01:48,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2024-10-13 08:01:48,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2024-10-13 08:01:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2024-10-13 08:01:48,245 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2024-10-13 08:01:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 08:01:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 08:01:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 08:01:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 08:01:48,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 08:01:48,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 08:01:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-13 08:01:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-13 08:01:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2024-10-13 08:01:48,247 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2024-10-13 08:01:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2024-10-13 08:01:48,247 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2024-10-13 08:01:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_send_cmd [2024-10-13 08:01:48,248 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_send_cmd [2024-10-13 08:01:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-10-13 08:01:48,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-10-13 08:01:48,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 08:01:48,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 08:01:48,249 INFO L130 BoogieDeclarations]: Found specification of procedure usb_8dev_cmd_open [2024-10-13 08:01:48,249 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_8dev_cmd_open [2024-10-13 08:01:48,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 08:01:48,760 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 08:01:48,844 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-13 08:01:49,475 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2024-10-13 08:01:52,103 INFO L? ?]: Removed 1214 outVars from TransFormulas that were not future-live. [2024-10-13 08:01:52,103 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 08:01:52,283 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 08:01:52,283 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 08:01:52,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:01:52 BoogieIcfgContainer [2024-10-13 08:01:52,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 08:01:52,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 08:01:52,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 08:01:52,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 08:01:52,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:01:45" (1/3) ... [2024-10-13 08:01:52,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e07ec7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:01:52, skipping insertion in model container [2024-10-13 08:01:52,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:01:47" (2/3) ... [2024-10-13 08:01:52,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e07ec7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:01:52, skipping insertion in model container [2024-10-13 08:01:52,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:01:52" (3/3) ... [2024-10-13 08:01:52,295 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--can--usb--usb_8dev.ko-entry_point.cil.out.i [2024-10-13 08:01:52,313 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 08:01:52,313 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 08:01:52,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 08:01:52,418 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;@c2d710f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 08:01:52,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 08:01:52,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 494 states have (on average 1.4271255060728745) internal successors, (705), 514 states have internal predecessors, (705), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) [2024-10-13 08:01:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 08:01:52,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:01:52,440 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:01:52,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:01:52,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:01:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2119933231, now seen corresponding path program 1 times [2024-10-13 08:01:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:01:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314300122] [2024-10-13 08:01:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:01:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:01:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:01:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:53,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:01:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 08:01:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:01:53,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314300122] [2024-10-13 08:01:53,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314300122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:01:53,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:01:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:01:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759647792] [2024-10-13 08:01:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:01:53,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:01:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:01:53,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:01:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:01:53,148 INFO L87 Difference]: Start difference. First operand has 696 states, 494 states have (on average 1.4271255060728745) internal successors, (705), 514 states have internal predecessors, (705), 155 states have call successors, (155), 47 states have call predecessors, (155), 45 states have return successors, (149), 148 states have call predecessors, (149), 149 states have call successors, (149) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 08:01:57,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:01:57,173 INFO L93 Difference]: Finished difference Result 2167 states and 3239 transitions. [2024-10-13 08:01:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 08:01:57,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-13 08:01:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:01:57,203 INFO L225 Difference]: With dead ends: 2167 [2024-10-13 08:01:57,204 INFO L226 Difference]: Without dead ends: 1453 [2024-10-13 08:01:57,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 08:01:57,218 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1180 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 08:01:57,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1894 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 08:01:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2024-10-13 08:01:57,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1345. [2024-10-13 08:01:57,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 967 states have (on average 1.3619441571871769) internal successors, (1317), 987 states have internal predecessors, (1317), 289 states have call successors, (289), 89 states have call predecessors, (289), 88 states have return successors, (284), 282 states have call predecessors, (284), 284 states have call successors, (284) [2024-10-13 08:01:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1890 transitions. [2024-10-13 08:01:57,403 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1890 transitions. Word has length 23 [2024-10-13 08:01:57,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:01:57,404 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 1890 transitions. [2024-10-13 08:01:57,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 08:01:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1890 transitions. [2024-10-13 08:01:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-13 08:01:57,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:01:57,407 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-13 08:01:57,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 08:01:57,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:01:57,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:01:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1009435931, now seen corresponding path program 1 times [2024-10-13 08:01:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:01:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182530261] [2024-10-13 08:01:57,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:01:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:01:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:01:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:57,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:01:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:01:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:01:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 08:01:57,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:01:57,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182530261] [2024-10-13 08:01:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182530261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:01:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:01:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:01:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60540055] [2024-10-13 08:01:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:01:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:01:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:01:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:01:57,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:01:57,839 INFO L87 Difference]: Start difference. First operand 1345 states and 1890 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:00,683 INFO L93 Difference]: Finished difference Result 4240 states and 6073 transitions. [2024-10-13 08:02:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 08:02:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2024-10-13 08:02:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:00,696 INFO L225 Difference]: With dead ends: 4240 [2024-10-13 08:02:00,696 INFO L226 Difference]: Without dead ends: 2900 [2024-10-13 08:02:00,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 08:02:00,701 INFO L432 NwaCegarLoop]: 1135 mSDtfsCounter, 1088 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:00,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 2402 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 08:02:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2024-10-13 08:02:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2674. [2024-10-13 08:02:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 1926 states have (on average 1.3603322949117342) internal successors, (2620), 1962 states have internal predecessors, (2620), 571 states have call successors, (571), 177 states have call predecessors, (571), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-13 08:02:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 3771 transitions. [2024-10-13 08:02:00,787 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 3771 transitions. Word has length 32 [2024-10-13 08:02:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 3771 transitions. [2024-10-13 08:02:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 3771 transitions. [2024-10-13 08:02:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 08:02:00,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:00,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-13 08:02:00,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 08:02:00,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:00,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1228159411, now seen corresponding path program 1 times [2024-10-13 08:02:00,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:00,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971088298] [2024-10-13 08:02:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:00,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 08:02:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:01,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971088298] [2024-10-13 08:02:01,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971088298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:01,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:02:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060419775] [2024-10-13 08:02:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:01,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:02:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:01,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:02:01,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:02:01,037 INFO L87 Difference]: Start difference. First operand 2674 states and 3771 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:03,361 INFO L93 Difference]: Finished difference Result 2892 states and 4166 transitions. [2024-10-13 08:02:03,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:02:03,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-10-13 08:02:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:03,377 INFO L225 Difference]: With dead ends: 2892 [2024-10-13 08:02:03,377 INFO L226 Difference]: Without dead ends: 2889 [2024-10-13 08:02:03,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 08:02:03,380 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 1014 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:03,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1191 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 08:02:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2024-10-13 08:02:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2673. [2024-10-13 08:02:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 1926 states have (on average 1.3598130841121496) internal successors, (2619), 1961 states have internal predecessors, (2619), 570 states have call successors, (570), 177 states have call predecessors, (570), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-13 08:02:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 3769 transitions. [2024-10-13 08:02:03,580 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 3769 transitions. Word has length 33 [2024-10-13 08:02:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:03,581 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 3769 transitions. [2024-10-13 08:02:03,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:03,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 3769 transitions. [2024-10-13 08:02:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-13 08:02:03,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:03,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 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-13 08:02:03,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 08:02:03,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:03,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 581352168, now seen corresponding path program 1 times [2024-10-13 08:02:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079007853] [2024-10-13 08:02:03,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:03,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:03,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:03,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 08:02:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079007853] [2024-10-13 08:02:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079007853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:02:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920723785] [2024-10-13 08:02:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:03,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:02:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:03,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:02:03,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:02:03,771 INFO L87 Difference]: Start difference. First operand 2673 states and 3769 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:06,018 INFO L93 Difference]: Finished difference Result 2891 states and 4164 transitions. [2024-10-13 08:02:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:02:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-10-13 08:02:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:06,031 INFO L225 Difference]: With dead ends: 2891 [2024-10-13 08:02:06,031 INFO L226 Difference]: Without dead ends: 2888 [2024-10-13 08:02:06,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 08:02:06,034 INFO L432 NwaCegarLoop]: 767 mSDtfsCounter, 1012 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:06,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1185 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 08:02:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2024-10-13 08:02:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2672. [2024-10-13 08:02:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 1926 states have (on average 1.3592938733125648) internal successors, (2618), 1960 states have internal predecessors, (2618), 569 states have call successors, (569), 177 states have call predecessors, (569), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-13 08:02:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 3767 transitions. [2024-10-13 08:02:06,213 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 3767 transitions. Word has length 34 [2024-10-13 08:02:06,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:06,214 INFO L471 AbstractCegarLoop]: Abstraction has 2672 states and 3767 transitions. [2024-10-13 08:02:06,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:06,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 3767 transitions. [2024-10-13 08:02:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-13 08:02:06,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:06,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 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-13 08:02:06,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 08:02:06,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:06,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:06,218 INFO L85 PathProgramCache]: Analyzing trace with hash 841641136, now seen corresponding path program 1 times [2024-10-13 08:02:06,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:06,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563937430] [2024-10-13 08:02:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:06,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:06,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:06,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 08:02:06,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:06,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563937430] [2024-10-13 08:02:06,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563937430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:06,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:06,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:02:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223479366] [2024-10-13 08:02:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:06,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:02:06,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:06,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:02:06,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:02:06,420 INFO L87 Difference]: Start difference. First operand 2672 states and 3767 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:08,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:08,599 INFO L93 Difference]: Finished difference Result 2890 states and 4162 transitions. [2024-10-13 08:02:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:02:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-10-13 08:02:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:08,613 INFO L225 Difference]: With dead ends: 2890 [2024-10-13 08:02:08,613 INFO L226 Difference]: Without dead ends: 2887 [2024-10-13 08:02:08,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 08:02:08,614 INFO L432 NwaCegarLoop]: 758 mSDtfsCounter, 1015 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:08,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1175 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 08:02:08,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2024-10-13 08:02:08,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2671. [2024-10-13 08:02:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2671 states, 1926 states have (on average 1.3587746625129802) internal successors, (2617), 1959 states have internal predecessors, (2617), 568 states have call successors, (568), 177 states have call predecessors, (568), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-13 08:02:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3765 transitions. [2024-10-13 08:02:08,713 INFO L78 Accepts]: Start accepts. Automaton has 2671 states and 3765 transitions. Word has length 35 [2024-10-13 08:02:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:08,714 INFO L471 AbstractCegarLoop]: Abstraction has 2671 states and 3765 transitions. [2024-10-13 08:02:08,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2671 states and 3765 transitions. [2024-10-13 08:02:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 08:02:08,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:08,715 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 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-13 08:02:08,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 08:02:08,715 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash 320669419, now seen corresponding path program 1 times [2024-10-13 08:02:08,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:08,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935479743] [2024-10-13 08:02:08,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:08,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:08,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:08,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 08:02:08,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:08,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935479743] [2024-10-13 08:02:08,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935479743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:08,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 08:02:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996543038] [2024-10-13 08:02:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:08,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:02:08,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:08,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:02:08,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 08:02:08,885 INFO L87 Difference]: Start difference. First operand 2671 states and 3765 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:10,716 INFO L93 Difference]: Finished difference Result 2889 states and 4160 transitions. [2024-10-13 08:02:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:02:10,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-10-13 08:02:10,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:10,727 INFO L225 Difference]: With dead ends: 2889 [2024-10-13 08:02:10,728 INFO L226 Difference]: Without dead ends: 2880 [2024-10-13 08:02:10,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 08:02:10,729 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 1012 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:10,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 1173 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 08:02:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2880 states. [2024-10-13 08:02:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2880 to 2664. [2024-10-13 08:02:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 1920 states have (on average 1.3578125) internal successors, (2607), 1952 states have internal predecessors, (2607), 567 states have call successors, (567), 177 states have call predecessors, (567), 176 states have return successors, (580), 562 states have call predecessors, (580), 566 states have call successors, (580) [2024-10-13 08:02:10,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3754 transitions. [2024-10-13 08:02:10,837 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3754 transitions. Word has length 36 [2024-10-13 08:02:10,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:10,838 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 3754 transitions. [2024-10-13 08:02:10,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 08:02:10,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3754 transitions. [2024-10-13 08:02:10,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 08:02:10,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:10,842 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-13 08:02:10,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 08:02:10,842 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:10,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1640778586, now seen corresponding path program 1 times [2024-10-13 08:02:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:10,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67729853] [2024-10-13 08:02:10,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:10,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-13 08:02:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-13 08:02:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:11,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:11,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-13 08:02:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:11,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 08:02:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 08:02:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67729853] [2024-10-13 08:02:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67729853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:11,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124964438] [2024-10-13 08:02:11,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:11,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:11,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:11,053 INFO L87 Difference]: Start difference. First operand 2664 states and 3754 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 08:02:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:14,691 INFO L93 Difference]: Finished difference Result 6372 states and 9039 transitions. [2024-10-13 08:02:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 08:02:14,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-10-13 08:02:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:14,711 INFO L225 Difference]: With dead ends: 6372 [2024-10-13 08:02:14,712 INFO L226 Difference]: Without dead ends: 3713 [2024-10-13 08:02:14,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 08:02:14,724 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 828 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:14,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 1792 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 08:02:14,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3713 states. [2024-10-13 08:02:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3713 to 3400. [2024-10-13 08:02:14,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 2428 states have (on average 1.3500823723228994) internal successors, (3278), 2472 states have internal predecessors, (3278), 714 states have call successors, (714), 252 states have call predecessors, (714), 257 states have return successors, (745), 711 states have call predecessors, (745), 713 states have call successors, (745) [2024-10-13 08:02:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4737 transitions. [2024-10-13 08:02:14,963 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4737 transitions. Word has length 74 [2024-10-13 08:02:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:14,963 INFO L471 AbstractCegarLoop]: Abstraction has 3400 states and 4737 transitions. [2024-10-13 08:02:14,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 08:02:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4737 transitions. [2024-10-13 08:02:14,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 08:02:14,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:14,968 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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-13 08:02:14,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 08:02:14,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1925789135, now seen corresponding path program 1 times [2024-10-13 08:02:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:14,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670931847] [2024-10-13 08:02:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-13 08:02:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 08:02:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 08:02:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-13 08:02:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:15,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670931847] [2024-10-13 08:02:15,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670931847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:15,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:15,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70552863] [2024-10-13 08:02:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:15,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:15,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:15,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:15,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:15,318 INFO L87 Difference]: Start difference. First operand 3400 states and 4737 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-13 08:02:22,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:22,313 INFO L93 Difference]: Finished difference Result 7890 states and 11099 transitions. [2024-10-13 08:02:22,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 08:02:22,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2024-10-13 08:02:22,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:22,333 INFO L225 Difference]: With dead ends: 7890 [2024-10-13 08:02:22,334 INFO L226 Difference]: Without dead ends: 4501 [2024-10-13 08:02:22,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-13 08:02:22,342 INFO L432 NwaCegarLoop]: 825 mSDtfsCounter, 569 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 2739 SdHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:22,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 2739 Invalid, 2309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-13 08:02:22,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2024-10-13 08:02:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4156. [2024-10-13 08:02:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4156 states, 2966 states have (on average 1.3465947403910992) internal successors, (3994), 3018 states have internal predecessors, (3994), 858 states have call successors, (858), 326 states have call predecessors, (858), 331 states have return successors, (889), 855 states have call predecessors, (889), 857 states have call successors, (889) [2024-10-13 08:02:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4156 states to 4156 states and 5741 transitions. [2024-10-13 08:02:22,621 INFO L78 Accepts]: Start accepts. Automaton has 4156 states and 5741 transitions. Word has length 86 [2024-10-13 08:02:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:22,622 INFO L471 AbstractCegarLoop]: Abstraction has 4156 states and 5741 transitions. [2024-10-13 08:02:22,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-13 08:02:22,622 INFO L276 IsEmpty]: Start isEmpty. Operand 4156 states and 5741 transitions. [2024-10-13 08:02:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-13 08:02:22,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:22,625 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2024-10-13 08:02:22,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 08:02:22,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:22,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2113625808, now seen corresponding path program 1 times [2024-10-13 08:02:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:22,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340178908] [2024-10-13 08:02:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 08:02:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 08:02:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-13 08:02:22,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340178908] [2024-10-13 08:02:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340178908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:22,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:22,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703228683] [2024-10-13 08:02:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:22,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:22,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:22,806 INFO L87 Difference]: Start difference. First operand 4156 states and 5741 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 08:02:29,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:29,912 INFO L93 Difference]: Finished difference Result 10666 states and 14849 transitions. [2024-10-13 08:02:29,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 08:02:29,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2024-10-13 08:02:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:29,946 INFO L225 Difference]: With dead ends: 10666 [2024-10-13 08:02:29,946 INFO L226 Difference]: Without dead ends: 6521 [2024-10-13 08:02:29,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 08:02:29,960 INFO L432 NwaCegarLoop]: 843 mSDtfsCounter, 1282 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 2683 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:29,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 2683 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-13 08:02:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6521 states. [2024-10-13 08:02:30,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6521 to 5906. [2024-10-13 08:02:30,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5906 states, 4262 states have (on average 1.348193336461755) internal successors, (5746), 4342 states have internal predecessors, (5746), 1140 states have call successors, (1140), 492 states have call predecessors, (1140), 503 states have return successors, (1185), 1135 states have call predecessors, (1185), 1139 states have call successors, (1185) [2024-10-13 08:02:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5906 states to 5906 states and 8071 transitions. [2024-10-13 08:02:30,388 INFO L78 Accepts]: Start accepts. Automaton has 5906 states and 8071 transitions. Word has length 97 [2024-10-13 08:02:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:30,388 INFO L471 AbstractCegarLoop]: Abstraction has 5906 states and 8071 transitions. [2024-10-13 08:02:30,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 08:02:30,389 INFO L276 IsEmpty]: Start isEmpty. Operand 5906 states and 8071 transitions. [2024-10-13 08:02:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 08:02:30,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:30,394 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:02:30,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 08:02:30,394 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:30,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2062913462, now seen corresponding path program 1 times [2024-10-13 08:02:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:30,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482992282] [2024-10-13 08:02:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 08:02:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 08:02:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 08:02:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 08:02:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 08:02:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 08:02:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-13 08:02:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482992282] [2024-10-13 08:02:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482992282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 08:02:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428515619] [2024-10-13 08:02:30,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:30,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 08:02:30,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 08:02:30,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 08:02:30,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 08:02:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:31,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 1275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 08:02:31,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 08:02:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-13 08:02:31,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 08:02:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428515619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 08:02:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2024-10-13 08:02:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687967240] [2024-10-13 08:02:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:31,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 08:02:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 08:02:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 08:02:31,992 INFO L87 Difference]: Start difference. First operand 5906 states and 8071 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-13 08:02:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:34,095 INFO L93 Difference]: Finished difference Result 17701 states and 24189 transitions. [2024-10-13 08:02:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 08:02:34,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2024-10-13 08:02:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:34,153 INFO L225 Difference]: With dead ends: 17701 [2024-10-13 08:02:34,153 INFO L226 Difference]: Without dead ends: 17696 [2024-10-13 08:02:34,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 08:02:34,163 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 2287 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2287 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:34,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2287 Valid, 2430 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 08:02:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17696 states. [2024-10-13 08:02:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17696 to 17666. [2024-10-13 08:02:35,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17666 states, 12746 states have (on average 1.3488153146085047) internal successors, (17192), 13002 states have internal predecessors, (17192), 3412 states have call successors, (3412), 1472 states have call predecessors, (3412), 1507 states have return successors, (3549), 3383 states have call predecessors, (3549), 3411 states have call successors, (3549) [2024-10-13 08:02:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17666 states to 17666 states and 24153 transitions. [2024-10-13 08:02:35,658 INFO L78 Accepts]: Start accepts. Automaton has 17666 states and 24153 transitions. Word has length 112 [2024-10-13 08:02:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:35,660 INFO L471 AbstractCegarLoop]: Abstraction has 17666 states and 24153 transitions. [2024-10-13 08:02:35,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-13 08:02:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 17666 states and 24153 transitions. [2024-10-13 08:02:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-13 08:02:35,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:35,701 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:02:35,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 08:02:35,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 08:02:35,904 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:35,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1394428374, now seen corresponding path program 1 times [2024-10-13 08:02:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793002392] [2024-10-13 08:02:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 08:02:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 08:02:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 08:02:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 08:02:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 08:02:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 08:02:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 08:02:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-13 08:02:36,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:36,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793002392] [2024-10-13 08:02:36,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793002392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:36,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:36,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:36,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604724824] [2024-10-13 08:02:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:36,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:36,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:36,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:36,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:36,253 INFO L87 Difference]: Start difference. First operand 17666 states and 24153 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 08:02:44,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:44,667 INFO L93 Difference]: Finished difference Result 27842 states and 38365 transitions. [2024-10-13 08:02:44,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 08:02:44,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-10-13 08:02:44,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:44,714 INFO L225 Difference]: With dead ends: 27842 [2024-10-13 08:02:44,714 INFO L226 Difference]: Without dead ends: 9651 [2024-10-13 08:02:44,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 08:02:44,755 INFO L432 NwaCegarLoop]: 773 mSDtfsCounter, 1178 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 1956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:44,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 2213 Invalid, 1956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-10-13 08:02:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9651 states. [2024-10-13 08:02:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9651 to 8755. [2024-10-13 08:02:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8755 states, 6318 states have (on average 1.3442545109211776) internal successors, (8493), 6446 states have internal predecessors, (8493), 1690 states have call successors, (1690), 729 states have call predecessors, (1690), 746 states have return successors, (1758), 1675 states have call predecessors, (1758), 1689 states have call successors, (1758) [2024-10-13 08:02:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8755 states to 8755 states and 11941 transitions. [2024-10-13 08:02:46,079 INFO L78 Accepts]: Start accepts. Automaton has 8755 states and 11941 transitions. Word has length 121 [2024-10-13 08:02:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:46,079 INFO L471 AbstractCegarLoop]: Abstraction has 8755 states and 11941 transitions. [2024-10-13 08:02:46,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 08:02:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8755 states and 11941 transitions. [2024-10-13 08:02:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 08:02:46,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:46,088 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:02:46,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 08:02:46,089 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:46,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1031158273, now seen corresponding path program 1 times [2024-10-13 08:02:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:46,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083201220] [2024-10-13 08:02:46,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:46,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 08:02:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 08:02:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 08:02:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 08:02:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 08:02:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 08:02:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:46,598 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-13 08:02:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083201220] [2024-10-13 08:02:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083201220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:46,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:46,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 08:02:46,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514273947] [2024-10-13 08:02:46,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:46,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 08:02:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:46,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 08:02:46,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 08:02:46,599 INFO L87 Difference]: Start difference. First operand 8755 states and 11941 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 08:02:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:02:56,684 INFO L93 Difference]: Finished difference Result 17288 states and 23914 transitions. [2024-10-13 08:02:56,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 08:02:56,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2024-10-13 08:02:56,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:02:56,724 INFO L225 Difference]: With dead ends: 17288 [2024-10-13 08:02:56,724 INFO L226 Difference]: Without dead ends: 9120 [2024-10-13 08:02:56,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 08:02:56,810 INFO L432 NwaCegarLoop]: 928 mSDtfsCounter, 1049 mSDsluCounter, 2049 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-10-13 08:02:56,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 2977 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-10-13 08:02:56,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9120 states. [2024-10-13 08:02:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9120 to 8240. [2024-10-13 08:02:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8240 states, 5962 states have (on average 1.3403220395840323) internal successors, (7991), 6083 states have internal predecessors, (7991), 1585 states have call successors, (1585), 675 states have call predecessors, (1585), 692 states have return successors, (1653), 1571 states have call predecessors, (1653), 1584 states have call successors, (1653) [2024-10-13 08:02:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 11229 transitions. [2024-10-13 08:02:57,563 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 11229 transitions. Word has length 123 [2024-10-13 08:02:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:02:57,564 INFO L471 AbstractCegarLoop]: Abstraction has 8240 states and 11229 transitions. [2024-10-13 08:02:57,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 08:02:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 11229 transitions. [2024-10-13 08:02:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-13 08:02:57,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:02:57,573 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:02:57,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 08:02:57,574 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:02:57,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:02:57,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1250012991, now seen corresponding path program 1 times [2024-10-13 08:02:57,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:02:57,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943816] [2024-10-13 08:02:57,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:02:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:02:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 08:02:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-13 08:02:57,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 08:02:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 08:02:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 08:02:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:02:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:02:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 08:02:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 08:02:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 08:02:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 08:02:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:02:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 08:02:57,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:02:57,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943816] [2024-10-13 08:02:57,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:02:57,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:02:57,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 08:02:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226472601] [2024-10-13 08:02:57,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:02:57,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 08:02:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:02:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 08:02:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 08:02:57,880 INFO L87 Difference]: Start difference. First operand 8240 states and 11229 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 08:03:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 08:03:05,376 INFO L93 Difference]: Finished difference Result 21597 states and 29890 transitions. [2024-10-13 08:03:05,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 08:03:05,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 123 [2024-10-13 08:03:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 08:03:05,416 INFO L225 Difference]: With dead ends: 21597 [2024-10-13 08:03:05,416 INFO L226 Difference]: Without dead ends: 13944 [2024-10-13 08:03:05,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 08:03:05,429 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 1520 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 746 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 2670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 746 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-13 08:03:05,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2745 Invalid, 2670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [746 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-13 08:03:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13944 states. [2024-10-13 08:03:06,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13944 to 12575. [2024-10-13 08:03:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12575 states, 9121 states have (on average 1.3416292073237583) internal successors, (12237), 9312 states have internal predecessors, (12237), 2398 states have call successors, (2398), 1029 states have call predecessors, (2398), 1055 states have return successors, (2502), 2365 states have call predecessors, (2502), 2397 states have call successors, (2502) [2024-10-13 08:03:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12575 states to 12575 states and 17137 transitions. [2024-10-13 08:03:06,569 INFO L78 Accepts]: Start accepts. Automaton has 12575 states and 17137 transitions. Word has length 123 [2024-10-13 08:03:06,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 08:03:06,570 INFO L471 AbstractCegarLoop]: Abstraction has 12575 states and 17137 transitions. [2024-10-13 08:03:06,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-13 08:03:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 12575 states and 17137 transitions. [2024-10-13 08:03:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 08:03:06,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 08:03:06,582 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 08:03:06,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 08:03:06,582 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 08:03:06,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 08:03:06,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1969647923, now seen corresponding path program 1 times [2024-10-13 08:03:06,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 08:03:06,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489646339] [2024-10-13 08:03:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 08:03:06,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 08:03:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:03:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:03:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 08:03:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:03:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 08:03:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 08:03:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 08:03:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 08:03:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 08:03:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 08:03:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 08:03:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 08:03:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 08:03:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 08:03:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 08:03:06,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 08:03:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-13 08:03:06,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 08:03:06,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489646339] [2024-10-13 08:03:06,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489646339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 08:03:06,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 08:03:06,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 08:03:06,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504388125] [2024-10-13 08:03:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 08:03:06,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 08:03:06,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 08:03:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 08:03:06,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 08:03:06,821 INFO L87 Difference]: Start difference. First operand 12575 states and 17137 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)