./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 798a7b37 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-?-798a7b3-m [2025-03-04 04:09:02,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:09:02,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:09:02,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:09:02,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:09:02,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:09:02,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:09:02,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:09:02,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:09:02,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:09:02,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:09:02,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:09:02,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:09:02,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:09:02,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:09:02,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:09:02,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:09:02,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:09:02,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:09:02,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:09:02,423 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-04 04:09:02,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:09:02,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:09:02,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:09:02,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:09:02,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:09:02,689 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-04 04:09:03,831 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b47bb46/9a96dd39123f475683eed7cd4eaa7da4/FLAG3b35ab2f9 [2025-03-04 04:09:04,304 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:09:04,305 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-04 04:09:04,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b47bb46/9a96dd39123f475683eed7cd4eaa7da4/FLAG3b35ab2f9 [2025-03-04 04:09:04,357 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b47bb46/9a96dd39123f475683eed7cd4eaa7da4 [2025-03-04 04:09:04,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:09:04,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:09:04,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:09:04,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:09:04,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:09:04,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:09:04" (1/1) ... [2025-03-04 04:09:04,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe91a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:04, skipping insertion in model container [2025-03-04 04:09:04,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:09:04" (1/1) ... [2025-03-04 04:09:04,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:09:05,075 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-04 04:09:05,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:09:05,119 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:09:05,186 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-04 04:09:05,204 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-04 04:09:05,206 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-04 04:09:05,207 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-04 04:09:05,237 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-04 04:09:05,243 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-04 04:09:05,321 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-04 04:09:05,334 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-04 04:09:05,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:09:05,378 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:09:05,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05 WrapperNode [2025-03-04 04:09:05,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:09:05,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:09:05,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:09:05,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:09:05,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,506 INFO L138 Inliner]: procedures = 143, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1744 [2025-03-04 04:09:05,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:09:05,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:09:05,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:09:05,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:09:05,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,708 INFO L175 MemorySlicer]: Split 263 memory accesses to 10 slices as follows [2, 8, 192, 4, 8, 25, 21, 1, 1, 1]. 73 percent of accesses are in the largest equivalence class. The 31 initializations are split as follows [2, 8, 13, 0, 8, 0, 0, 0, 0, 0]. The 91 writes are split as follows [0, 0, 63, 2, 0, 3, 21, 1, 0, 1]. [2025-03-04 04:09:05,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:09:05,792 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:09:05,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:09:05,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:09:05,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (1/1) ... [2025-03-04 04:09:05,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:09:05,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:05,827 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-04 04:09:05,833 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-04 04:09:05,847 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2025-03-04 04:09:05,848 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2025-03-04 04:09:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:09:05,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2025-03-04 04:09:05,849 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:09:05,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:09:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:09:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:09:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:09:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:09:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:09:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:09:05,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:09:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:09:05,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-03-04 04:09:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2025-03-04 04:09:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2025-03-04 04:09:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:09:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2025-03-04 04:09:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2025-03-04 04:09:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:09:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:09:05,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2025-03-04 04:09:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2025-03-04 04:09:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-04 04:09:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 04:09:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:09:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2025-03-04 04:09:05,854 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2025-03-04 04:09:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2025-03-04 04:09:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2025-03-04 04:09:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:09:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:09:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:09:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:09:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:09:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:09:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:09:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:09:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:09:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:09:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:09:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:09:05,858 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 04:09:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 04:09:06,205 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:09:06,207 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:09:06,265 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:09:06,274 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc #t~mem53; [2025-03-04 04:09:06,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4358: havoc __phys_addr_#t~nondet404#1; [2025-03-04 04:09:06,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4397: havoc blk_peek_request_#t~ret411#1.base, blk_peek_request_#t~ret411#1.offset; [2025-03-04 04:09:06,739 INFO L1325 $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-04 04:09:06,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4432: havoc blk_rq_map_sg_#t~nondet413#1; [2025-03-04 04:09:06,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4499: havoc virtqueue_add_buf_gfp_#t~nondet419#1; [2025-03-04 04:09:06,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3211: havoc blk_rq_pos_#t~mem65#1; [2025-03-04 04:09:06,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4369: havoc _raw_spin_lock_irqsave_#t~nondet406#1; [2025-03-04 04:09:06,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4502: havoc virtqueue_get_buf_#t~ret420#1.base, virtqueue_get_buf_#t~ret420#1.offset; [2025-03-04 04:09:06,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4453: havoc mempool_alloc_#t~ret414#1.base, mempool_alloc_#t~ret414#1.offset; [2025-03-04 04:09:06,763 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3127: havoc list_empty_#t~mem12#1.base, list_empty_#t~mem12#1.offset; [2025-03-04 04:09:06,775 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4425: havoc #t~nondet412; [2025-03-04 04:09:11,231 INFO L1325 $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-04 04:09:11,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4480: havoc scsi_cmd_ioctl_#t~nondet418#1; [2025-03-04 04:09:11,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4381: havoc bio_map_kern_#t~ret408#1.base, bio_map_kern_#t~ret408#1.offset; [2025-03-04 04:09:11,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4365: havoc _copy_to_user_#t~nondet405#1; [2025-03-04 04:09:11,232 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3344: havoc __kmalloc_#t~ret115#1.base, __kmalloc_#t~ret115#1.offset; [2025-03-04 04:09:11,232 INFO L1325 $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-04 04:09:11,232 INFO L1325 $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-04 04:09:11,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4472: havoc register_blkdev_#t~nondet416#1; [2025-03-04 04:09:11,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4456: havoc mempool_create_#t~ret415#1.base, mempool_create_#t~ret415#1.offset; [2025-03-04 04:09:11,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4391: havoc blk_execute_rq_#t~nondet409#1; [2025-03-04 04:09:11,233 INFO L1325 $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-04 04:09:11,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4476: havoc register_virtio_driver_#t~nondet417#1; [2025-03-04 04:09:11,233 INFO L1325 $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-04 04:09:11,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3155: havoc get_capacity_#t~mem27#1; [2025-03-04 04:09:11,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4394: havoc blk_init_queue_#t~ret410#1.base, blk_init_queue_#t~ret410#1.offset; [2025-03-04 04:09:11,233 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4378: havoc alloc_disk_#t~ret407#1.base, alloc_disk_#t~ret407#1.offset; [2025-03-04 04:09:11,426 INFO L? ?]: Removed 975 outVars from TransFormulas that were not future-live. [2025-03-04 04:09:11,427 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:09:11,457 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:09:11,457 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 04:09:11,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:09:11 BoogieIcfgContainer [2025-03-04 04:09:11,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:09:11,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:09:11,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:09:11,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:09:11,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:09:04" (1/3) ... [2025-03-04 04:09:11,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be06821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:09:11, skipping insertion in model container [2025-03-04 04:09:11,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:09:05" (2/3) ... [2025-03-04 04:09:11,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be06821 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:09:11, skipping insertion in model container [2025-03-04 04:09:11,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:09:11" (3/3) ... [2025-03-04 04:09:11,469 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-04 04:09:11,480 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:09:11,482 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-04 04:09:11,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:09:11,553 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;@91fafd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:09:11,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:09:11,558 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-04 04:09:11,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 04:09:11,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:11,567 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-04 04:09:11,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:11,571 INFO L85 PathProgramCache]: Analyzing trace with hash 897461776, now seen corresponding path program 1 times [2025-03-04 04:09:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525735214] [2025-03-04 04:09:11,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:11,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 04:09:11,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 04:09:11,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:11,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:11,980 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-04 04:09:11,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:11,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525735214] [2025-03-04 04:09:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525735214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:11,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 04:09:11,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668104351] [2025-03-04 04:09:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:11,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 04:09:11,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:11,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 04:09:11,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 04:09:12,000 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-04 04:09:12,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:12,064 INFO L93 Difference]: Finished difference Result 931 states and 1273 transitions. [2025-03-04 04:09:12,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 04:09:12,065 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-04 04:09:12,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:12,073 INFO L225 Difference]: With dead ends: 931 [2025-03-04 04:09:12,073 INFO L226 Difference]: Without dead ends: 450 [2025-03-04 04:09:12,078 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-04 04:09:12,082 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-04 04:09:12,082 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-04 04:09:12,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-04 04:09:12,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2025-03-04 04:09:12,117 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-04 04:09:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 597 transitions. [2025-03-04 04:09:12,124 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 597 transitions. Word has length 46 [2025-03-04 04:09:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:12,124 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 597 transitions. [2025-03-04 04:09:12,125 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-04 04:09:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 597 transitions. [2025-03-04 04:09:12,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 04:09:12,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:12,127 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-04 04:09:12,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:09:12,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:12,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1672024623, now seen corresponding path program 1 times [2025-03-04 04:09:12,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:12,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305475370] [2025-03-04 04:09:12,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:12,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:12,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 04:09:12,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 04:09:12,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:12,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:12,412 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-04 04:09:12,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:12,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305475370] [2025-03-04 04:09:12,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305475370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064754243] [2025-03-04 04:09:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:12,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:12,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:12,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:12,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:12,415 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-04 04:09:16,427 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-04 04:09:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:16,530 INFO L93 Difference]: Finished difference Result 1295 states and 1726 transitions. [2025-03-04 04:09:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:16,530 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-04 04:09:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:16,536 INFO L225 Difference]: With dead ends: 1295 [2025-03-04 04:09:16,536 INFO L226 Difference]: Without dead ends: 859 [2025-03-04 04:09:16,538 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-04 04:09:16,538 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:16,539 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.1s Time] [2025-03-04 04:09:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-03-04 04:09:16,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 856. [2025-03-04 04:09:16,573 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-04 04:09:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1141 transitions. [2025-03-04 04:09:16,579 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1141 transitions. Word has length 46 [2025-03-04 04:09:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:16,580 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1141 transitions. [2025-03-04 04:09:16,580 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-04 04:09:16,580 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1141 transitions. [2025-03-04 04:09:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 04:09:16,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:16,583 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-04 04:09:16,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:09:16,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:16,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1347412783, now seen corresponding path program 1 times [2025-03-04 04:09:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:16,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064382534] [2025-03-04 04:09:16,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:16,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 04:09:16,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 04:09:16,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:16,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:16,791 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-04 04:09:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064382534] [2025-03-04 04:09:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064382534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:16,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:16,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011305506] [2025-03-04 04:09:16,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:16,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:16,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:16,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:16,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:16,793 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-04 04:09:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:16,898 INFO L93 Difference]: Finished difference Result 1682 states and 2243 transitions. [2025-03-04 04:09:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:16,899 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-04 04:09:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:16,910 INFO L225 Difference]: With dead ends: 1682 [2025-03-04 04:09:16,911 INFO L226 Difference]: Without dead ends: 1673 [2025-03-04 04:09:16,912 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-04 04:09:16,913 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-04 04:09:16,913 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-04 04:09:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-03-04 04:09:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-03-04 04:09:16,975 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-04 04:09:16,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 2230 transitions. [2025-03-04 04:09:16,988 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 2230 transitions. Word has length 49 [2025-03-04 04:09:16,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:16,989 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 2230 transitions. [2025-03-04 04:09:16,989 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-04 04:09:16,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 2230 transitions. [2025-03-04 04:09:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 04:09:16,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:16,996 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-04 04:09:16,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:09:16,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:16,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:16,997 INFO L85 PathProgramCache]: Analyzing trace with hash 383295849, now seen corresponding path program 1 times [2025-03-04 04:09:16,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:16,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672061534] [2025-03-04 04:09:16,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:16,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:17,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 04:09:17,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 04:09:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:17,192 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-04 04:09:17,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672061534] [2025-03-04 04:09:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672061534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:17,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:17,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:09:17,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197832850] [2025-03-04 04:09:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:17,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:09:17,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:17,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:09:17,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:09:17,194 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-04 04:09:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:17,350 INFO L93 Difference]: Finished difference Result 4770 states and 6346 transitions. [2025-03-04 04:09:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:09:17,351 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-04 04:09:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:17,372 INFO L225 Difference]: With dead ends: 4770 [2025-03-04 04:09:17,373 INFO L226 Difference]: Without dead ends: 3111 [2025-03-04 04:09:17,380 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-04 04:09:17,381 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:09:17,382 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.1s Time] [2025-03-04 04:09:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-03-04 04:09:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3103. [2025-03-04 04:09:17,527 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-04 04:09:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 4122 transitions. [2025-03-04 04:09:17,554 INFO L78 Accepts]: Start accepts. Automaton has 3103 states and 4122 transitions. Word has length 110 [2025-03-04 04:09:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:17,554 INFO L471 AbstractCegarLoop]: Abstraction has 3103 states and 4122 transitions. [2025-03-04 04:09:17,555 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-04 04:09:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3103 states and 4122 transitions. [2025-03-04 04:09:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-04 04:09:17,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:17,566 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-04 04:09:17,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:09:17,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:17,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2082416553, now seen corresponding path program 1 times [2025-03-04 04:09:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566959398] [2025-03-04 04:09:17,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:17,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-04 04:09:17,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-04 04:09:17,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:17,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:17,964 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-04 04:09:17,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:17,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566959398] [2025-03-04 04:09:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566959398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:17,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:17,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:09:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100865068] [2025-03-04 04:09:17,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:17,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:17,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:17,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:09:17,967 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-04 04:09:21,980 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-04 04:09:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:22,099 INFO L93 Difference]: Finished difference Result 6199 states and 8239 transitions. [2025-03-04 04:09:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:22,100 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-04 04:09:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:22,119 INFO L225 Difference]: With dead ends: 6199 [2025-03-04 04:09:22,119 INFO L226 Difference]: Without dead ends: 3114 [2025-03-04 04:09:22,130 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-04 04:09:22,131 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-04 04:09:22,131 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-04 04:09:22,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3114 states. [2025-03-04 04:09:22,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3114 to 3106. [2025-03-04 04:09:22,241 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-04 04:09:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 4123 transitions. [2025-03-04 04:09:22,260 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 4123 transitions. Word has length 153 [2025-03-04 04:09:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:22,260 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 4123 transitions. [2025-03-04 04:09:22,261 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-04 04:09:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 4123 transitions. [2025-03-04 04:09:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-04 04:09:22,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:22,266 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-04 04:09:22,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:09:22,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:22,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1863243341, now seen corresponding path program 1 times [2025-03-04 04:09:22,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:22,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517448665] [2025-03-04 04:09:22,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:22,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:22,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-04 04:09:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-04 04:09:22,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:22,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:22,849 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-04 04:09:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517448665] [2025-03-04 04:09:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517448665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:22,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:09:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:09:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315200618] [2025-03-04 04:09:22,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:09:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:22,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:09:22,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:09:22,852 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-04 04:09:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:22,997 INFO L93 Difference]: Finished difference Result 6208 states and 8293 transitions. [2025-03-04 04:09:22,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:09:22,999 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-04 04:09:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:23,022 INFO L225 Difference]: With dead ends: 6208 [2025-03-04 04:09:23,023 INFO L226 Difference]: Without dead ends: 3122 [2025-03-04 04:09:23,033 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-04 04:09:23,034 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-04 04:09:23,034 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-04 04:09:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2025-03-04 04:09:23,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 3110. [2025-03-04 04:09:23,135 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-04 04:09:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3110 states to 3110 states and 4141 transitions. [2025-03-04 04:09:23,157 INFO L78 Accepts]: Start accepts. Automaton has 3110 states and 4141 transitions. Word has length 154 [2025-03-04 04:09:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:23,158 INFO L471 AbstractCegarLoop]: Abstraction has 3110 states and 4141 transitions. [2025-03-04 04:09:23,158 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-04 04:09:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3110 states and 4141 transitions. [2025-03-04 04:09:23,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 04:09:23,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:23,165 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-04 04:09:23,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:09:23,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1226223635, now seen corresponding path program 1 times [2025-03-04 04:09:23,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:23,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160675066] [2025-03-04 04:09:23,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:23,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 04:09:23,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 04:09:23,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:23,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:23,765 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-04 04:09:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160675066] [2025-03-04 04:09:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160675066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976339055] [2025-03-04 04:09:23,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:23,769 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-04 04:09:23,771 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-04 04:09:24,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 04:09:24,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 04:09:24,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:24,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:24,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 04:09:24,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:24,535 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-04 04:09:24,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 04:09:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976339055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:09:24,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 04:09:24,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 04:09:24,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545296173] [2025-03-04 04:09:24,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:09:24,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:09:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:24,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:09:24,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 04:09:24,540 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-04 04:09:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:24,672 INFO L93 Difference]: Finished difference Result 6208 states and 8270 transitions. [2025-03-04 04:09:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:09:24,673 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-04 04:09:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:24,690 INFO L225 Difference]: With dead ends: 6208 [2025-03-04 04:09:24,691 INFO L226 Difference]: Without dead ends: 3111 [2025-03-04 04:09:24,702 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-04 04:09:24,703 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-04 04:09:24,703 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-04 04:09:24,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-03-04 04:09:24,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 3111. [2025-03-04 04:09:24,798 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-04 04:09:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 4142 transitions. [2025-03-04 04:09:24,817 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 4142 transitions. Word has length 175 [2025-03-04 04:09:24,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:24,817 INFO L471 AbstractCegarLoop]: Abstraction has 3111 states and 4142 transitions. [2025-03-04 04:09:24,817 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-04 04:09:24,817 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 4142 transitions. [2025-03-04 04:09:24,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 04:09:24,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:24,824 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-04 04:09:24,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 04:09:25,024 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-04 04:09:25,026 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:25,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:25,026 INFO L85 PathProgramCache]: Analyzing trace with hash 855797195, now seen corresponding path program 1 times [2025-03-04 04:09:25,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:25,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732355753] [2025-03-04 04:09:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:25,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:25,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 04:09:25,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 04:09:25,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:25,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:25,654 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-04 04:09:25,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732355753] [2025-03-04 04:09:25,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732355753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892228090] [2025-03-04 04:09:25,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:09:25,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:25,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:25,657 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-04 04:09:25,658 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-04 04:09:26,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 04:09:26,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 04:09:26,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:09:26,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:26,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1378 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 04:09:26,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:09:26,404 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-04 04:09:26,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:09:26,606 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-04 04:09:26,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892228090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 04:09:26,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 04:09:26,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2025-03-04 04:09:26,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44657831] [2025-03-04 04:09:26,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 04:09:26,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 04:09:26,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:09:26,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 04:09:26,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 04:09:26,609 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-04 04:09:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:09:26,902 INFO L93 Difference]: Finished difference Result 6222 states and 8287 transitions. [2025-03-04 04:09:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 04:09:26,903 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-04 04:09:26,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:09:26,917 INFO L225 Difference]: With dead ends: 6222 [2025-03-04 04:09:26,917 INFO L226 Difference]: Without dead ends: 3121 [2025-03-04 04:09:26,924 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-04 04:09:26,924 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-04 04:09:26,925 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-04 04:09:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3121 states. [2025-03-04 04:09:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3121 to 3121. [2025-03-04 04:09:26,994 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-04 04:09:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4152 transitions. [2025-03-04 04:09:27,014 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4152 transitions. Word has length 177 [2025-03-04 04:09:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:09:27,014 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 4152 transitions. [2025-03-04 04:09:27,014 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-04 04:09:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4152 transitions. [2025-03-04 04:09:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 04:09:27,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:09:27,020 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-04 04:09:27,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 04:09:27,222 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-04 04:09:27,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:09:27,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:09:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash -37681933, now seen corresponding path program 2 times [2025-03-04 04:09:27,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:09:27,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507589698] [2025-03-04 04:09:27,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:09:27,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:09:27,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-04 04:09:27,414 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 04:09:27,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 04:09:27,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:09:27,895 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-04 04:09:27,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:09:27,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507589698] [2025-03-04 04:09:27,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507589698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:09:27,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932717653] [2025-03-04 04:09:27,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 04:09:27,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:09:27,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:09:27,899 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-04 04:09:27,900 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-04 04:09:28,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes.