./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.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 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 21:09:56,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 21:09:56,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 21:09:56,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 21:09:56,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 21:09:56,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 21:09:56,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 21:09:56,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 21:09:56,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 21:09:56,900 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 21:09:56,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 21:09:56,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 21:09:56,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 21:09:56,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 21:09:56,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 21:09:56,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 21:09:56,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 21:09:56,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 21:09:56,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 21:09:56,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 21:09:56,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 21:09:56,908 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 21:09:56,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 21:09:56,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 21:09:56,909 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 21:09:56,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 21:09:56,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 21:09:56,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 21:09:56,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 21:09:56,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 21:09:56,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 21:09:56,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 21:09:56,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 21:09:56,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 21:09:56,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 21:09:56,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 21:09:56,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 21:09:56,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 21:09:56,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 21:09:56,912 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 -> 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 [2024-11-16 21:09:57,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 21:09:57,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 21:09:57,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 21:09:57,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 21:09:57,230 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 21:09:57,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-11-16 21:09:58,611 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 21:09:59,053 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 21:09:59,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-11-16 21:09:59,095 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e82c340/a9cf746c60d340ecb5923bb11964595f/FLAG5ecf84273 [2024-11-16 21:09:59,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e82c340/a9cf746c60d340ecb5923bb11964595f [2024-11-16 21:09:59,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 21:09:59,204 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 21:09:59,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 21:09:59,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 21:09:59,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 21:09:59,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:09:59" (1/1) ... [2024-11-16 21:09:59,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f53bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:09:59, skipping insertion in model container [2024-11-16 21:09:59,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:09:59" (1/1) ... [2024-11-16 21:09:59,281 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 21:09:59,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-11-16 21:10:00,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 21:10:00,035 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 21:10:00,135 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3095-3096] [2024-11-16 21:10:00,212 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 *)"include/linux/scatterlist.h"), "i" (63), "i" (12UL)); [3374-3375] [2024-11-16 21:10:00,213 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 *)"include/linux/scatterlist.h"), "i" (65), "i" (12UL)); [3382-3383] [2024-11-16 21:10:00,213 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 *)"include/linux/scatterlist.h"), "i" (66), "i" (12UL)); [3390-3391] [2024-11-16 21:10:00,283 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 *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (123), "i" (12UL)); [3605-3606] [2024-11-16 21:10:00,289 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 *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (177), "i" (12UL)); [3680-3681] [2024-11-16 21:10:00,363 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 *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (467), "i" (12UL)); [4002-4003] [2024-11-16 21:10:00,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-11-16 21:10:00,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 21:10:00,438 INFO L204 MainTranslator]: Completed translation [2024-11-16 21:10:00,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00 WrapperNode [2024-11-16 21:10:00,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 21:10:00,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 21:10:00,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 21:10:00,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 21:10:00,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:00,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:00,587 INFO L138 Inliner]: procedures = 143, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1748 [2024-11-16 21:10:00,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 21:10:00,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 21:10:00,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 21:10:00,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 21:10:00,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:00,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:00,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:00,926 INFO L175 MemorySlicer]: Split 263 memory accesses to 10 slices as follows [2, 1, 25, 192, 8, 8, 21, 1, 4, 1]. 73 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 0, 0, 13, 8, 8, 0, 0, 0, 0]. The 91 writes are split as follows [0, 0, 3, 63, 0, 0, 21, 1, 2, 1]. [2024-11-16 21:10:00,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:00,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:00,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:01,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:01,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:01,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:01,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 21:10:01,049 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 21:10:01,049 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 21:10:01,049 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 21:10:01,050 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (1/1) ... [2024-11-16 21:10:01,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 21:10:01,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 21:10:01,083 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 21:10:01,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 21:10:01,127 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2024-11-16 21:10:01,127 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2024-11-16 21:10:01,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-16 21:10:01,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-16 21:10:01,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-16 21:10:01,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-16 21:10:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-16 21:10:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-16 21:10:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-16 21:10:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2024-11-16 21:10:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2024-11-16 21:10:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2024-11-16 21:10:01,128 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2024-11-16 21:10:01,128 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2024-11-16 21:10:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2024-11-16 21:10:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2024-11-16 21:10:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2024-11-16 21:10:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2024-11-16 21:10:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2024-11-16 21:10:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2024-11-16 21:10:01,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2024-11-16 21:10:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2024-11-16 21:10:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2024-11-16 21:10:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2024-11-16 21:10:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-11-16 21:10:01,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-11-16 21:10:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 21:10:01,130 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 21:10:01,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 21:10:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 21:10:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 21:10:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 21:10:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-16 21:10:01,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-16 21:10:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-16 21:10:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-16 21:10:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-16 21:10:01,136 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-16 21:10:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2024-11-16 21:10:01,137 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2024-11-16 21:10:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-11-16 21:10:01,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-11-16 21:10:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-16 21:10:01,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-16 21:10:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2024-11-16 21:10:01,137 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2024-11-16 21:10:01,137 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2024-11-16 21:10:01,138 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2024-11-16 21:10:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-11-16 21:10:01,138 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-11-16 21:10:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 21:10:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 21:10:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 21:10:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 21:10:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 21:10:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 21:10:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-16 21:10:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-16 21:10:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-16 21:10:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-16 21:10:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-11-16 21:10:01,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-11-16 21:10:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-11-16 21:10:01,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-11-16 21:10:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2024-11-16 21:10:01,141 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2024-11-16 21:10:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-11-16 21:10:01,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-11-16 21:10:01,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 21:10:01,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 21:10:01,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 21:10:01,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-11-16 21:10:01,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-11-16 21:10:01,142 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-11-16 21:10:01,142 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-11-16 21:10:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 21:10:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2024-11-16 21:10:01,143 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2024-11-16 21:10:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 21:10:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 21:10:01,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-16 21:10:01,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-16 21:10:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-11-16 21:10:01,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-11-16 21:10:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2024-11-16 21:10:01,145 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2024-11-16 21:10:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2024-11-16 21:10:01,145 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2024-11-16 21:10:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 21:10:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-16 21:10:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-11-16 21:10:01,147 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-11-16 21:10:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-11-16 21:10:01,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-11-16 21:10:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 21:10:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2024-11-16 21:10:01,148 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2024-11-16 21:10:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2024-11-16 21:10:01,148 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2024-11-16 21:10:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 21:10:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 21:10:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 21:10:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 21:10:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 21:10:01,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 21:10:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-16 21:10:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-16 21:10:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-16 21:10:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-16 21:10:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 21:10:01,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 21:10:01,150 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-11-16 21:10:01,151 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-11-16 21:10:01,546 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 21:10:01,548 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 21:10:01,615 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-11-16 21:10:01,625 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc #t~mem53; [2024-11-16 21:10:01,720 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4358: havoc __phys_addr_#t~nondet406#1; [2024-11-16 21:10:02,082 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4397: havoc blk_peek_request_#t~ret413#1.base, blk_peek_request_#t~ret413#1.offset; [2024-11-16 21:10:02,083 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3498: call ULTIMATE.dealloc(blk_done_~#len~0#1.base, blk_done_~#len~0#1.offset);havoc blk_done_~#len~0#1.base, blk_done_~#len~0#1.offset; [2024-11-16 21:10:02,083 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4432: havoc blk_rq_map_sg_#t~nondet415#1; [2024-11-16 21:10:02,083 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4499: havoc virtqueue_add_buf_gfp_#t~nondet421#1; [2024-11-16 21:10:02,083 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: havoc blk_rq_pos_#t~mem65#1; [2024-11-16 21:10:02,083 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4369: havoc _raw_spin_lock_irqsave_#t~nondet408#1; [2024-11-16 21:10:02,083 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4502: havoc virtqueue_get_buf_#t~ret422#1.base, virtqueue_get_buf_#t~ret422#1.offset; [2024-11-16 21:10:02,083 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4453: havoc mempool_alloc_#t~ret416#1.base, mempool_alloc_#t~ret416#1.offset; [2024-11-16 21:10:02,112 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc list_empty_#t~mem12#1.base, list_empty_#t~mem12#1.offset; [2024-11-16 21:10:02,128 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc #t~nondet414; [2024-11-16 21:10:06,615 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3489: havoc virtio_find_single_vq_#t~mem162#1.base, virtio_find_single_vq_#t~mem162#1.offset;call ULTIMATE.dealloc(virtio_find_single_vq_~#callbacks~0#1.base, virtio_find_single_vq_~#callbacks~0#1.offset);havoc virtio_find_single_vq_~#callbacks~0#1.base, virtio_find_single_vq_~#callbacks~0#1.offset;call ULTIMATE.dealloc(virtio_find_single_vq_~#names~0#1.base, virtio_find_single_vq_~#names~0#1.offset);havoc virtio_find_single_vq_~#names~0#1.base, virtio_find_single_vq_~#names~0#1.offset;call ULTIMATE.dealloc(virtio_find_single_vq_~#vq~0#1.base, virtio_find_single_vq_~#vq~0#1.offset);havoc virtio_find_single_vq_~#vq~0#1.base, virtio_find_single_vq_~#vq~0#1.offset; [2024-11-16 21:10:06,615 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc scsi_cmd_ioctl_#t~nondet420#1; [2024-11-16 21:10:06,615 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4381: havoc bio_map_kern_#t~ret410#1.base, bio_map_kern_#t~ret410#1.offset; [2024-11-16 21:10:06,616 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc _copy_to_user_#t~nondet407#1; [2024-11-16 21:10:06,617 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3344: havoc __kmalloc_#t~ret115#1.base, __kmalloc_#t~ret115#1.offset; [2024-11-16 21:10:06,617 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4072: call ULTIMATE.dealloc(main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset);havoc main_~#ldvarg1~0#1.base, main_~#ldvarg1~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset);havoc main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset; [2024-11-16 21:10:06,617 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3759: call ULTIMATE.dealloc(virtblk_ioctl_~#id_str~0#1.base, virtblk_ioctl_~#id_str~0#1.offset);havoc virtblk_ioctl_~#id_str~0#1.base, virtblk_ioctl_~#id_str~0#1.offset; [2024-11-16 21:10:06,617 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4472: havoc register_blkdev_#t~nondet418#1; [2024-11-16 21:10:06,617 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4456: havoc mempool_create_#t~ret417#1.base, mempool_create_#t~ret417#1.offset; [2024-11-16 21:10:06,617 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4391: havoc blk_execute_rq_#t~nondet411#1; [2024-11-16 21:10:06,618 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3831: call ULTIMATE.dealloc(virtblk_probe_~#cap~0#1.base, virtblk_probe_~#cap~0#1.offset);havoc virtblk_probe_~#cap~0#1.base, virtblk_probe_~#cap~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#v~0#1.base, virtblk_probe_~#v~0#1.offset);havoc virtblk_probe_~#v~0#1.base, virtblk_probe_~#v~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#blk_size~0#1.base, virtblk_probe_~#blk_size~0#1.offset);havoc virtblk_probe_~#blk_size~0#1.base, virtblk_probe_~#blk_size~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#sg_elems~0#1.base, virtblk_probe_~#sg_elems~0#1.offset);havoc virtblk_probe_~#sg_elems~0#1.base, virtblk_probe_~#sg_elems~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#opt_io_size~0#1.base, virtblk_probe_~#opt_io_size~0#1.offset);havoc virtblk_probe_~#opt_io_size~0#1.base, virtblk_probe_~#opt_io_size~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#min_io_size~0#1.base, virtblk_probe_~#min_io_size~0#1.offset);havoc virtblk_probe_~#min_io_size~0#1.base, virtblk_probe_~#min_io_size~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#physical_block_exp~0#1.base, virtblk_probe_~#physical_block_exp~0#1.offset);havoc virtblk_probe_~#physical_block_exp~0#1.base, virtblk_probe_~#physical_block_exp~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#alignment_offset~0#1.base, virtblk_probe_~#alignment_offset~0#1.offset);havoc virtblk_probe_~#alignment_offset~0#1.base, virtblk_probe_~#alignment_offset~0#1.offset;call ULTIMATE.dealloc(virtblk_probe_~#__key~0#1.base, virtblk_probe_~#__key~0#1.offset);havoc virtblk_probe_~#__key~0#1.base, virtblk_probe_~#__key~0#1.offset; [2024-11-16 21:10:06,618 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: havoc register_virtio_driver_#t~nondet419#1; [2024-11-16 21:10:06,618 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3799: call ULTIMATE.dealloc(virtblk_getgeo_~#vgeo~0#1.base, virtblk_getgeo_~#vgeo~0#1.offset);havoc virtblk_getgeo_~#vgeo~0#1.base, virtblk_getgeo_~#vgeo~0#1.offset; [2024-11-16 21:10:06,619 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc get_capacity_#t~mem27#1; [2024-11-16 21:10:06,619 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4394: havoc blk_init_queue_#t~ret412#1.base, blk_init_queue_#t~ret412#1.offset; [2024-11-16 21:10:06,619 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: havoc alloc_disk_#t~ret409#1.base, alloc_disk_#t~ret409#1.offset; [2024-11-16 21:10:06,832 INFO L? ?]: Removed 979 outVars from TransFormulas that were not future-live. [2024-11-16 21:10:06,832 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 21:10:06,871 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 21:10:06,871 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 21:10:06,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:10:06 BoogieIcfgContainer [2024-11-16 21:10:06,872 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 21:10:06,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 21:10:06,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 21:10:06,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 21:10:06,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:09:59" (1/3) ... [2024-11-16 21:10:06,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa79c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:10:06, skipping insertion in model container [2024-11-16 21:10:06,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:10:00" (2/3) ... [2024-11-16 21:10:06,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa79c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:10:06, skipping insertion in model container [2024-11-16 21:10:06,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:10:06" (3/3) ... [2024-11-16 21:10:06,886 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-11-16 21:10:06,947 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 21:10:06,947 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 21:10:07,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 21:10:07,028 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;@1588b443, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 21:10:07,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 21:10:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 478 states, 367 states have (on average 1.2970027247956404) internal successors, (476), 382 states have internal predecessors, (476), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-16 21:10:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 21:10:07,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 21:10:07,047 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 21:10:07,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 21:10:07,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 21:10:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1218822143, now seen corresponding path program 1 times [2024-11-16 21:10:07,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 21:10:07,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385377316] [2024-11-16 21:10:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 21:10:07,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 21:10:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 21:10:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:07,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:07,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:10:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:07,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 21:10:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 21:10:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 21:10:07,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 21:10:07,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385377316] [2024-11-16 21:10:07,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385377316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 21:10:07,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 21:10:07,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 21:10:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104011577] [2024-11-16 21:10:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 21:10:07,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 21:10:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 21:10:07,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 21:10:07,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 21:10:07,699 INFO L87 Difference]: Start difference. First operand has 478 states, 367 states have (on average 1.2970027247956404) internal successors, (476), 382 states have internal predecessors, (476), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 21:10:11,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:15,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:17,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 21:10:17,314 INFO L93 Difference]: Finished difference Result 1052 states and 1459 transitions. [2024-11-16 21:10:17,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 21:10:17,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2024-11-16 21:10:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 21:10:17,341 INFO L225 Difference]: With dead ends: 1052 [2024-11-16 21:10:17,342 INFO L226 Difference]: Without dead ends: 559 [2024-11-16 21:10:17,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 21:10:17,358 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 511 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 242 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-16 21:10:17,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 1058 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 814 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-16 21:10:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-16 21:10:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 460. [2024-11-16 21:10:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 356 states have (on average 1.2668539325842696) internal successors, (451), 364 states have internal predecessors, (451), 79 states have call successors, (79), 25 states have call predecessors, (79), 24 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-11-16 21:10:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 607 transitions. [2024-11-16 21:10:17,453 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 607 transitions. Word has length 47 [2024-11-16 21:10:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 21:10:17,453 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 607 transitions. [2024-11-16 21:10:17,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 21:10:17,454 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 607 transitions. [2024-11-16 21:10:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 21:10:17,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 21:10:17,456 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 21:10:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 21:10:17,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 21:10:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 21:10:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash 731478112, now seen corresponding path program 1 times [2024-11-16 21:10:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 21:10:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446700725] [2024-11-16 21:10:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 21:10:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 21:10:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 21:10:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:10:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 21:10:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:17,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 21:10:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 21:10:17,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 21:10:17,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446700725] [2024-11-16 21:10:17,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446700725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 21:10:17,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 21:10:17,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 21:10:17,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201694804] [2024-11-16 21:10:17,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 21:10:17,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 21:10:17,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 21:10:17,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 21:10:17,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 21:10:17,843 INFO L87 Difference]: Start difference. First operand 460 states and 607 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 21:10:21,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:25,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:29,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:31,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 21:10:31,933 INFO L93 Difference]: Finished difference Result 1519 states and 2060 transitions. [2024-11-16 21:10:31,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 21:10:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2024-11-16 21:10:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 21:10:31,943 INFO L225 Difference]: With dead ends: 1519 [2024-11-16 21:10:31,943 INFO L226 Difference]: Without dead ends: 1073 [2024-11-16 21:10:31,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-16 21:10:31,947 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 1450 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 601 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 601 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-16 21:10:31,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1282 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [601 Valid, 1154 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2024-11-16 21:10:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-16 21:10:32,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 875. [2024-11-16 21:10:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 680 states have (on average 1.2705882352941176) internal successors, (864), 695 states have internal predecessors, (864), 149 states have call successors, (149), 46 states have call predecessors, (149), 45 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2024-11-16 21:10:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1160 transitions. [2024-11-16 21:10:32,046 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1160 transitions. Word has length 47 [2024-11-16 21:10:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 21:10:32,047 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1160 transitions. [2024-11-16 21:10:32,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-16 21:10:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1160 transitions. [2024-11-16 21:10:32,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-16 21:10:32,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 21:10:32,049 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 21:10:32,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 21:10:32,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 21:10:32,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 21:10:32,050 INFO L85 PathProgramCache]: Analyzing trace with hash 871604963, now seen corresponding path program 1 times [2024-11-16 21:10:32,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 21:10:32,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375963676] [2024-11-16 21:10:32,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 21:10:32,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 21:10:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:32,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 21:10:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:32,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:32,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:10:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:32,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 21:10:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:32,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 21:10:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 21:10:32,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 21:10:32,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375963676] [2024-11-16 21:10:32,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375963676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 21:10:32,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 21:10:32,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 21:10:32,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882761822] [2024-11-16 21:10:32,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 21:10:32,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 21:10:32,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 21:10:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 21:10:32,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 21:10:32,297 INFO L87 Difference]: Start difference. First operand 875 states and 1160 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 21:10:36,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:40,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:42,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 21:10:42,464 INFO L93 Difference]: Finished difference Result 2104 states and 2881 transitions. [2024-11-16 21:10:42,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 21:10:42,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2024-11-16 21:10:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 21:10:42,480 INFO L225 Difference]: With dead ends: 2104 [2024-11-16 21:10:42,480 INFO L226 Difference]: Without dead ends: 2094 [2024-11-16 21:10:42,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-16 21:10:42,485 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 1692 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 804 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-16 21:10:42,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 1105 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [804 Valid, 960 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2024-11-16 21:10:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2024-11-16 21:10:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 1710. [2024-11-16 21:10:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1331 states have (on average 1.270473328324568) internal successors, (1691), 1360 states have internal predecessors, (1691), 289 states have call successors, (289), 90 states have call predecessors, (289), 89 states have return successors, (287), 287 states have call predecessors, (287), 287 states have call successors, (287) [2024-11-16 21:10:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2267 transitions. [2024-11-16 21:10:42,594 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2267 transitions. Word has length 50 [2024-11-16 21:10:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 21:10:42,595 INFO L471 AbstractCegarLoop]: Abstraction has 1710 states and 2267 transitions. [2024-11-16 21:10:42,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 21:10:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2267 transitions. [2024-11-16 21:10:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 21:10:42,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 21:10:42,607 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 21:10:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 21:10:42,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 21:10:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 21:10:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1040441883, now seen corresponding path program 1 times [2024-11-16 21:10:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 21:10:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128100174] [2024-11-16 21:10:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 21:10:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 21:10:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 21:10:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:10:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 21:10:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 21:10:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-16 21:10:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 21:10:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 21:10:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 21:10:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 21:10:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-16 21:10:42,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 21:10:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128100174] [2024-11-16 21:10:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128100174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 21:10:42,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 21:10:42,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 21:10:42,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046510635] [2024-11-16 21:10:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 21:10:42,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 21:10:42,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 21:10:43,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 21:10:43,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 21:10:43,000 INFO L87 Difference]: Start difference. First operand 1710 states and 2267 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 21:10:47,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:51,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:55,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:10:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 21:10:57,768 INFO L93 Difference]: Finished difference Result 6281 states and 8633 transitions. [2024-11-16 21:10:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 21:10:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-16 21:10:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 21:10:57,805 INFO L225 Difference]: With dead ends: 6281 [2024-11-16 21:10:57,806 INFO L226 Difference]: Without dead ends: 4585 [2024-11-16 21:10:57,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-16 21:10:57,817 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 1816 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 744 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 744 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-16 21:10:57,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 1565 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [744 Valid, 1396 Invalid, 3 Unknown, 0 Unchecked, 14.3s Time] [2024-11-16 21:10:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2024-11-16 21:10:57,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 3172. [2024-11-16 21:10:57,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 2461 states have (on average 1.2689963429500204) internal successors, (3123), 2518 states have internal predecessors, (3123), 535 states have call successors, (535), 176 states have call predecessors, (535), 175 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2024-11-16 21:10:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 4191 transitions. [2024-11-16 21:10:58,002 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 4191 transitions. Word has length 113 [2024-11-16 21:10:58,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 21:10:58,003 INFO L471 AbstractCegarLoop]: Abstraction has 3172 states and 4191 transitions. [2024-11-16 21:10:58,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 21:10:58,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 4191 transitions. [2024-11-16 21:10:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-16 21:10:58,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 21:10:58,011 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2024-11-16 21:10:58,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 21:10:58,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 21:10:58,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 21:10:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1822819176, now seen corresponding path program 1 times [2024-11-16 21:10:58,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 21:10:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424205861] [2024-11-16 21:10:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 21:10:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 21:10:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 21:10:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:10:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 21:10:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 21:10:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 21:10:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:10:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 21:10:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:10:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 21:10:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 21:10:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 21:10:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 21:10:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 21:10:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:10:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:10:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-16 21:10:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 21:10:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424205861] [2024-11-16 21:10:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424205861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 21:10:58,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 21:10:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 21:10:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910227027] [2024-11-16 21:10:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 21:10:58,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 21:10:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 21:10:58,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 21:10:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 21:10:58,613 INFO L87 Difference]: Start difference. First operand 3172 states and 4191 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 21:11:02,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:11:06,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:11:10,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:11:14,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:11:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 21:11:16,667 INFO L93 Difference]: Finished difference Result 7742 states and 10558 transitions. [2024-11-16 21:11:16,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 21:11:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 158 [2024-11-16 21:11:16,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 21:11:16,704 INFO L225 Difference]: With dead ends: 7742 [2024-11-16 21:11:16,704 INFO L226 Difference]: Without dead ends: 4588 [2024-11-16 21:11:16,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-16 21:11:16,721 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 761 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 419 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2024-11-16 21:11:16,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1611 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1537 Invalid, 4 Unknown, 0 Unchecked, 17.8s Time] [2024-11-16 21:11:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4588 states. [2024-11-16 21:11:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4588 to 3175. [2024-11-16 21:11:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 2464 states have (on average 1.2678571428571428) internal successors, (3124), 2521 states have internal predecessors, (3124), 535 states have call successors, (535), 176 states have call predecessors, (535), 175 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2024-11-16 21:11:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 4192 transitions. [2024-11-16 21:11:16,928 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 4192 transitions. Word has length 158 [2024-11-16 21:11:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 21:11:16,929 INFO L471 AbstractCegarLoop]: Abstraction has 3175 states and 4192 transitions. [2024-11-16 21:11:16,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 21:11:16,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 4192 transitions. [2024-11-16 21:11:16,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-16 21:11:16,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 21:11:16,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-16 21:11:16,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 21:11:16,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 21:11:16,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 21:11:16,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1303828753, now seen corresponding path program 1 times [2024-11-16 21:11:16,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 21:11:16,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708228962] [2024-11-16 21:11:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 21:11:16,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 21:11:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 21:11:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:11:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:11:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-16 21:11:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-16 21:11:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 21:11:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:11:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:11:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 21:11:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:11:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 21:11:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 21:11:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 21:11:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:11:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 21:11:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 21:11:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 21:11:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-16 21:11:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 21:11:17,700 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 21:11:17,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 21:11:17,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708228962] [2024-11-16 21:11:17,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708228962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 21:11:17,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 21:11:17,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 21:11:17,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371414481] [2024-11-16 21:11:17,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 21:11:17,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 21:11:17,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 21:11:17,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 21:11:17,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 21:11:17,703 INFO L87 Difference]: Start difference. First operand 3175 states and 4192 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 21:11:21,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:11:25,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 21:11:29,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []