./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-e2fb8be-m [2025-03-08 19:20:33,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:20:34,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:20:34,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:20:34,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:20:34,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:20:34,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:20:34,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:20:34,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:20:34,071 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:20:34,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:20:34,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:20:34,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:20:34,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:20:34,072 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:20:34,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:20:34,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:20:34,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:20:34,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:20:34,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:20:34,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-08 19:20:34,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:20:34,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:20:34,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:20:34,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:20:34,301 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:20:34,302 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 [2025-03-08 19:20:35,486 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2d14a78/00e6989774a84038acec83ee32d29f8b/FLAGc529b5b7e [2025-03-08 19:20:35,983 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:20:35,984 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 [2025-03-08 19:20:36,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2d14a78/00e6989774a84038acec83ee32d29f8b/FLAGc529b5b7e [2025-03-08 19:20:36,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b2d14a78/00e6989774a84038acec83ee32d29f8b [2025-03-08 19:20:36,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:20:36,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:20:36,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:20:36,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:20:36,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:20:36,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:20:36" (1/1) ... [2025-03-08 19:20:36,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fdc972d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:36, skipping insertion in model container [2025-03-08 19:20:36,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:20:36" (1/1) ... [2025-03-08 19:20:36,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:20:36,773 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] [2025-03-08 19:20:36,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:20:36,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:20:36,875 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] [2025-03-08 19:20:36,894 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] [2025-03-08 19:20:36,895 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] [2025-03-08 19:20:36,898 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] [2025-03-08 19:20:36,921 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] [2025-03-08 19:20:36,931 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] [2025-03-08 19:20:37,007 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] [2025-03-08 19:20:37,020 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] [2025-03-08 19:20:37,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:20:37,061 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:20:37,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37 WrapperNode [2025-03-08 19:20:37,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:20:37,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:20:37,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:20:37,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:20:37,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,167 INFO L138 Inliner]: procedures = 143, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1744 [2025-03-08 19:20:37,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:20:37,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:20:37,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:20:37,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:20:37,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,339 INFO L175 MemorySlicer]: Split 263 memory accesses to 10 slices as follows [2, 25, 1, 8, 1, 8, 192, 4, 21, 1]. 73 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 0, 0, 8, 0, 8, 13, 0, 0, 0]. The 91 writes are split as follows [0, 3, 0, 0, 1, 0, 63, 2, 21, 1]. [2025-03-08 19:20:37,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,339 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:20:37,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:20:37,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:20:37,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:20:37,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (1/1) ... [2025-03-08 19:20:37,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:20:37,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:20:37,453 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) [2025-03-08 19:20:37,458 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 [2025-03-08 19:20:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2025-03-08 19:20:37,476 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2025-03-08 19:20:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 19:20:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-08 19:20:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2025-03-08 19:20:37,477 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2025-03-08 19:20:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-08 19:20:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-08 19:20:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-08 19:20:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-08 19:20:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-08 19:20:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-08 19:20:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-08 19:20:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-08 19:20:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-08 19:20:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-08 19:20:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:20:37,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:20:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:20:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-08 19:20:37,480 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2025-03-08 19:20:37,480 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2025-03-08 19:20:37,480 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2025-03-08 19:20:37,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2025-03-08 19:20:37,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-08 19:20:37,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-08 19:20:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:20:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:20:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:20:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-08 19:20:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-08 19:20:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-08 19:20:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-08 19:20:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:20:37,483 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2025-03-08 19:20:37,483 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:20:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2025-03-08 19:20:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2025-03-08 19:20:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-08 19:20:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-08 19:20:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-03-08 19:20:37,484 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-03-08 19:20:37,484 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2025-03-08 19:20:37,485 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:20:37,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:20:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-08 19:20:37,485 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-08 19:20:37,830 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:20:37,832 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:20:37,894 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:20:37,904 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc #t~mem53; [2025-03-08 19:20:37,991 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4358: havoc __phys_addr_#t~nondet404#1; [2025-03-08 19:20:38,287 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4397: havoc blk_peek_request_#t~ret411#1.base, blk_peek_request_#t~ret411#1.offset; [2025-03-08 19:20:38,288 INFO L1307 $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; [2025-03-08 19:20:38,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4432: havoc blk_rq_map_sg_#t~nondet413#1; [2025-03-08 19:20:38,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4499: havoc virtqueue_add_buf_gfp_#t~nondet419#1; [2025-03-08 19:20:38,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: havoc blk_rq_pos_#t~mem65#1; [2025-03-08 19:20:38,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4369: havoc _raw_spin_lock_irqsave_#t~nondet406#1; [2025-03-08 19:20:38,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4502: havoc virtqueue_get_buf_#t~ret420#1.base, virtqueue_get_buf_#t~ret420#1.offset; [2025-03-08 19:20:38,288 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4453: havoc mempool_alloc_#t~ret414#1.base, mempool_alloc_#t~ret414#1.offset; [2025-03-08 19:20:38,308 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc list_empty_#t~mem12#1.base, list_empty_#t~mem12#1.offset; [2025-03-08 19:20:38,319 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc #t~nondet412; [2025-03-08 19:20:42,773 INFO L1307 $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; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc scsi_cmd_ioctl_#t~nondet418#1; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4381: havoc bio_map_kern_#t~ret408#1.base, bio_map_kern_#t~ret408#1.offset; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc _copy_to_user_#t~nondet405#1; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3344: havoc __kmalloc_#t~ret115#1.base, __kmalloc_#t~ret115#1.offset; [2025-03-08 19:20:42,773 INFO L1307 $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; [2025-03-08 19:20:42,773 INFO L1307 $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; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4472: havoc register_blkdev_#t~nondet416#1; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4456: havoc mempool_create_#t~ret415#1.base, mempool_create_#t~ret415#1.offset; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4391: havoc blk_execute_rq_#t~nondet409#1; [2025-03-08 19:20:42,773 INFO L1307 $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; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: havoc register_virtio_driver_#t~nondet417#1; [2025-03-08 19:20:42,773 INFO L1307 $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; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc get_capacity_#t~mem27#1; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4394: havoc blk_init_queue_#t~ret410#1.base, blk_init_queue_#t~ret410#1.offset; [2025-03-08 19:20:42,773 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: havoc alloc_disk_#t~ret407#1.base, alloc_disk_#t~ret407#1.offset; [2025-03-08 19:20:42,966 INFO L? ?]: Removed 975 outVars from TransFormulas that were not future-live. [2025-03-08 19:20:42,966 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:20:42,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:20:42,988 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 19:20:42,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:20:42 BoogieIcfgContainer [2025-03-08 19:20:42,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:20:42,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:20:42,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:20:42,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:20:42,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:20:36" (1/3) ... [2025-03-08 19:20:42,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b97b16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:20:42, skipping insertion in model container [2025-03-08 19:20:42,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:20:37" (2/3) ... [2025-03-08 19:20:42,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b97b16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:20:42, skipping insertion in model container [2025-03-08 19:20:42,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:20:42" (3/3) ... [2025-03-08 19:20:42,995 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-03-08 19:20:43,004 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:20:43,006 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i that has 27 procedures, 469 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 19:20:43,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:20:43,059 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;@370034ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:20:43,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:20:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 357 states have (on average 1.3053221288515406) internal successors, (466), 372 states have internal predecessors, (466), 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) [2025-03-08 19:20:43,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 19:20:43,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:43,071 INFO L218 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] [2025-03-08 19:20:43,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:43,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:43,074 INFO L85 PathProgramCache]: Analyzing trace with hash 897461776, now seen corresponding path program 1 times [2025-03-08 19:20:43,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221164354] [2025-03-08 19:20:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:43,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:20:43,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:20:43,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:43,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:43,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 19:20:43,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:43,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221164354] [2025-03-08 19:20:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221164354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:20:43,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:20:43,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 19:20:43,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909275458] [2025-03-08 19:20:43,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:20:43,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 19:20:43,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:43,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 19:20:43,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:20:43,489 INFO L87 Difference]: Start difference. First operand has 468 states, 357 states have (on average 1.3053221288515406) internal successors, (466), 372 states have internal predecessors, (466), 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 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:20:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:43,563 INFO L93 Difference]: Finished difference Result 931 states and 1273 transitions. [2025-03-08 19:20:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 19:20:43,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 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 46 [2025-03-08 19:20:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:43,581 INFO L225 Difference]: With dead ends: 931 [2025-03-08 19:20:43,581 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 19:20:43,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 19:20:43,592 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:43,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 621 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:20:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 19:20:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2025-03-08 19:20:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 346 states have (on average 1.2745664739884393) internal successors, (441), 354 states have internal predecessors, (441), 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) [2025-03-08 19:20:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 597 transitions. [2025-03-08 19:20:43,653 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 597 transitions. Word has length 46 [2025-03-08 19:20:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:43,654 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 597 transitions. [2025-03-08 19:20:43,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:20:43,654 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 597 transitions. [2025-03-08 19:20:43,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 19:20:43,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:43,655 INFO L218 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] [2025-03-08 19:20:43,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:20:43,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:43,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1672024623, now seen corresponding path program 1 times [2025-03-08 19:20:43,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:43,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702335467] [2025-03-08 19:20:43,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:43,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 19:20:43,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 19:20:43,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:43,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 19:20:43,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702335467] [2025-03-08 19:20:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702335467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:20:43,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:20:43,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:20:43,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033599891] [2025-03-08 19:20:43,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:20:43,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:20:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:43,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:20:43,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:20:43,944 INFO L87 Difference]: Start difference. First operand 450 states and 597 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 19:20:47,956 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 [] [2025-03-08 19:20:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:48,059 INFO L93 Difference]: Finished difference Result 1295 states and 1726 transitions. [2025-03-08 19:20:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:20:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 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 46 [2025-03-08 19:20:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:48,067 INFO L225 Difference]: With dead ends: 1295 [2025-03-08 19:20:48,067 INFO L226 Difference]: Without dead ends: 859 [2025-03-08 19:20:48,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:20:48,071 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 546 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:48,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1172 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 19:20:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-08 19:20:48,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2025-03-08 19:20:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 661 states have (on average 1.2783661119515886) internal successors, (845), 676 states have internal predecessors, (845), 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) [2025-03-08 19:20:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1141 transitions. [2025-03-08 19:20:48,128 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1141 transitions. Word has length 46 [2025-03-08 19:20:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:48,128 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1141 transitions. [2025-03-08 19:20:48,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-08 19:20:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1141 transitions. [2025-03-08 19:20:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 19:20:48,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:48,130 INFO L218 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] [2025-03-08 19:20:48,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:20:48,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:48,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1347412783, now seen corresponding path program 1 times [2025-03-08 19:20:48,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:48,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119794674] [2025-03-08 19:20:48,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:48,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 19:20:48,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 19:20:48,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:48,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 19:20:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119794674] [2025-03-08 19:20:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119794674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:20:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:20:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:20:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747323733] [2025-03-08 19:20:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:20:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:20:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:48,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:20:48,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:20:48,306 INFO L87 Difference]: Start difference. First operand 856 states and 1141 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:20:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:48,389 INFO L93 Difference]: Finished difference Result 1682 states and 2243 transitions. [2025-03-08 19:20:48,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:20:48,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 2 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 49 [2025-03-08 19:20:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:48,399 INFO L225 Difference]: With dead ends: 1682 [2025-03-08 19:20:48,399 INFO L226 Difference]: Without dead ends: 1673 [2025-03-08 19:20:48,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:20:48,401 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 569 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:48,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1165 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:20:48,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-03-08 19:20:48,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-03-08 19:20:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1294 states have (on average 1.278207109737249) internal successors, (1654), 1323 states have internal predecessors, (1654), 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) [2025-03-08 19:20:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2230 transitions. [2025-03-08 19:20:48,491 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2230 transitions. Word has length 49 [2025-03-08 19:20:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:48,491 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2230 transitions. [2025-03-08 19:20:48,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 19:20:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2230 transitions. [2025-03-08 19:20:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 19:20:48,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:48,500 INFO L218 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] [2025-03-08 19:20:48,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:20:48,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash 383295849, now seen corresponding path program 1 times [2025-03-08 19:20:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:48,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129608973] [2025-03-08 19:20:48,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:48,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 19:20:48,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 19:20:48,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:48,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 19:20:48,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:48,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129608973] [2025-03-08 19:20:48,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129608973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:20:48,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:20:48,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:20:48,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118306509] [2025-03-08 19:20:48,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:20:48,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:20:48,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:48,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:20:48,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:20:48,715 INFO L87 Difference]: Start difference. First operand 1673 states and 2230 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 19:20:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:48,840 INFO L93 Difference]: Finished difference Result 4770 states and 6346 transitions. [2025-03-08 19:20:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:20:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 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 110 [2025-03-08 19:20:48,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:48,858 INFO L225 Difference]: With dead ends: 4770 [2025-03-08 19:20:48,859 INFO L226 Difference]: Without dead ends: 3111 [2025-03-08 19:20:48,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:20:48,869 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 504 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:48,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1175 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:20:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-03-08 19:20:48,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3103. [2025-03-08 19:20:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 2392 states have (on average 1.2767558528428093) internal successors, (3054), 2449 states have internal predecessors, (3054), 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) [2025-03-08 19:20:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4122 transitions. [2025-03-08 19:20:49,022 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4122 transitions. Word has length 110 [2025-03-08 19:20:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:49,023 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4122 transitions. [2025-03-08 19:20:49,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 19:20:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4122 transitions. [2025-03-08 19:20:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 19:20:49,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:49,031 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:20:49,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:20:49,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:49,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2082416553, now seen corresponding path program 1 times [2025-03-08 19:20:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:49,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239835253] [2025-03-08 19:20:49,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 19:20:49,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 19:20:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 19:20:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239835253] [2025-03-08 19:20:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239835253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:20:49,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:20:49,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:20:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777658161] [2025-03-08 19:20:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:20:49,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:20:49,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:49,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:20:49,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:20:49,401 INFO L87 Difference]: Start difference. First operand 3103 states and 4122 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:20:53,410 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 [] [2025-03-08 19:20:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:53,532 INFO L93 Difference]: Finished difference Result 6199 states and 8239 transitions. [2025-03-08 19:20:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:20:53,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 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 153 [2025-03-08 19:20:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:53,552 INFO L225 Difference]: With dead ends: 6199 [2025-03-08 19:20:53,552 INFO L226 Difference]: Without dead ends: 3114 [2025-03-08 19:20:53,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:20:53,563 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 6 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1775 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:53,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1775 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-03-08 19:20:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2025-03-08 19:20:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3106. [2025-03-08 19:20:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 2395 states have (on average 1.2755741127348643) internal successors, (3055), 2452 states have internal predecessors, (3055), 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) [2025-03-08 19:20:53,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4123 transitions. [2025-03-08 19:20:53,660 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4123 transitions. Word has length 153 [2025-03-08 19:20:53,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:53,661 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 4123 transitions. [2025-03-08 19:20:53,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:20:53,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4123 transitions. [2025-03-08 19:20:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 19:20:53,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:53,666 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:20:53,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:20:53,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:53,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:53,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1863243341, now seen corresponding path program 1 times [2025-03-08 19:20:53,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:53,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798686925] [2025-03-08 19:20:53,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:53,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 19:20:53,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 19:20:53,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:53,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-08 19:20:54,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:54,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798686925] [2025-03-08 19:20:54,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798686925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:20:54,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:20:54,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 19:20:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197606552] [2025-03-08 19:20:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:20:54,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 19:20:54,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:54,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 19:20:54,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:20:54,148 INFO L87 Difference]: Start difference. First operand 3106 states and 4123 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:20:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:54,246 INFO L93 Difference]: Finished difference Result 6208 states and 8293 transitions. [2025-03-08 19:20:54,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 19:20:54,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 154 [2025-03-08 19:20:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:54,302 INFO L225 Difference]: With dead ends: 6208 [2025-03-08 19:20:54,303 INFO L226 Difference]: Without dead ends: 3122 [2025-03-08 19:20:54,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 19:20:54,310 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 0 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2363 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:54,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2363 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:20:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2025-03-08 19:20:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3110. [2025-03-08 19:20:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3110 states, 2397 states have (on average 1.2753441802252816) internal successors, (3057), 2456 states have internal predecessors, (3057), 535 states have call successors, (535), 176 states have call predecessors, (535), 177 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2025-03-08 19:20:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 4141 transitions. [2025-03-08 19:20:54,410 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 4141 transitions. Word has length 154 [2025-03-08 19:20:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:54,411 INFO L471 AbstractCegarLoop]: Abstraction has 3110 states and 4141 transitions. [2025-03-08 19:20:54,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 19:20:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 4141 transitions. [2025-03-08 19:20:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 19:20:54,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:54,417 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 19:20:54,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 19:20:54,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:54,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:54,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1226223635, now seen corresponding path program 1 times [2025-03-08 19:20:54,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:54,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530343310] [2025-03-08 19:20:54,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:54,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:54,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 19:20:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 19:20:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 19:20:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530343310] [2025-03-08 19:20:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530343310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:20:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623602126] [2025-03-08 19:20:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:54,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:20:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:20:54,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:20:54,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 19:20:55,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 19:20:55,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 19:20:55,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:55,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:55,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 19:20:55,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:20:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-08 19:20:55,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 19:20:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623602126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:20:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 19:20:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 19:20:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062091087] [2025-03-08 19:20:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:20:55,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:20:55,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:55,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:20:55,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:20:55,856 INFO L87 Difference]: Start difference. First operand 3110 states and 4141 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 19:20:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:55,981 INFO L93 Difference]: Finished difference Result 6208 states and 8270 transitions. [2025-03-08 19:20:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:20:55,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2025-03-08 19:20:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:56,001 INFO L225 Difference]: With dead ends: 6208 [2025-03-08 19:20:56,001 INFO L226 Difference]: Without dead ends: 3111 [2025-03-08 19:20:56,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 19:20:56,013 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 0 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:56,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1770 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 19:20:56,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-03-08 19:20:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2025-03-08 19:20:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 2398 states have (on average 1.275229357798165) internal successors, (3058), 2457 states have internal predecessors, (3058), 535 states have call successors, (535), 176 states have call predecessors, (535), 177 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2025-03-08 19:20:56,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 4142 transitions. [2025-03-08 19:20:56,121 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 4142 transitions. Word has length 175 [2025-03-08 19:20:56,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:56,121 INFO L471 AbstractCegarLoop]: Abstraction has 3111 states and 4142 transitions. [2025-03-08 19:20:56,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 19:20:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 4142 transitions. [2025-03-08 19:20:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 19:20:56,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:56,129 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 19:20:56,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 19:20:56,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:20:56,331 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:56,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 855797195, now seen corresponding path program 1 times [2025-03-08 19:20:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811769420] [2025-03-08 19:20:56,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:56,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 19:20:56,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 19:20:56,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:56,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:56,888 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 19:20:56,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:56,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811769420] [2025-03-08 19:20:56,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811769420] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:20:56,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432733117] [2025-03-08 19:20:56,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:20:56,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:20:56,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:20:56,892 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:20:56,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 19:20:57,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 19:20:57,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 19:20:57,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:20:57,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:57,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 19:20:57,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 19:20:57,866 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-08 19:20:57,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 19:20:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 19:20:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432733117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 19:20:58,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 19:20:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2025-03-08 19:20:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536647930] [2025-03-08 19:20:58,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 19:20:58,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 19:20:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:20:58,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 19:20:58,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-08 19:20:58,079 INFO L87 Difference]: Start difference. First operand 3111 states and 4142 transitions. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 2 states have call successors, (31), 2 states have call predecessors, (31), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 19:20:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:20:58,359 INFO L93 Difference]: Finished difference Result 6222 states and 8287 transitions. [2025-03-08 19:20:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 19:20:58,360 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 2 states have call successors, (31), 2 states have call predecessors, (31), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 177 [2025-03-08 19:20:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:20:58,376 INFO L225 Difference]: With dead ends: 6222 [2025-03-08 19:20:58,377 INFO L226 Difference]: Without dead ends: 3121 [2025-03-08 19:20:58,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-08 19:20:58,389 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 11 mSDsluCounter, 3524 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4113 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:20:58,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4113 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:20:58,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2025-03-08 19:20:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3121. [2025-03-08 19:20:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 2407 states have (on average 1.2746157041960948) internal successors, (3068), 2466 states have internal predecessors, (3068), 535 states have call successors, (535), 177 states have call predecessors, (535), 178 states have return successors, (549), 533 states have call predecessors, (549), 533 states have call successors, (549) [2025-03-08 19:20:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4152 transitions. [2025-03-08 19:20:58,488 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4152 transitions. Word has length 177 [2025-03-08 19:20:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:20:58,489 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 4152 transitions. [2025-03-08 19:20:58,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 2 states have call successors, (31), 2 states have call predecessors, (31), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-08 19:20:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4152 transitions. [2025-03-08 19:20:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 19:20:58,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:20:58,494 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-08 19:20:58,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 19:20:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 19:20:58,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:20:58,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:20:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -37681933, now seen corresponding path program 2 times [2025-03-08 19:20:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:20:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085762969] [2025-03-08 19:20:58,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:20:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:20:58,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-08 19:20:58,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 19:20:58,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 19:20:58,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:20:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 19:20:59,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:20:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085762969] [2025-03-08 19:20:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085762969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 19:20:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952554046] [2025-03-08 19:20:59,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 19:20:59,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 19:20:59,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:20:59,276 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 19:20:59,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 19:20:59,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes.