./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 13:46:25,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 13:46:25,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 13:46:25,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 13:46:25,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 13:46:25,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 13:46:25,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 13:46:25,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 13:46:25,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 13:46:25,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 13:46:25,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 13:46:25,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 13:46:25,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 13:46:25,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 13:46:25,784 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 13:46:25,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 13:46:25,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 13:46:25,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 13:46:25,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 13:46:25,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 13:46:25,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 13:46:25,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 13:46:25,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 13:46:25,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 13:46:25,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 13:46:25,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 13:46:25,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 13:46:25,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 13:46:25,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 13:46:25,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:46:25,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 13:46:25,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 13:46:25,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 13:46:25,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 13:46:25,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 13:46:25,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 13:46:25,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 13:46:25,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 13:46:25,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 13:46:25,793 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 [2024-10-24 13:46:26,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 13:46:26,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 13:46:26,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 13:46:26,129 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 13:46:26,130 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 13:46:26,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-10-24 13:46:27,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 13:46:27,980 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 13:46:27,981 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-10-24 13:46:28,018 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c380768/e81581be3a1742989605316300dde7d3/FLAG8daa386f3 [2024-10-24 13:46:28,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27c380768/e81581be3a1742989605316300dde7d3 [2024-10-24 13:46:28,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 13:46:28,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 13:46:28,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 13:46:28,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 13:46:28,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 13:46:28,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:28" (1/1) ... [2024-10-24 13:46:28,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16c607f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:28, skipping insertion in model container [2024-10-24 13:46:28,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:46:28" (1/1) ... [2024-10-24 13:46:28,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 13:46:29,242 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-10-24 13:46:29,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:46:29,319 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 13:46:29,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3095-3096] [2024-10-24 13:46:29,428 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (63), "i" (12UL)); [3374-3375] [2024-10-24 13:46:29,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (65), "i" (12UL)); [3382-3383] [2024-10-24 13:46:29,433 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (66), "i" (12UL)); [3390-3391] [2024-10-24 13:46:29,472 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (123), "i" (12UL)); [3605-3606] [2024-10-24 13:46:29,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (177), "i" (12UL)); [3680-3681] [2024-10-24 13:46:29,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (467), "i" (12UL)); [4002-4003] [2024-10-24 13:46:29,655 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-10-24 13:46:29,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:46:29,706 INFO L204 MainTranslator]: Completed translation [2024-10-24 13:46:29,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29 WrapperNode [2024-10-24 13:46:29,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 13:46:29,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 13:46:29,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 13:46:29,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 13:46:29,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:29,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:29,834 INFO L138 Inliner]: procedures = 142, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1745 [2024-10-24 13:46:29,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 13:46:29,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 13:46:29,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 13:46:29,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 13:46:29,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:29,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:29,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,116 INFO L175 MemorySlicer]: Split 260 memory accesses to 10 slices as follows [2, 1, 4, 8, 8, 1, 1, 25, 19, 191]. 73 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 0, 0, 8, 8, 0, 0, 0, 19, 25]. The 57 writes are split as follows [0, 1, 2, 0, 0, 1, 0, 3, 0, 50]. [2024-10-24 13:46:30,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 13:46:30,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 13:46:30,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 13:46:30,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 13:46:30,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (1/1) ... [2024-10-24 13:46:30,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:46:30,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:46:30,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 13:46:30,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 13:46:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2024-10-24 13:46:30,332 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2024-10-24 13:46:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2024-10-24 13:46:30,332 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2024-10-24 13:46:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 13:46:30,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 13:46:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 13:46:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 13:46:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 13:46:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 13:46:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 13:46:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-24 13:46:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-24 13:46:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-24 13:46:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-24 13:46:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-24 13:46:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-24 13:46:30,335 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-24 13:46:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2024-10-24 13:46:30,336 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2024-10-24 13:46:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-10-24 13:46:30,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-10-24 13:46:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 13:46:30,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 13:46:30,337 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2024-10-24 13:46:30,338 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2024-10-24 13:46:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2024-10-24 13:46:30,338 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2024-10-24 13:46:30,338 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 13:46:30,338 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 13:46:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 13:46:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 13:46:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-24 13:46:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-24 13:46:30,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-24 13:46:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-24 13:46:30,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-24 13:46:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2024-10-24 13:46:30,341 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2024-10-24 13:46:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-10-24 13:46:30,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-10-24 13:46:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 13:46:30,341 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 13:46:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 13:46:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-10-24 13:46:30,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-10-24 13:46:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-10-24 13:46:30,341 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2024-10-24 13:46:30,342 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 13:46:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 13:46:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 13:46:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 13:46:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 13:46:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-24 13:46:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-24 13:46:30,347 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 13:46:30,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 13:46:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2024-10-24 13:46:30,349 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2024-10-24 13:46:30,349 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2024-10-24 13:46:30,350 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2024-10-24 13:46:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 13:46:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 13:46:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 13:46:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 13:46:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 13:46:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 13:46:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 13:46:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 13:46:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-24 13:46:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-24 13:46:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-10-24 13:46:30,351 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-10-24 13:46:30,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-24 13:46:30,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-24 13:46:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 13:46:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 13:46:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 13:46:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 13:46:30,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 13:46:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 13:46:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 13:46:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 13:46:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 13:46:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-24 13:46:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-24 13:46:30,354 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2024-10-24 13:46:30,355 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2024-10-24 13:46:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2024-10-24 13:46:30,355 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2024-10-24 13:46:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 13:46:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 13:46:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 13:46:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 13:46:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 13:46:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-24 13:46:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-24 13:46:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-24 13:46:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-24 13:46:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-24 13:46:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 13:46:30,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 13:46:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-24 13:46:30,356 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-24 13:46:30,789 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 13:46:30,793 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 13:46:31,322 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 13:46:32,393 INFO L? ?]: Removed 979 outVars from TransFormulas that were not future-live. [2024-10-24 13:46:32,394 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 13:46:32,568 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 13:46:32,570 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 13:46:32,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:32 BoogieIcfgContainer [2024-10-24 13:46:32,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 13:46:32,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 13:46:32,574 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 13:46:32,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 13:46:32,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:46:28" (1/3) ... [2024-10-24 13:46:32,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5b5fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:32, skipping insertion in model container [2024-10-24 13:46:32,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:46:29" (2/3) ... [2024-10-24 13:46:32,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5b5fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:46:32, skipping insertion in model container [2024-10-24 13:46:32,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:32" (3/3) ... [2024-10-24 13:46:32,581 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-10-24 13:46:32,596 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 13:46:32,597 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 13:46:32,676 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 13:46:32,685 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;@18d59bec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 13:46:32,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 13:46:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 256 states have (on average 1.42578125) internal successors, (365), 271 states have internal predecessors, (365), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 13:46:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 13:46:32,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:32,704 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 13:46:32,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:32,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:32,710 INFO L85 PathProgramCache]: Analyzing trace with hash -782435346, now seen corresponding path program 1 times [2024-10-24 13:46:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:32,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909993498] [2024-10-24 13:46:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:33,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:33,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:33,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:33,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:46:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:33,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 13:46:33,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:33,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909993498] [2024-10-24 13:46:33,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909993498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:46:33,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:46:33,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 13:46:33,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515505709] [2024-10-24 13:46:33,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:46:33,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 13:46:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:33,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 13:46:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 13:46:33,268 INFO L87 Difference]: Start difference. First operand has 367 states, 256 states have (on average 1.42578125) internal successors, (365), 271 states have internal predecessors, (365), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 13:46:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:34,637 INFO L93 Difference]: Finished difference Result 803 states and 1210 transitions. [2024-10-24 13:46:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 13:46:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2024-10-24 13:46:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:34,667 INFO L225 Difference]: With dead ends: 803 [2024-10-24 13:46:34,667 INFO L226 Difference]: Without dead ends: 422 [2024-10-24 13:46:34,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 13:46:34,685 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 460 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:34,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 584 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 13:46:34,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-24 13:46:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 352. [2024-10-24 13:46:34,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 248 states have (on average 1.3830645161290323) internal successors, (343), 256 states have internal predecessors, (343), 79 states have call successors, (79), 25 states have call predecessors, (79), 24 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-10-24 13:46:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 499 transitions. [2024-10-24 13:46:34,775 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 499 transitions. Word has length 35 [2024-10-24 13:46:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:34,775 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 499 transitions. [2024-10-24 13:46:34,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 13:46:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 499 transitions. [2024-10-24 13:46:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 13:46:34,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:34,778 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 13:46:34,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 13:46:34,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:34,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -720395732, now seen corresponding path program 1 times [2024-10-24 13:46:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107202855] [2024-10-24 13:46:34,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:34,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:46:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 13:46:35,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:35,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107202855] [2024-10-24 13:46:35,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107202855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:46:35,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:46:35,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:46:35,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461806003] [2024-10-24 13:46:35,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:46:35,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:46:35,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:35,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:46:35,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:46:35,023 INFO L87 Difference]: Start difference. First operand 352 states and 499 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 13:46:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:37,000 INFO L93 Difference]: Finished difference Result 1156 states and 1697 transitions. [2024-10-24 13:46:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 13:46:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2024-10-24 13:46:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:37,010 INFO L225 Difference]: With dead ends: 1156 [2024-10-24 13:46:37,011 INFO L226 Difference]: Without dead ends: 814 [2024-10-24 13:46:37,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-24 13:46:37,014 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 1200 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 770 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 770 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:37,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 751 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [770 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 13:46:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-10-24 13:46:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 673. [2024-10-24 13:46:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 478 states have (on average 1.3849372384937237) internal successors, (662), 493 states have internal predecessors, (662), 149 states have call successors, (149), 46 states have call predecessors, (149), 45 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2024-10-24 13:46:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 958 transitions. [2024-10-24 13:46:37,120 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 958 transitions. Word has length 35 [2024-10-24 13:46:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:37,121 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 958 transitions. [2024-10-24 13:46:37,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 13:46:37,121 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 958 transitions. [2024-10-24 13:46:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 13:46:37,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:37,124 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 13:46:37,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 13:46:37,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:37,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash -186725861, now seen corresponding path program 1 times [2024-10-24 13:46:37,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:37,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397526359] [2024-10-24 13:46:37,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:37,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:37,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:46:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 13:46:37,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:37,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397526359] [2024-10-24 13:46:37,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397526359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:46:37,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:46:37,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 13:46:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044257727] [2024-10-24 13:46:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:46:37,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 13:46:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:37,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 13:46:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 13:46:37,292 INFO L87 Difference]: Start difference. First operand 673 states and 958 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 13:46:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:39,274 INFO L93 Difference]: Finished difference Result 1596 states and 2373 transitions. [2024-10-24 13:46:39,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 13:46:39,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2024-10-24 13:46:39,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:39,287 INFO L225 Difference]: With dead ends: 1596 [2024-10-24 13:46:39,287 INFO L226 Difference]: Without dead ends: 1590 [2024-10-24 13:46:39,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-24 13:46:39,290 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1228 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 774 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 774 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:39,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 759 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [774 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 13:46:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-10-24 13:46:39,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1316. [2024-10-24 13:46:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 937 states have (on average 1.384204909284952) internal successors, (1297), 966 states have internal predecessors, (1297), 289 states have call successors, (289), 90 states have call predecessors, (289), 89 states have return successors, (287), 287 states have call predecessors, (287), 287 states have call successors, (287) [2024-10-24 13:46:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1873 transitions. [2024-10-24 13:46:39,385 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1873 transitions. Word has length 40 [2024-10-24 13:46:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1873 transitions. [2024-10-24 13:46:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (6), 5 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 13:46:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1873 transitions. [2024-10-24 13:46:39,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 13:46:39,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:39,394 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 13:46:39,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 13:46:39,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:39,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash 480104822, now seen corresponding path program 1 times [2024-10-24 13:46:39,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:39,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549790295] [2024-10-24 13:46:39,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:46:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 13:46:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-24 13:46:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 13:46:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 13:46:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 13:46:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-24 13:46:39,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:39,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549790295] [2024-10-24 13:46:39,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549790295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:46:39,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:46:39,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 13:46:39,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765643664] [2024-10-24 13:46:39,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:46:39,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 13:46:39,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:39,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 13:46:39,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 13:46:39,631 INFO L87 Difference]: Start difference. First operand 1316 states and 1873 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 13:46:42,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:42,115 INFO L93 Difference]: Finished difference Result 4817 states and 7169 transitions. [2024-10-24 13:46:42,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 13:46:42,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 91 [2024-10-24 13:46:42,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:42,144 INFO L225 Difference]: With dead ends: 4817 [2024-10-24 13:46:42,145 INFO L226 Difference]: Without dead ends: 3511 [2024-10-24 13:46:42,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-24 13:46:42,154 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1360 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:42,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 1071 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 13:46:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-24 13:46:42,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 2448. [2024-10-24 13:46:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2448 states, 1737 states have (on average 1.3811168681635002) internal successors, (2399), 1794 states have internal predecessors, (2399), 535 states have call successors, (535), 176 states have call predecessors, (535), 175 states have return successors, (533), 533 states have call predecessors, (533), 533 states have call successors, (533) [2024-10-24 13:46:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3467 transitions. [2024-10-24 13:46:42,350 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3467 transitions. Word has length 91 [2024-10-24 13:46:42,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:42,352 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 3467 transitions. [2024-10-24 13:46:42,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 13:46:42,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3467 transitions. [2024-10-24 13:46:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 13:46:42,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:42,358 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 13:46:42,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 13:46:42,359 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:42,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:42,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1070203813, now seen corresponding path program 1 times [2024-10-24 13:46:42,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:42,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225689948] [2024-10-24 13:46:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:46:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 13:46:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 13:46:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 13:46:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 13:46:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:42,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 13:46:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 13:46:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 13:46:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:43,041 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-24 13:46:43,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225689948] [2024-10-24 13:46:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225689948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:46:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:46:43,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 13:46:43,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163891464] [2024-10-24 13:46:43,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:46:43,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 13:46:43,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:43,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 13:46:43,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-24 13:46:43,044 INFO L87 Difference]: Start difference. First operand 2448 states and 3467 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 13:46:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:45,073 INFO L93 Difference]: Finished difference Result 5940 states and 8751 transitions. [2024-10-24 13:46:45,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 13:46:45,074 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-10-24 13:46:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:45,105 INFO L225 Difference]: With dead ends: 5940 [2024-10-24 13:46:45,105 INFO L226 Difference]: Without dead ends: 3506 [2024-10-24 13:46:45,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-24 13:46:45,120 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 554 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:45,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1321 Invalid, 2158 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [409 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 13:46:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2024-10-24 13:46:45,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 2452. [2024-10-24 13:46:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1739 states have (on average 1.3806785508913169) internal successors, (2401), 1798 states have internal predecessors, (2401), 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) [2024-10-24 13:46:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3485 transitions. [2024-10-24 13:46:45,277 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3485 transitions. Word has length 125 [2024-10-24 13:46:45,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:45,280 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3485 transitions. [2024-10-24 13:46:45,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 13:46:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3485 transitions. [2024-10-24 13:46:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 13:46:45,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:45,286 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 13:46:45,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 13:46:45,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2009489349, now seen corresponding path program 1 times [2024-10-24 13:46:45,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902920038] [2024-10-24 13:46:45,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:45,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 13:46:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 13:46:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 13:46:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 13:46:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 13:46:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 13:46:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:46:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:46:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 13:46:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 13:46:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-24 13:46:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902920038] [2024-10-24 13:46:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902920038] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:46:45,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041639795] [2024-10-24 13:46:45,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:45,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:46:45,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:46:45,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 13:46:45,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 13:46:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:46,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 13:46:46,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:46:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-24 13:46:46,472 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 13:46:46,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041639795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:46:46,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 13:46:46,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-24 13:46:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673586588] [2024-10-24 13:46:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:46:46,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:46:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:46:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 13:46:46,475 INFO L87 Difference]: Start difference. First operand 2452 states and 3485 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-10-24 13:46:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:46,818 INFO L93 Difference]: Finished difference Result 4894 states and 6960 transitions. [2024-10-24 13:46:46,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 13:46:46,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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 144 [2024-10-24 13:46:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:46,837 INFO L225 Difference]: With dead ends: 4894 [2024-10-24 13:46:46,837 INFO L226 Difference]: Without dead ends: 2453 [2024-10-24 13:46:46,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 13:46:46,850 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:46,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1269 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 13:46:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2024-10-24 13:46:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2453. [2024-10-24 13:46:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 1740 states have (on average 1.3804597701149426) internal successors, (2402), 1799 states have internal predecessors, (2402), 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) [2024-10-24 13:46:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3486 transitions. [2024-10-24 13:46:47,000 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3486 transitions. Word has length 144 [2024-10-24 13:46:47,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3486 transitions. [2024-10-24 13:46:47,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-10-24 13:46:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3486 transitions. [2024-10-24 13:46:47,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 13:46:47,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:47,006 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 13:46:47,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 13:46:47,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 13:46:47,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:47,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:47,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1438997375, now seen corresponding path program 1 times [2024-10-24 13:46:47,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:47,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31647654] [2024-10-24 13:46:47,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:47,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:47,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 13:46:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 13:46:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 13:46:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 13:46:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 13:46:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 13:46:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:46:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:46:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 13:46:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 13:46:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-24 13:46:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31647654] [2024-10-24 13:46:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31647654] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:46:47,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899627050] [2024-10-24 13:46:47,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:46:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:46:47,818 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) [2024-10-24 13:46:47,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 13:46:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:48,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 13:46:48,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:46:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 13:46:48,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 13:46:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-24 13:46:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899627050] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 13:46:48,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 13:46:48,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-24 13:46:48,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228806405] [2024-10-24 13:46:48,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 13:46:48,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 13:46:48,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:48,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 13:46:48,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-24 13:46:48,606 INFO L87 Difference]: Start difference. First operand 2453 states and 3486 transitions. Second operand has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 13:46:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:51,097 INFO L93 Difference]: Finished difference Result 5957 states and 8787 transitions. [2024-10-24 13:46:51,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 13:46:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 146 [2024-10-24 13:46:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:51,127 INFO L225 Difference]: With dead ends: 5957 [2024-10-24 13:46:51,128 INFO L226 Difference]: Without dead ends: 3515 [2024-10-24 13:46:51,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-10-24 13:46:51,140 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 654 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:51,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1325 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 13:46:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2024-10-24 13:46:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 2461. [2024-10-24 13:46:51,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 1747 states have (on average 1.3806525472238123) internal successors, (2412), 1806 states have internal predecessors, (2412), 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) [2024-10-24 13:46:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3496 transitions. [2024-10-24 13:46:51,353 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3496 transitions. Word has length 146 [2024-10-24 13:46:51,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:51,353 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3496 transitions. [2024-10-24 13:46:51,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 10 states have internal predecessors, (97), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 13:46:51,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3496 transitions. [2024-10-24 13:46:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 13:46:51,359 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:51,359 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 13:46:51,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 13:46:51,563 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,SelfDestructingSolverStorable6 [2024-10-24 13:46:51,564 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:51,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2120898203, now seen corresponding path program 2 times [2024-10-24 13:46:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:51,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880656891] [2024-10-24 13:46:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:51,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 13:46:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 13:46:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 13:46:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 13:46:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 13:46:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 13:46:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:46:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:46:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 13:46:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 13:46:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-10-24 13:46:52,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880656891] [2024-10-24 13:46:52,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880656891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:46:52,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996260457] [2024-10-24 13:46:52,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 13:46:52,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:46:52,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:46:52,385 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) [2024-10-24 13:46:52,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 13:46:52,873 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 13:46:52,874 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 13:46:52,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 13:46:52,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:46:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 36 proven. 25 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 13:46:53,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 13:46:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 13:46:53,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996260457] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 13:46:53,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 13:46:53,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 6] total 25 [2024-10-24 13:46:53,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932790368] [2024-10-24 13:46:53,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 13:46:53,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 13:46:53,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:46:53,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 13:46:53,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-10-24 13:46:53,365 INFO L87 Difference]: Start difference. First operand 2461 states and 3496 transitions. Second operand has 25 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 2 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 13:46:57,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:46:57,222 INFO L93 Difference]: Finished difference Result 5962 states and 8790 transitions. [2024-10-24 13:46:57,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 13:46:57,222 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 2 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 150 [2024-10-24 13:46:57,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:46:57,252 INFO L225 Difference]: With dead ends: 5962 [2024-10-24 13:46:57,252 INFO L226 Difference]: Without dead ends: 3516 [2024-10-24 13:46:57,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2024-10-24 13:46:57,265 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 691 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 4618 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 5164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 4618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 13:46:57,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 3170 Invalid, 5164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 4618 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 13:46:57,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2024-10-24 13:46:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 2464. [2024-10-24 13:46:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2464 states, 1750 states have (on average 1.3782857142857143) internal successors, (2412), 1809 states have internal predecessors, (2412), 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) [2024-10-24 13:46:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3496 transitions. [2024-10-24 13:46:57,432 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3496 transitions. Word has length 150 [2024-10-24 13:46:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:46:57,433 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 3496 transitions. [2024-10-24 13:46:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 4.818181818181818) internal successors, (106), 21 states have internal predecessors, (106), 2 states have call successors, (38), 6 states have call predecessors, (38), 5 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-24 13:46:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3496 transitions. [2024-10-24 13:46:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-24 13:46:57,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:46:57,441 INFO L215 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 13:46:57,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 13:46:57,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:46:57,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:46:57,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:46:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash -968000768, now seen corresponding path program 3 times [2024-10-24 13:46:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:46:57,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989024030] [2024-10-24 13:46:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:46:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:46:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 13:46:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 13:46:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 13:46:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-24 13:46:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 13:46:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 13:46:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 13:46:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 13:46:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 13:46:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 13:46:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 13:46:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 13:46:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 13:46:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:46:58,520 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 13:46:58,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 13:46:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989024030] [2024-10-24 13:46:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989024030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 13:46:58,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960143153] [2024-10-24 13:46:58,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 13:46:58,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:46:58,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:46:58,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 13:46:58,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 13:46:59,589 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-24 13:46:59,590 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 13:46:59,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 13:46:59,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:46:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 64 proven. 15 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-24 13:46:59,740 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 13:47:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-10-24 13:47:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960143153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 13:47:00,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 13:47:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2024-10-24 13:47:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142693626] [2024-10-24 13:47:00,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 13:47:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 13:47:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 13:47:00,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 13:47:00,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2024-10-24 13:47:00,137 INFO L87 Difference]: Start difference. First operand 2464 states and 3496 transitions. Second operand has 26 states, 24 states have (on average 4.541666666666667) internal successors, (109), 22 states have internal predecessors, (109), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 13:47:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:47:07,102 INFO L93 Difference]: Finished difference Result 5969 states and 8796 transitions. [2024-10-24 13:47:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 13:47:07,102 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.541666666666667) internal successors, (109), 22 states have internal predecessors, (109), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 153 [2024-10-24 13:47:07,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:47:07,133 INFO L225 Difference]: With dead ends: 5969 [2024-10-24 13:47:07,133 INFO L226 Difference]: Without dead ends: 3523 [2024-10-24 13:47:07,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=529, Invalid=1823, Unknown=0, NotChecked=0, Total=2352 [2024-10-24 13:47:07,144 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 498 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 4148 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 4461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 4148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-24 13:47:07,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 2896 Invalid, 4461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 4148 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-24 13:47:07,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2024-10-24 13:47:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2471. [2024-10-24 13:47:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 1757 states have (on average 1.377347751849744) internal successors, (2420), 1816 states have internal predecessors, (2420), 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) [2024-10-24 13:47:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3504 transitions. [2024-10-24 13:47:07,317 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3504 transitions. Word has length 153 [2024-10-24 13:47:07,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:47:07,318 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3504 transitions. [2024-10-24 13:47:07,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.541666666666667) internal successors, (109), 22 states have internal predecessors, (109), 2 states have call successors, (39), 6 states have call predecessors, (39), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-24 13:47:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3504 transitions. [2024-10-24 13:47:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-24 13:47:07,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:47:07,325 INFO L215 NwaCegarLoop]: trace histogram [12, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 13:47:07,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 13:47:07,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 13:47:07,526 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:47:07,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:47:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1186923771, now seen corresponding path program 4 times [2024-10-24 13:47:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 13:47:07,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669327314] [2024-10-24 13:47:07,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:47:07,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 13:47:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 13:47:07,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 13:47:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 13:47:08,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 13:47:08,153 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 13:47:08,154 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 13:47:08,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 13:47:08,158 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-10-24 13:47:08,301 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 13:47:08,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 01:47:08 BoogieIcfgContainer [2024-10-24 13:47:08,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 13:47:08,304 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 13:47:08,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 13:47:08,304 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 13:47:08,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:46:32" (3/4) ... [2024-10-24 13:47:08,306 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 13:47:08,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 13:47:08,308 INFO L158 Benchmark]: Toolchain (without parser) took 40265.93ms. Allocated memory was 178.3MB in the beginning and 725.6MB in the end (delta: 547.4MB). Free memory was 141.1MB in the beginning and 341.1MB in the end (delta: -199.9MB). Peak memory consumption was 346.5MB. Max. memory is 16.1GB. [2024-10-24 13:47:08,308 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 13:47:08,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1663.32ms. Allocated memory is still 178.3MB. Free memory was 141.1MB in the beginning and 128.2MB in the end (delta: 12.9MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2024-10-24 13:47:08,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 126.84ms. Allocated memory is still 178.3MB. Free memory was 128.2MB in the beginning and 116.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 13:47:08,309 INFO L158 Benchmark]: Boogie Preprocessor took 381.85ms. Allocated memory is still 178.3MB. Free memory was 116.6MB in the beginning and 115.7MB in the end (delta: 917.7kB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2024-10-24 13:47:08,309 INFO L158 Benchmark]: RCFGBuilder took 2353.69ms. Allocated memory was 178.3MB in the beginning and 297.8MB in the end (delta: 119.5MB). Free memory was 115.7MB in the beginning and 151.8MB in the end (delta: -36.0MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2024-10-24 13:47:08,309 INFO L158 Benchmark]: TraceAbstraction took 35730.71ms. Allocated memory was 297.8MB in the beginning and 725.6MB in the end (delta: 427.8MB). Free memory was 150.7MB in the beginning and 341.1MB in the end (delta: -190.3MB). Peak memory consumption was 239.6MB. Max. memory is 16.1GB. [2024-10-24 13:47:08,309 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 725.6MB. Free memory is still 341.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 13:47:08,311 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 75.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1663.32ms. Allocated memory is still 178.3MB. Free memory was 141.1MB in the beginning and 128.2MB in the end (delta: 12.9MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 126.84ms. Allocated memory is still 178.3MB. Free memory was 128.2MB in the beginning and 116.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 381.85ms. Allocated memory is still 178.3MB. Free memory was 116.6MB in the beginning and 115.7MB in the end (delta: 917.7kB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. * RCFGBuilder took 2353.69ms. Allocated memory was 178.3MB in the beginning and 297.8MB in the end (delta: 119.5MB). Free memory was 115.7MB in the beginning and 151.8MB in the end (delta: -36.0MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. * TraceAbstraction took 35730.71ms. Allocated memory was 297.8MB in the beginning and 725.6MB in the end (delta: 427.8MB). Free memory was 150.7MB in the beginning and 341.1MB in the end (delta: -190.3MB). Peak memory consumption was 239.6MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 725.6MB. Free memory is still 341.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 3095]: 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] - GenericResultAtLocation [Line: 3374]: 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] - GenericResultAtLocation [Line: 3382]: 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] - GenericResultAtLocation [Line: 3390]: 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] - GenericResultAtLocation [Line: 3605]: 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] - GenericResultAtLocation [Line: 3680]: 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] - GenericResultAtLocation [Line: 4002]: 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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4236]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of large string literal at line 4024. Possible FailurePath: [L3355] int LDV_IN_INTERRUPT = 1; [L3356] struct block_device *virtblk_fops_group0 ; [L3357] int ldv_state_variable_2 ; [L3358] int ref_cnt ; [L3359] int ldv_state_variable_1 ; [L3360] struct virtio_device *virtio_blk_group0 ; [L3361] int ldv_state_variable_0 ; [L3492] static int major ; [L3493] static int index ; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L3818-L3819] static struct block_device_operations const virtblk_fops = {0, 0, & virtblk_ioctl, 0, 0, 0, 0, 0, 0, & virtblk_getgeo, 0, & __this_module}; [L4018-L4019] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4018-L4019] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4018-L4019] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4018-L4019] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4018-L4019] static struct virtio_device_id const id_table[2U] = { {2U, 4294967295U}, {0U, 0U}}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4020-L4023] static unsigned int features[9U] = { 0U, 2U, 1U, 4U, 5U, 6U, 7U, 9U, 10U}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4024-L4025] static struct virtio_driver virtio_blk = {{"virtio_blk", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, (struct virtio_device_id const *)(& id_table), (unsigned int const *)(& features), 9U, & virtblk_probe, & virtblk_remove, 0}; [L4047] struct virtio_device_id const __mod_virtio_device_table ; [L4048] int ldv_retval_0 ; [L4049] int ldv_retval_1 ; [L4283] int ldv_blk_rq = 0; [L4072] unsigned long ldvarg1 ; [L4073] fmode_t ldvarg3 ; [L4074] struct hd_geometry *ldvarg0 ; [L4075] void *tmp ; [L4076] unsigned int ldvarg2 ; [L4077] int tmp___0 ; [L4078] int tmp___1 ; [L4079] int tmp___2 ; [L4080] int tmp___3 ; VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4082] CALL, EXPR ldv_init_zalloc(16UL) VAL [LDV_IN_INTERRUPT=1, \old(size)=16, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [LDV_IN_INTERRUPT=1, \old(size)=16, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, size=16, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(size)=16, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-(((__int128) 1 << 64) | 1):0}, ref_cnt=0, size=16, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(size)=16, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, p={-(((__int128) 1 << 64) | 1):0}, ref_cnt=0, size=16, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3296] return (p); [L4082] RET, EXPR ldv_init_zalloc(16UL) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4082] tmp = ldv_init_zalloc(16UL) [L4083] ldvarg0 = (struct hd_geometry *)tmp [L4084] FCALL ldv_initialize() [L4085] CALL ldv_memset((void *)(& ldvarg1), 0, 8UL) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3301] void *tmp ; [L3303] EXPR, FCALL memset(s, c, n) [L3303] tmp = memset(s, c, n) [L3304] return (tmp); [L4085] RET ldv_memset((void *)(& ldvarg1), 0, 8UL) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4086] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3301] void *tmp ; [L3303] EXPR, FCALL memset(s, c, n) [L3303] tmp = memset(s, c, n) [L3304] return (tmp); [L4086] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4087] ldvarg2 = __VERIFIER_nondet_ulong () [L4088] ldv_state_variable_1 = 0 [L4089] ref_cnt = 0 [L4090] ldv_state_variable_0 = 1 [L4091] ldv_state_variable_2 = 0 VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=1, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4095] case 0: [L4125] case 1: [L4127] tmp___2 = __VERIFIER_nondet_int() [L4129] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=1, tmp___2=1, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4125] case 1: [L4137] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=1, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4125] case 1: [L4139] CALL, EXPR init() [L4028] int tmp ; [L4030] CALL, EXPR register_blkdev(0U, "virtblk") [L4472] return __VERIFIER_nondet_int(); [L4030] RET, EXPR register_blkdev(0U, "virtblk") [L4030] major = register_blkdev(0U, "virtblk") [L4031] COND FALSE !(major < 0) [L4035] CALL, EXPR register_virtio_driver(& virtio_blk) [L4476] return __VERIFIER_nondet_int(); [L4035] RET, EXPR register_virtio_driver(& virtio_blk) [L4035] tmp = register_virtio_driver(& virtio_blk) [L4036] return (tmp); VAL [LDV_IN_INTERRUPT=1, \result=0, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4139] RET, EXPR init() [L4139] ldv_retval_1 = init() [L4125] case 1: [L4141] ldv_state_variable_0 = 3 [L4142] ldv_state_variable_2 = 1 [L4143] CALL ldv_initialize_block_device_operations_2() [L4063] void *tmp ; VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4065] CALL, EXPR ldv_init_zalloc(464UL) VAL [LDV_IN_INTERRUPT=1, \old(size)=464, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [LDV_IN_INTERRUPT=1, \old(size)=464, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, size=464, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(size)=464, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={-(((__int128) 2 << 64) | 1):0}, ref_cnt=0, size=464, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(size)=464, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, p={-(((__int128) 2 << 64) | 1):0}, ref_cnt=0, size=464, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3296] return (p); [L4065] RET, EXPR ldv_init_zalloc(464UL) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=0, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={0:0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4065] tmp = ldv_init_zalloc(464UL) [L4066] virtblk_fops_group0 = (struct block_device *)tmp [L4143] RET ldv_initialize_block_device_operations_2() [L4144] ldv_state_variable_1 = 1 [L4145] CALL ldv_initialize_virtio_driver_1() [L4054] void *tmp ; VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4056] CALL, EXPR ldv_init_zalloc(1048UL) VAL [LDV_IN_INTERRUPT=1, \old(size)=1048, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [LDV_IN_INTERRUPT=1, \old(size)=1048, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, size=1048, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(size)=1048, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-(((__int128) 3 << 64) | 1):0}, ref_cnt=0, size=1048, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(size)=1048, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-(((__int128) 3 << 64) | 1):0}, ref_cnt=0, size=1048, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3296] return (p); [L4056] RET, EXPR ldv_init_zalloc(1048UL) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L4056] tmp = ldv_init_zalloc(1048UL) [L4057] virtio_blk_group0 = (struct virtio_device *)tmp [L4145] RET ldv_initialize_virtio_driver_1() [L4125] case 1: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=1, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=2, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4095] case 0: [L4125] case 1: [L4163] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4163] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4163] case 2: [L4165] tmp___3 = __VERIFIER_nondet_int() [L4167] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4163] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4163] case 2: [L4169] EXPR \read(ldvarg3) [L4169] EXPR \read(ldvarg1) [L4169] CALL virtblk_ioctl(virtblk_fops_group0, ldvarg3, ldvarg2, ldvarg1) [L3756] struct gendisk *disk ; [L3757] struct virtio_blk *vblk ; [L3758] void *usr_data ; [L3759] char id_str[20U] ; [L3760] int err ; [L3761] int tmp ; [L3762] bool tmp___0 ; [L3763] int tmp___1 ; [L3764] int tmp___2 ; [L3766] EXPR bdev->bd_disk [L3766] disk = bdev->bd_disk [L3767] EXPR disk->private_data [L3767] vblk = (struct virtio_blk *)disk->private_data [L3768] COND TRUE cmd == 1447184708U [L3769] usr_data = (void *)data [L3770] CALL, EXPR virtblk_get_id(disk, (char *)(& id_str)) [L3723] struct virtio_blk *vblk ; [L3724] struct request *req ; [L3725] struct bio *bio ; [L3726] long tmp ; [L3727] long tmp___0 ; [L3728] long tmp___1 ; [L3729] long tmp___2 ; [L3730] int tmp___3 ; [L3732] EXPR disk->private_data [L3732] vblk = (struct virtio_blk *)disk->private_data [L3733] EXPR vblk->disk [L3733] EXPR (vblk->disk)->queue [L3733] CALL, EXPR bio_map_kern((vblk->disk)->queue, (void *)id_str, 20U, 208U) [L4381] CALL, EXPR ldv_malloc(sizeof(struct bio)) VAL [LDV_IN_INTERRUPT=1, \old(size)=112, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3254] void *p ; [L3255] void *tmp ; [L3256] int tmp___0 ; [L3258] tmp___0 = __VERIFIER_nondet_int() [L3259] COND TRUE tmp___0 != 0 [L3260] return ((void *)0); VAL [LDV_IN_INTERRUPT=1, \old(size)=112, \result={0:0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, size=112, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4381] RET, EXPR ldv_malloc(sizeof(struct bio)) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4381] return ldv_malloc(sizeof(struct bio)); [L3733] RET, EXPR bio_map_kern((vblk->disk)->queue, (void *)id_str, 20U, 208U) [L3733] bio = bio_map_kern((vblk->disk)->queue, (void *)id_str, 20U, 208U) [L3734] CALL, EXPR IS_ERR((void const *)bio) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={0:0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4216] bool tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ptr)={0:0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={0:0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4242] return ((unsigned long )ptr > 2012UL); [L4218] RET, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={0:0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={0:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); [L3734] RET, EXPR IS_ERR((void const *)bio) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, bio={0:0}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, vblk={4294967301:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3734] tmp___0 = IS_ERR((void const *)bio) [L3735] COND FALSE !(tmp___0 != 0L) [L3740] EXPR vblk->disk [L3740] EXPR (vblk->disk)->queue [L3740] CALL, EXPR ldv_blk_make_request_5((vblk->disk)->queue, bio, 208U) [L4225] struct request *tmp ; [L4227] CALL, EXPR ldv_blk_make_request(ldv_func_arg3) [L4309] struct request *res ; [L4310] long tmp___0 ; VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4312] COND FALSE !(ldv_blk_rq != 0) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4316] CALL, EXPR ldv_malloc(sizeof(struct request)) VAL [LDV_IN_INTERRUPT=1, \old(size)=322, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3254] void *p ; [L3255] void *tmp ; [L3256] int tmp___0 ; [L3258] tmp___0 = __VERIFIER_nondet_int() [L3259] COND FALSE !(tmp___0 != 0) [L3262] tmp = malloc(size) [L3263] p = tmp VAL [LDV_IN_INTERRUPT=1, \old(size)=322, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3264] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3264] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [LDV_IN_INTERRUPT=1, \old(size)=322, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3265] CALL, EXPR IS_ERR(p) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4216] bool tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4242] return ((unsigned long )ptr > 2012UL); [L4218] RET, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); [L3265] RET, EXPR IS_ERR(p) VAL [LDV_IN_INTERRUPT=1, \old(size)=322, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3265] CALL assume_abort_if_not(IS_ERR(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3265] RET assume_abort_if_not(IS_ERR(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(size)=322, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, p={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3266] return (p); VAL [LDV_IN_INTERRUPT=1, \old(size)=322, \result={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4316] RET, EXPR ldv_malloc(sizeof(struct request)) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4316] res = ldv_malloc(sizeof(struct request)) [L4317] COND FALSE !((unsigned long )res == (unsigned long )((struct request *)0)) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, res={-(((__int128) 0 << 64) | 18446744073709549604U):0}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4321] CALL, EXPR IS_ERR___0((void const *)res) [L4277] long tmp ; VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4279] CALL, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) VAL [LDV_IN_INTERRUPT=1, \old(c)=0, \old(exp)=0, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3333] return (exp); [L4279] RET, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=0, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4279] tmp = ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) [L4280] return (tmp); [L4321] RET, EXPR IS_ERR___0((void const *)res) [L4321] tmp___0 = IS_ERR___0((void const *)res) [L4322] COND TRUE tmp___0 == 0L [L4323] ldv_blk_rq = 1 VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, res={-(((__int128) 0 << 64) | 18446744073709549604U):0}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4326] return (res); [L4227] RET, EXPR ldv_blk_make_request(ldv_func_arg3) [L4227] tmp = ldv_blk_make_request(ldv_func_arg3) [L4228] return (tmp); [L3740] RET, EXPR ldv_blk_make_request_5((vblk->disk)->queue, bio, 208U) [L3740] req = ldv_blk_make_request_5((vblk->disk)->queue, bio, 208U) [L3741] CALL, EXPR IS_ERR((void const *)req) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4216] bool tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4242] return ((unsigned long )ptr > 2012UL); [L4218] RET, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={-(((__int128) 0 << 64) | 18446744073709549604U):0}, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ptr={-(((__int128) 0 << 64) | 18446744073709549604U):0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); [L3741] RET, EXPR IS_ERR((void const *)req) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, bio={0:0}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, req={-(((__int128) 0 << 64) | 18446744073709549604U):0}, vblk={4294967301:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3741] tmp___2 = IS_ERR((void const *)req) [L3742] COND FALSE !(tmp___2 != 0L) [L3748] req->cmd_type = 7 [L3749] EXPR vblk->disk [L3749] EXPR (vblk->disk)->queue [L3749] EXPR vblk->disk [L3749] CALL, EXPR blk_execute_rq((vblk->disk)->queue, vblk->disk, req, 0) [L4391] return __VERIFIER_nondet_int(); [L3749] RET, EXPR blk_execute_rq((vblk->disk)->queue, vblk->disk, req, 0) [L3749] tmp___3 = blk_execute_rq((vblk->disk)->queue, vblk->disk, req, 0) [L3750] return (tmp___3); VAL [LDV_IN_INTERRUPT=1, \result=1, __this_module={4294967297:4294967298}, bio={0:0}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3770] RET, EXPR virtblk_get_id(disk, (char *)(& id_str)) [L3770] err = virtblk_get_id(disk, (char *)(& id_str)) [L3771] COND FALSE !(err == 0) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, err=1, features={10:0}, id_str={13:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, mode=0, ref_cnt=0, usr_data={0:0}, vblk={4294967301:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L3779] return (err); [L3779] return (err); VAL [LDV_IN_INTERRUPT=1, \result=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, mode=0, ref_cnt=0, usr_data={0:0}, vblk={4294967301:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4169] RET virtblk_ioctl(virtblk_fops_group0, ldvarg3, ldvarg2, ldvarg1) [L4170] ldv_state_variable_2 = 1 VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg2=1447184708, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg2=1447184708, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=1, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4095] case 0: [L4125] case 1: [L4127] tmp___2 = __VERIFIER_nondet_int() [L4129] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg2=1447184708, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4125] case 1: [L4131] CALL fini() [L4042] FCALL unregister_blkdev((unsigned int )major, "virtblk") [L4043] FCALL unregister_virtio_driver(& virtio_blk) [L4131] RET fini() [L4132] ldv_state_variable_0 = 2 VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={-(((__int128) 1 << 64) | 1):0}, ldvarg1={15:0}, ldvarg2=1447184708, ldvarg3={14:0}, major=0, ref_cnt=0, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4194] CALL ldv_check_final_state() [L4343] COND TRUE ldv_blk_rq != 0 VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4344] CALL ldv_error() VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] [L4236] reach_error() VAL [LDV_IN_INTERRUPT=1, __this_module={4294967297:4294967298}, features={10:0}, id_table={9:0}, index=0, ldv_blk_rq=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 2 << 64) | 1):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 3 << 64) | 1):0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 368 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.5s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6971 SdHoareTripleChecker+Valid, 17.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6645 mSDsluCounter, 13146 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10707 mSDsCounter, 4438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16304 IncrementalHoareTripleChecker+Invalid, 20742 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4438 mSolverCounterUnsat, 2439 mSDtfsCounter, 16304 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1454 GetRequests, 1282 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2471occurred in iteration=9, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 5760 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1668 NumberOfCodeBlocks, 1668 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1945 ConstructedInterpolants, 0 QuantifiedInterpolants, 3046 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4399 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 1267/1443 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 13:47:08,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-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_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 13:47:10,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 13:47:10,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 13:47:10,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 13:47:10,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 13:47:10,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 13:47:10,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 13:47:10,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 13:47:10,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 13:47:10,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 13:47:10,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 13:47:10,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 13:47:10,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 13:47:10,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 13:47:10,764 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 13:47:10,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 13:47:10,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 13:47:10,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 13:47:10,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 13:47:10,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 13:47:10,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 13:47:10,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 13:47:10,766 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 13:47:10,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 13:47:10,766 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 13:47:10,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 13:47:10,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 13:47:10,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 13:47:10,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 13:47:10,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 13:47:10,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 13:47:10,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:47:10,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 13:47:10,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 13:47:10,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 13:47:10,771 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 13:47:10,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 13:47:10,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 13:47:10,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 13:47:10,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 13:47:10,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 13:47:10,772 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 13:47:10,772 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8946ad2f029076f7c4f90de60a8c48e069f80fec06a0c6d7a5dc3a1fc4182879 [2024-10-24 13:47:11,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 13:47:11,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 13:47:11,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 13:47:11,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 13:47:11,140 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 13:47:11,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-10-24 13:47:12,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 13:47:13,094 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 13:47:13,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-10-24 13:47:13,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38635ae14/623ea05feb614b6ca4b16596be072c15/FLAGf4b238024 [2024-10-24 13:47:13,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38635ae14/623ea05feb614b6ca4b16596be072c15 [2024-10-24 13:47:13,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 13:47:13,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 13:47:13,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 13:47:13,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 13:47:13,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 13:47:13,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:47:13" (1/1) ... [2024-10-24 13:47:13,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a26cdd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:13, skipping insertion in model container [2024-10-24 13:47:13,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 01:47:13" (1/1) ... [2024-10-24 13:47:13,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 13:47:14,170 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-10-24 13:47:14,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:47:14,244 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 13:47:14,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 13:47:14,468 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-10-24 13:47:14,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:47:14,495 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 13:47:14,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [3095-3096] [2024-10-24 13:47:14,578 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (63), "i" (12UL)); [3374-3375] [2024-10-24 13:47:14,580 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (65), "i" (12UL)); [3382-3383] [2024-10-24 13:47:14,581 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"include/linux/scatterlist.h"), "i" (66), "i" (12UL)); [3390-3391] [2024-10-24 13:47:14,626 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (123), "i" (12UL)); [3605-3606] [2024-10-24 13:47:14,634 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (177), "i" (12UL)); [3680-3681] [2024-10-24 13:47:14,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("1:\tud2\n.pushsection __bug_table,\"a\"\n2:\t.long 1b - 2b, %c0 - 2b\n\t.word %c1, 0\n\t.org 2b+%c2\n.popsection": : "i" ((char *)"/home/ldvuser/andrianov/commit-tester-work/task-014--linux-stable--dir/work/current--X--drivers/block/virtio_blk.ko--X--defaultlinux-stable-39a1d13-1--X--101_1a--X--cpachecker/linux-stable-39a1d13-1/csd_deg_dscv/11/dscv_tempdir/dscv/ri/101_1a/drivers/block/virtio_blk.c"), "i" (467), "i" (12UL)); [4002-4003] [2024-10-24 13:47:14,742 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i[121503,121516] [2024-10-24 13:47:14,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 13:47:14,805 INFO L204 MainTranslator]: Completed translation [2024-10-24 13:47:14,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14 WrapperNode [2024-10-24 13:47:14,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 13:47:14,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 13:47:14,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 13:47:14,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 13:47:14,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:14,848 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:14,907 INFO L138 Inliner]: procedures = 149, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1670 [2024-10-24 13:47:14,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 13:47:14,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 13:47:14,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 13:47:14,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 13:47:14,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:14,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:14,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,223 INFO L175 MemorySlicer]: Split 260 memory accesses to 10 slices as follows [2, 191, 1, 8, 25, 8, 19, 4, 1, 1]. 73 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 25, 0, 8, 0, 8, 19, 0, 0, 0]. The 57 writes are split as follows [0, 50, 0, 0, 3, 0, 0, 2, 1, 1]. [2024-10-24 13:47:15,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 13:47:15,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 13:47:15,357 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 13:47:15,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 13:47:15,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (1/1) ... [2024-10-24 13:47:15,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 13:47:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 13:47:15,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 13:47:15,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 13:47:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2024-10-24 13:47:15,456 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2024-10-24 13:47:15,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-10-24 13:47:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#5 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#6 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#7 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#8 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#9 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 13:47:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 13:47:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 13:47:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 13:47:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-24 13:47:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-24 13:47:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-24 13:47:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-24 13:47:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-24 13:47:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-24 13:47:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2024-10-24 13:47:15,460 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2024-10-24 13:47:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 13:47:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 13:47:15,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-24 13:47:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-24 13:47:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-24 13:47:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-24 13:47:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-24 13:47:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-24 13:47:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-24 13:47:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-24 13:47:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-24 13:47:15,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-24 13:47:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-24 13:47:15,462 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-24 13:47:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~C_UINT~X~$Pointer$~X~C_UINT~TO~VOID [2024-10-24 13:47:15,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~C_UINT~X~$Pointer$~X~C_UINT~TO~VOID [2024-10-24 13:47:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2024-10-24 13:47:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2024-10-24 13:47:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-24 13:47:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-24 13:47:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2024-10-24 13:47:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2024-10-24 13:47:15,463 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2024-10-24 13:47:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2024-10-24 13:47:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-24 13:47:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-24 13:47:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-24 13:47:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-24 13:47:15,464 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-24 13:47:15,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-24 13:47:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2024-10-24 13:47:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2024-10-24 13:47:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-10-24 13:47:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-10-24 13:47:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 13:47:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 13:47:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 13:47:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-10-24 13:47:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-10-24 13:47:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-10-24 13:47:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-10-24 13:47:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 13:47:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2024-10-24 13:47:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2024-10-24 13:47:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 13:47:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 13:47:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 13:47:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 13:47:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-24 13:47:15,467 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2024-10-24 13:47:15,467 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2024-10-24 13:47:15,468 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-24 13:47:15,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-24 13:47:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-24 13:47:15,469 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-10-24 13:47:15,469 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-24 13:47:15,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#5 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#6 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#7 [2024-10-24 13:47:15,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#8 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#9 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 13:47:15,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 13:47:15,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-24 13:47:15,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-24 13:47:15,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-24 13:47:15,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-24 13:47:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-24 13:47:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2024-10-24 13:47:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2024-10-24 13:47:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2024-10-24 13:47:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2024-10-24 13:47:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 13:47:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 13:47:15,476 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-24 13:47:15,476 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-24 13:47:15,976 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 13:47:15,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 13:47:16,063 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-24 13:47:22,623 INFO L? ?]: Removed 971 outVars from TransFormulas that were not future-live. [2024-10-24 13:47:22,624 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 13:47:22,837 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 13:47:22,837 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 13:47:22,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:47:22 BoogieIcfgContainer [2024-10-24 13:47:22,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 13:47:22,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 13:47:22,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 13:47:22,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 13:47:22,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 01:47:13" (1/3) ... [2024-10-24 13:47:22,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46347ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:47:22, skipping insertion in model container [2024-10-24 13:47:22,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 01:47:14" (2/3) ... [2024-10-24 13:47:22,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46347ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 01:47:22, skipping insertion in model container [2024-10-24 13:47:22,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 01:47:22" (3/3) ... [2024-10-24 13:47:22,845 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2024-10-24 13:47:22,860 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 13:47:22,860 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 13:47:22,934 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 13:47:22,941 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;@f06f82a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 13:47:22,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 13:47:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 356 states, 245 states have (on average 1.4244897959183673) internal successors, (349), 260 states have internal predecessors, (349), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2024-10-24 13:47:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 13:47:22,958 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:47:22,959 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 13:47:22,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:47:22,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:47:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2073759364, now seen corresponding path program 1 times [2024-10-24 13:47:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 13:47:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [389032913] [2024-10-24 13:47:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:47:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 13:47:22,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 13:47:22,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 13:47:22,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 13:47:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:47:23,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 13:47:23,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:47:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 13:47:23,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 13:47:23,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 13:47:23,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [389032913] [2024-10-24 13:47:23,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [389032913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:47:23,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:47:23,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 13:47:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328337520] [2024-10-24 13:47:23,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:47:23,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 13:47:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 13:47:23,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 13:47:23,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 13:47:23,607 INFO L87 Difference]: Start difference. First operand has 356 states, 245 states have (on average 1.4244897959183673) internal successors, (349), 260 states have internal predecessors, (349), 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 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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) [2024-10-24 13:47:29,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 13:47:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 13:47:29,470 INFO L93 Difference]: Finished difference Result 709 states and 1041 transitions. [2024-10-24 13:47:29,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 13:47:29,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 35 [2024-10-24 13:47:29,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 13:47:29,485 INFO L225 Difference]: With dead ends: 709 [2024-10-24 13:47:29,485 INFO L226 Difference]: Without dead ends: 341 [2024-10-24 13:47:29,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 13:47:29,496 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-24 13:47:29,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-24 13:47:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-24 13:47:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-24 13:47:29,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 237 states have (on average 1.379746835443038) internal successors, (327), 245 states have internal predecessors, (327), 79 states have call successors, (79), 25 states have call predecessors, (79), 24 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-10-24 13:47:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 483 transitions. [2024-10-24 13:47:29,579 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 483 transitions. Word has length 35 [2024-10-24 13:47:29,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 13:47:29,579 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 483 transitions. [2024-10-24 13:47:29,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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) [2024-10-24 13:47:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2024-10-24 13:47:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 13:47:29,582 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 13:47:29,582 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 13:47:29,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 13:47:29,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 13:47:29,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 13:47:29,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 13:47:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2135798978, now seen corresponding path program 1 times [2024-10-24 13:47:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 13:47:29,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820306376] [2024-10-24 13:47:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 13:47:29,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 13:47:29,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 13:47:29,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 13:47:29,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 13:47:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 13:47:30,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 13:47:30,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 13:47:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 13:47:30,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 13:47:30,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 13:47:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820306376] [2024-10-24 13:47:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820306376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 13:47:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 13:47:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 13:47:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090645942] [2024-10-24 13:47:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 13:47:30,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 13:47:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 13:47:30,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 13:47:30,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 13:47:30,317 INFO L87 Difference]: Start difference. First operand 341 states and 483 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)