./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 15:25:18,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:25:18,909 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:25:18,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:25:18,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:25:18,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:25:18,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:25:18,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:25:18,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:25:18,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:25:18,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:25:18,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:25:18,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:25:18,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:25:18,948 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:25:18,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:25:18,949 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:25:18,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:25:18,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:25:18,950 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:25:18,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:25:18,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:25:18,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:25:18,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:25:18,954 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:25:18,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:25:18,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:25:18,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:25:18,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:25:18,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:25:18,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:25:18,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:25:18,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:25:18,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:25:18,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:25:18,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:25:18,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:25:18,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:25:18,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:25:18,956 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-clean/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-clean/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-11 15:25:19,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:25:19,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:25:19,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:25:19,231 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:25:19,231 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:25:19,232 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-11 15:25:20,512 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:25:20,845 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:25:20,846 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-11 15:25:20,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e927ef328/ec6edc81ff6f44bba7c2cbbb9d7c457f/FLAG570e25491 [2024-10-11 15:25:20,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e927ef328/ec6edc81ff6f44bba7c2cbbb9d7c457f [2024-10-11 15:25:20,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:25:20,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:25:20,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:25:20,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:25:20,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:25:20,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:20" (1/1) ... [2024-10-11 15:25:20,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ab8948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:20, skipping insertion in model container [2024-10-11 15:25:20,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:20" (1/1) ... [2024-10-11 15:25:20,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:25:21,582 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-11 15:25:21,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:25:21,626 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:25:21,694 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-11 15:25:21,710 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-11 15:25:21,713 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-11 15:25:21,713 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-11 15:25:21,747 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-11 15:25:21,752 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-11 15:25:21,827 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-11 15:25:21,836 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-11 15:25:21,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:25:21,870 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:25:21,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21 WrapperNode [2024-10-11 15:25:21,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:25:21,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:25:21,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:25:21,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:25:21,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:21,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:21,992 INFO L138 Inliner]: procedures = 142, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1745 [2024-10-11 15:25:21,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:25:21,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:25:21,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:25:21,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:25:22,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,212 INFO L175 MemorySlicer]: Split 260 memory accesses to 10 slices as follows [2, 1, 8, 8, 25, 1, 1, 19, 4, 191]. 73 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 0, 8, 8, 0, 0, 0, 19, 0, 25]. The 57 writes are split as follows [0, 1, 0, 0, 3, 0, 1, 0, 2, 50]. [2024-10-11 15:25:22,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,262 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,303 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:25:22,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:25:22,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:25:22,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:25:22,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (1/1) ... [2024-10-11 15:25:22,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:25:22,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:25:22,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:25:22,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:25:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2024-10-11 15:25:22,411 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2024-10-11 15:25:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2024-10-11 15:25:22,412 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:25:22,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 15:25:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 15:25:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 15:25:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 15:25:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 15:25:22,417 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 15:25:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2024-10-11 15:25:22,417 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2024-10-11 15:25:22,417 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-10-11 15:25:22,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:25:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2024-10-11 15:25:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2024-10-11 15:25:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:25:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 15:25:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2024-10-11 15:25:22,419 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2024-10-11 15:25:22,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:25:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:25:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:25:22,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:25:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2024-10-11 15:25:22,425 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2024-10-11 15:25:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2024-10-11 15:25:22,429 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2024-10-11 15:25:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:25:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:25:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:25:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:25:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:25:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-10-11 15:25:22,430 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-11 15:25:22,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:25:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2024-10-11 15:25:22,431 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2024-10-11 15:25:22,431 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:25:22,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:25:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 15:25:22,432 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 15:25:22,829 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:25:22,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:25:23,113 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:25:23,755 INFO L? ?]: Removed 979 outVars from TransFormulas that were not future-live. [2024-10-11 15:25:23,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:25:23,893 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:25:23,894 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 15:25:23,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:23 BoogieIcfgContainer [2024-10-11 15:25:23,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:25:23,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:25:23,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:25:23,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:25:23,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:25:20" (1/3) ... [2024-10-11 15:25:23,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb41ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:23, skipping insertion in model container [2024-10-11 15:25:23,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:21" (2/3) ... [2024-10-11 15:25:23,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb41ba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:25:23, skipping insertion in model container [2024-10-11 15:25:23,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:23" (3/3) ... [2024-10-11 15:25:23,900 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-11 15:25:23,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:25:23,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:25:23,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:25:23,963 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;@213cb92a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:25:23,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:25:23,970 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-11 15:25:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 15:25:23,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:23,980 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-11 15:25:23,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash -782435346, now seen corresponding path program 1 times [2024-10-11 15:25:23,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:23,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292795788] [2024-10-11 15:25:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:24,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:24,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:24,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:25:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:24,375 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-11 15:25:24,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:24,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292795788] [2024-10-11 15:25:24,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292795788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:24,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:24,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:25:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245617599] [2024-10-11 15:25:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:24,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:25:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:24,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:25:24,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:25:24,400 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-11 15:25:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:25,306 INFO L93 Difference]: Finished difference Result 803 states and 1210 transitions. [2024-10-11 15:25:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 15:25:25,309 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-11 15:25:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:25,320 INFO L225 Difference]: With dead ends: 803 [2024-10-11 15:25:25,320 INFO L226 Difference]: Without dead ends: 422 [2024-10-11 15:25:25,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:25:25,333 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 460 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:25,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 585 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 15:25:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-10-11 15:25:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 352. [2024-10-11 15:25:25,386 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-11 15:25:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 499 transitions. [2024-10-11 15:25:25,391 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 499 transitions. Word has length 35 [2024-10-11 15:25:25,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:25,391 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 499 transitions. [2024-10-11 15:25:25,392 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-11 15:25:25,392 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 499 transitions. [2024-10-11 15:25:25,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 15:25:25,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:25,393 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-11 15:25:25,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:25:25,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:25,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash -720395732, now seen corresponding path program 1 times [2024-10-11 15:25:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831910720] [2024-10-11 15:25:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:25:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:25,561 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-11 15:25:25,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831910720] [2024-10-11 15:25:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831910720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:25,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:25:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535073944] [2024-10-11 15:25:25,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:25,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:25:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:25,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:25:25,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:25,564 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-11 15:25:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:27,071 INFO L93 Difference]: Finished difference Result 1156 states and 1697 transitions. [2024-10-11 15:25:27,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:25:27,072 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-11 15:25:27,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:27,079 INFO L225 Difference]: With dead ends: 1156 [2024-10-11 15:25:27,079 INFO L226 Difference]: Without dead ends: 814 [2024-10-11 15:25:27,080 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-11 15:25:27,081 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 1200 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 767 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 767 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:27,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 751 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [767 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 15:25:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2024-10-11 15:25:27,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 673. [2024-10-11 15:25:27,127 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-11 15:25:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 958 transitions. [2024-10-11 15:25:27,131 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 958 transitions. Word has length 35 [2024-10-11 15:25:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:27,132 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 958 transitions. [2024-10-11 15:25:27,132 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-11 15:25:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 958 transitions. [2024-10-11 15:25:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-11 15:25:27,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:27,133 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-11 15:25:27,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:25:27,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:27,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash -186725861, now seen corresponding path program 1 times [2024-10-11 15:25:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:27,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445144748] [2024-10-11 15:25:27,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:27,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:27,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:25:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:27,273 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-11 15:25:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445144748] [2024-10-11 15:25:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445144748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:27,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:27,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 15:25:27,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578767000] [2024-10-11 15:25:27,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:27,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 15:25:27,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:27,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 15:25:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 15:25:27,275 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-11 15:25:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:28,705 INFO L93 Difference]: Finished difference Result 1596 states and 2373 transitions. [2024-10-11 15:25:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:25:28,705 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-11 15:25:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:28,715 INFO L225 Difference]: With dead ends: 1596 [2024-10-11 15:25:28,715 INFO L226 Difference]: Without dead ends: 1590 [2024-10-11 15:25:28,716 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-11 15:25:28,717 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1228 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 775 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:28,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 759 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 15:25:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-10-11 15:25:28,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1316. [2024-10-11 15:25:28,789 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-11 15:25:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1873 transitions. [2024-10-11 15:25:28,797 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1873 transitions. Word has length 40 [2024-10-11 15:25:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:28,797 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1873 transitions. [2024-10-11 15:25:28,798 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-11 15:25:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1873 transitions. [2024-10-11 15:25:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 15:25:28,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:28,803 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-11 15:25:28,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:25:28,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:28,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash 480104822, now seen corresponding path program 1 times [2024-10-11 15:25:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814112018] [2024-10-11 15:25:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:28,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:25:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 15:25:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 15:25:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:25:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 15:25:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 15:25:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:29,018 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-11 15:25:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814112018] [2024-10-11 15:25:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814112018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:29,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 15:25:29,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901849770] [2024-10-11 15:25:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:29,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 15:25:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:29,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 15:25:29,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 15:25:29,021 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-11 15:25:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:31,323 INFO L93 Difference]: Finished difference Result 4817 states and 7169 transitions. [2024-10-11 15:25:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 15:25:31,324 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-11 15:25:31,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:31,342 INFO L225 Difference]: With dead ends: 4817 [2024-10-11 15:25:31,343 INFO L226 Difference]: Without dead ends: 3511 [2024-10-11 15:25:31,347 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-11 15:25:31,351 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1358 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:31,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 1071 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 15:25:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-11 15:25:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 2448. [2024-10-11 15:25:31,449 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-11 15:25:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2448 states to 2448 states and 3467 transitions. [2024-10-11 15:25:31,465 INFO L78 Accepts]: Start accepts. Automaton has 2448 states and 3467 transitions. Word has length 91 [2024-10-11 15:25:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:31,465 INFO L471 AbstractCegarLoop]: Abstraction has 2448 states and 3467 transitions. [2024-10-11 15:25:31,465 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-11 15:25:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2448 states and 3467 transitions. [2024-10-11 15:25:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 15:25:31,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:31,474 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-11 15:25:31,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:25:31,474 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1070203813, now seen corresponding path program 1 times [2024-10-11 15:25:31,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:31,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008726873] [2024-10-11 15:25:31,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:25:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 15:25:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:25:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:25:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:25:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 15:25:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 15:25:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:31,894 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-11 15:25:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008726873] [2024-10-11 15:25:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008726873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:25:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 15:25:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966214878] [2024-10-11 15:25:31,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:31,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 15:25:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:31,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 15:25:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 15:25:31,896 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-11 15:25:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:33,438 INFO L93 Difference]: Finished difference Result 5940 states and 8751 transitions. [2024-10-11 15:25:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:25:33,439 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-11 15:25:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:33,459 INFO L225 Difference]: With dead ends: 5940 [2024-10-11 15:25:33,459 INFO L226 Difference]: Without dead ends: 3506 [2024-10-11 15:25:33,468 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-11 15:25:33,470 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 554 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:33,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1321 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 15:25:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2024-10-11 15:25:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 2452. [2024-10-11 15:25:33,565 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-11 15:25:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3485 transitions. [2024-10-11 15:25:33,574 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3485 transitions. Word has length 125 [2024-10-11 15:25:33,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:33,576 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3485 transitions. [2024-10-11 15:25:33,576 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-11 15:25:33,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3485 transitions. [2024-10-11 15:25:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 15:25:33,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:33,580 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-11 15:25:33,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:25:33,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:33,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2009489349, now seen corresponding path program 1 times [2024-10-11 15:25:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398615196] [2024-10-11 15:25:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 15:25:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 15:25:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 15:25:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 15:25:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:25:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 15:25:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:25:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:34,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 15:25:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:25:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,056 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-11 15:25:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:34,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398615196] [2024-10-11 15:25:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398615196] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:25:34,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686215887] [2024-10-11 15:25:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:34,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:25:34,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:25:34,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:25:34,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 15:25:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:34,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 15:25:34,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:25:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-11 15:25:34,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:25:34,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686215887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:25:34,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 15:25:34,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-11 15:25:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864819770] [2024-10-11 15:25:34,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:25:34,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:25:34,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:25:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 15:25:34,511 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-11 15:25:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:34,741 INFO L93 Difference]: Finished difference Result 4894 states and 6960 transitions. [2024-10-11 15:25:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:25:34,741 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-11 15:25:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:34,752 INFO L225 Difference]: With dead ends: 4894 [2024-10-11 15:25:34,753 INFO L226 Difference]: Without dead ends: 2453 [2024-10-11 15:25:34,758 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-11 15:25:34,759 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 0 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 15:25:34,759 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-11 15:25:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2453 states. [2024-10-11 15:25:34,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2453 to 2453. [2024-10-11 15:25:34,955 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-11 15:25:34,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 3486 transitions. [2024-10-11 15:25:34,966 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 3486 transitions. Word has length 144 [2024-10-11 15:25:34,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:34,966 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 3486 transitions. [2024-10-11 15:25:34,966 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-11 15:25:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 3486 transitions. [2024-10-11 15:25:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 15:25:34,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:34,971 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-11 15:25:34,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 15:25:35,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:25:35,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:35,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1438997375, now seen corresponding path program 1 times [2024-10-11 15:25:35,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783250515] [2024-10-11 15:25:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:25:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 15:25:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 15:25:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 15:25:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 15:25:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 15:25:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:25:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 15:25:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 15:25:35,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,626 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-11 15:25:35,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:35,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783250515] [2024-10-11 15:25:35,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783250515] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:25:35,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793017614] [2024-10-11 15:25:35,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:35,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:25:35,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:25:35,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:25:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 15:25:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:35,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 15:25:36,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:25:36,045 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-11 15:25:36,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:25:36,208 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-11 15:25:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793017614] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:25:36,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:25:36,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 15:25:36,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301568554] [2024-10-11 15:25:36,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:25:36,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 15:25:36,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:36,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 15:25:36,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:25:36,211 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-11 15:25:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:38,123 INFO L93 Difference]: Finished difference Result 5957 states and 8787 transitions. [2024-10-11 15:25:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 15:25:38,123 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-11 15:25:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:38,148 INFO L225 Difference]: With dead ends: 5957 [2024-10-11 15:25:38,148 INFO L226 Difference]: Without dead ends: 3515 [2024-10-11 15:25:38,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2024-10-11 15:25:38,158 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 652 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 2243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:38,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1325 Invalid, 2243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 15:25:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3515 states. [2024-10-11 15:25:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3515 to 2461. [2024-10-11 15:25:38,260 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-11 15:25:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3496 transitions. [2024-10-11 15:25:38,270 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3496 transitions. Word has length 146 [2024-10-11 15:25:38,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:38,272 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3496 transitions. [2024-10-11 15:25:38,272 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-11 15:25:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3496 transitions. [2024-10-11 15:25:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 15:25:38,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:38,276 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-11 15:25:38,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 15:25:38,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:25:38,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:38,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:38,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2120898203, now seen corresponding path program 2 times [2024-10-11 15:25:38,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:38,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774852891] [2024-10-11 15:25:38,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:38,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:38,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:38,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:38,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 15:25:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 15:25:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 15:25:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 15:25:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 15:25:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 15:25:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:25:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 15:25:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 15:25:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:39,136 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-11 15:25:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774852891] [2024-10-11 15:25:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774852891] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:25:39,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342431941] [2024-10-11 15:25:39,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 15:25:39,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:25:39,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:25:39,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:25:39,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 15:25:39,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 15:25:39,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 15:25:39,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 15:25:39,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:25:39,696 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-11 15:25:39,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:25:39,936 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-11 15:25:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342431941] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:25:39,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:25:39,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 6] total 25 [2024-10-11 15:25:39,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118091018] [2024-10-11 15:25:39,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:25:39,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 15:25:39,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:39,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 15:25:39,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2024-10-11 15:25:39,939 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-11 15:25:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:43,314 INFO L93 Difference]: Finished difference Result 5962 states and 8790 transitions. [2024-10-11 15:25:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 15:25:43,315 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-11 15:25:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:43,336 INFO L225 Difference]: With dead ends: 5962 [2024-10-11 15:25:43,336 INFO L226 Difference]: Without dead ends: 3516 [2024-10-11 15:25:43,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2024-10-11 15:25:43,346 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 691 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 4618 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:43,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 3170 Invalid, 5164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 4618 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 15:25:43,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2024-10-11 15:25:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 2464. [2024-10-11 15:25:43,637 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-11 15:25:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3496 transitions. [2024-10-11 15:25:43,669 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3496 transitions. Word has length 150 [2024-10-11 15:25:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 2464 states and 3496 transitions. [2024-10-11 15:25:43,670 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-11 15:25:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3496 transitions. [2024-10-11 15:25:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-11 15:25:43,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:43,683 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-11 15:25:43,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 15:25:43,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:25:43,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:43,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash -968000768, now seen corresponding path program 3 times [2024-10-11 15:25:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438090879] [2024-10-11 15:25:43,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:43,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 15:25:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 15:25:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 15:25:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 15:25:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 15:25:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 15:25:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 15:25:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 15:25:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 15:25:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 15:25:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 15:25:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 15:25:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:25:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:25:44,919 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-11 15:25:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:25:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438090879] [2024-10-11 15:25:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438090879] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 15:25:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899802230] [2024-10-11 15:25:44,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 15:25:44,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 15:25:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:25:44,921 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 15:25:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 15:25:45,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-11 15:25:45,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 15:25:45,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 15:25:46,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:25:46,117 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-11 15:25:46,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:25:46,430 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-11 15:25:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899802230] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:25:46,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 15:25:46,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 26 [2024-10-11 15:25:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871289201] [2024-10-11 15:25:46,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 15:25:46,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 15:25:46,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:25:46,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 15:25:46,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2024-10-11 15:25:46,435 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-11 15:25:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:25:51,345 INFO L93 Difference]: Finished difference Result 5969 states and 8796 transitions. [2024-10-11 15:25:51,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 15:25:51,346 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-11 15:25:51,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:25:51,368 INFO L225 Difference]: With dead ends: 5969 [2024-10-11 15:25:51,368 INFO L226 Difference]: Without dead ends: 3523 [2024-10-11 15:25:51,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=529, Invalid=1823, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 15:25:51,378 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 498 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 4148 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:25:51,378 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.1s Time] [2024-10-11 15:25:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2024-10-11 15:25:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2471. [2024-10-11 15:25:51,568 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-11 15:25:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3504 transitions. [2024-10-11 15:25:51,579 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3504 transitions. Word has length 153 [2024-10-11 15:25:51,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:25:51,579 INFO L471 AbstractCegarLoop]: Abstraction has 2471 states and 3504 transitions. [2024-10-11 15:25:51,579 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-11 15:25:51,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3504 transitions. [2024-10-11 15:25:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-11 15:25:51,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:25:51,583 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-11 15:25:51,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 15:25:51,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-11 15:25:51,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:25:51,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:25:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1186923771, now seen corresponding path program 4 times [2024-10-11 15:25:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:25:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972737791] [2024-10-11 15:25:51,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:25:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:25:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 15:25:52,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 15:25:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 15:25:52,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 15:25:52,231 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 15:25:52,231 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 15:25:52,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 15:25:52,235 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2024-10-11 15:25:52,347 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 15:25:52,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:25:52 BoogieIcfgContainer [2024-10-11 15:25:52,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 15:25:52,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 15:25:52,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 15:25:52,351 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 15:25:52,351 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:25:23" (3/4) ... [2024-10-11 15:25:52,353 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 15:25:52,354 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 15:25:52,354 INFO L158 Benchmark]: Toolchain (without parser) took 31463.45ms. Allocated memory was 245.4MB in the beginning and 841.0MB in the end (delta: 595.6MB). Free memory was 211.2MB in the beginning and 521.6MB in the end (delta: -310.4MB). Peak memory consumption was 286.1MB. Max. memory is 16.1GB. [2024-10-11 15:25:52,354 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 130.0MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:25:52,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 979.02ms. Allocated memory is still 245.4MB. Free memory was 211.2MB in the beginning and 179.1MB in the end (delta: 32.1MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. [2024-10-11 15:25:52,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.67ms. Allocated memory is still 245.4MB. Free memory was 178.1MB in the beginning and 167.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 15:25:52,355 INFO L158 Benchmark]: Boogie Preprocessor took 329.62ms. Allocated memory is still 245.4MB. Free memory was 166.5MB in the beginning and 189.4MB in the end (delta: -22.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. [2024-10-11 15:25:52,355 INFO L158 Benchmark]: RCFGBuilder took 1570.51ms. Allocated memory was 245.4MB in the beginning and 348.1MB in the end (delta: 102.8MB). Free memory was 188.3MB in the beginning and 182.9MB in the end (delta: 5.4MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2024-10-11 15:25:52,356 INFO L158 Benchmark]: TraceAbstraction took 28454.55ms. Allocated memory was 348.1MB in the beginning and 841.0MB in the end (delta: 492.8MB). Free memory was 182.9MB in the beginning and 521.6MB in the end (delta: -338.6MB). Peak memory consumption was 154.1MB. Max. memory is 16.1GB. [2024-10-11 15:25:52,356 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 841.0MB. Free memory is still 521.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:25:52,357 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.14ms. Allocated memory is still 130.0MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 979.02ms. Allocated memory is still 245.4MB. Free memory was 211.2MB in the beginning and 179.1MB in the end (delta: 32.1MB). Peak memory consumption was 96.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.67ms. Allocated memory is still 245.4MB. Free memory was 178.1MB in the beginning and 167.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 329.62ms. Allocated memory is still 245.4MB. Free memory was 166.5MB in the beginning and 189.4MB in the end (delta: -22.9MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1570.51ms. Allocated memory was 245.4MB in the beginning and 348.1MB in the end (delta: 102.8MB). Free memory was 188.3MB in the beginning and 182.9MB in the end (delta: 5.4MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. * TraceAbstraction took 28454.55ms. Allocated memory was 348.1MB in the beginning and 841.0MB in the end (delta: 492.8MB). Free memory was 182.9MB in the beginning and 521.6MB in the end (delta: -338.6MB). Peak memory consumption was 154.1MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 841.0MB. Free memory is still 521.6MB. 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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015: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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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={4294967298:4294967303}, 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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) 2 << 64) | 1):0}, ref_cnt=0, size=1048, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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) 2 << 64) | 1):0}, ref_cnt=0, size=1048, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):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={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp___0=1, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp___0=2, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4095] case 0: [L4125] case 1: [L4163] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4163] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4163] case 2: [L4165] tmp___3 = __VERIFIER_nondet_int() [L4167] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4163] case 2: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4381] RET, EXPR ldv_malloc(sizeof(struct bio)) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4216] bool tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ptr)={0:0}, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={0:0}, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={4294967300:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4312] COND FALSE !(ldv_blk_rq != 0) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4316] CALL, EXPR ldv_malloc(sizeof(struct request)) VAL [LDV_IN_INTERRUPT=1, \old(size)=322, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3265] CALL, EXPR IS_ERR(p) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={2012:0}, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4216] bool tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ptr)={2012:0}, __this_module={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={2012:0}, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4242] return ((unsigned long )ptr > 2012UL); [L4218] RET, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={2012:0}, __this_module={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3265] CALL assume_abort_if_not(IS_ERR(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3249] COND FALSE !(!cond) VAL [LDV_IN_INTERRUPT=1, \old(cond)=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3265] RET assume_abort_if_not(IS_ERR(p) == 0) VAL [LDV_IN_INTERRUPT=1, \old(size)=322, __this_module={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3266] return (p); VAL [LDV_IN_INTERRUPT=1, \old(size)=322, \result={2012:0}, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4316] RET, EXPR ldv_malloc(sizeof(struct request)) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2012:0}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4321] CALL, EXPR IS_ERR___0((void const *)res) [L4277] long tmp ; VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3333] return (exp); [L4279] RET, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2012:0}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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)={2012:0}, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4216] bool tmp ; VAL [LDV_IN_INTERRUPT=1, \old(ptr)={2012:0}, __this_module={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={2012:0}, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4242] return ((unsigned long )ptr > 2012UL); [L4218] RET, EXPR ldv_is_err(ptr) VAL [LDV_IN_INTERRUPT=1, \old(ptr)={2012:0}, __this_module={4294967298:4294967303}, 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={2012:0}, ref_cnt=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2012:0}, vblk={4294967300:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, err=1, features={10:0}, id_str={2014: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={4294967300:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L3779] return (err); [L3779] return (err); VAL [LDV_IN_INTERRUPT=1, \result=1, __this_module={4294967298:4294967303}, 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={4294967300:-2}, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp___0=1, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 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={4294967298:4294967303}, 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={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={8:0}, virtblk_fops_group0={-(((__int128) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4194] CALL ldv_check_final_state() [L4343] COND TRUE ldv_blk_rq != 0 VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4344] CALL ldv_error() VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] [L4236] reach_error() VAL [LDV_IN_INTERRUPT=1, __this_module={4294967298:4294967303}, 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) 1 << 64) | 18446744073709551615U):0}, virtio_blk={11:0}, virtio_blk_group0={-(((__int128) 2 << 64) | 1):0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 368 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.3s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6967 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6641 mSDsluCounter, 13147 SdHoareTripleChecker+Invalid, 12.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10707 mSDsCounter, 4426 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16323 IncrementalHoareTripleChecker+Invalid, 20749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4426 mSolverCounterUnsat, 2440 mSDtfsCounter, 16323 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1454 GetRequests, 1282 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 3.2s 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 5760 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1668 NumberOfCodeBlocks, 1668 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1945 ConstructedInterpolants, 0 QuantifiedInterpolants, 3032 SizeOfPredicates, 1 NumberOfNonLiveVariables, 4399 ConjunctsInSsa, 84 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-11 15:25:52,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-84cfde4 [2024-10-11 15:25:54,681 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:25:54,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 15:25:54,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:25:54,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:25:54,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:25:54,783 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:25:54,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:25:54,784 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:25:54,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:25:54,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:25:54,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:25:54,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:25:54,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:25:54,788 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:25:54,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:25:54,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:25:54,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:25:54,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:25:54,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:25:54,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:25:54,789 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 15:25:54,792 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 15:25:54,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:25:54,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 15:25:54,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:25:54,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:25:54,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:25:54,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:25:54,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:25:54,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:25:54,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:25:54,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:25:54,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:25:54,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:25:54,794 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 15:25:54,794 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 15:25:54,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:25:54,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:25:54,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:25:54,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:25:54,795 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 15:25:54,795 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-clean/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-clean/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-11 15:25:55,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:25:55,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:25:55,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:25:55,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:25:55,101 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:25:55,102 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-11 15:25:56,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:25:57,028 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:25:57,029 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-11 15:25:57,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b6172ccb/b4f9c4cb8356495ab04c7d37e55804ce/FLAGa063cf865 [2024-10-11 15:25:57,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9b6172ccb/b4f9c4cb8356495ab04c7d37e55804ce [2024-10-11 15:25:57,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:25:57,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:25:57,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:25:57,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:25:57,233 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:25:57,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:57" (1/1) ... [2024-10-11 15:25:57,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c8098bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:57, skipping insertion in model container [2024-10-11 15:25:57,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:25:57" (1/1) ... [2024-10-11 15:25:57,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:25:58,064 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-11 15:25:58,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:25:58,116 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 15:25:58,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:25:58,259 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-11 15:25:58,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:25:58,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:25:58,331 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-11 15:25:58,341 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-11 15:25:58,344 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-11 15:25:58,345 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-11 15:25:58,397 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-11 15:25:58,405 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-11 15:25:58,452 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-11 15:25:58,472 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-11 15:25:58,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:25:58,538 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:25:58,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58 WrapperNode [2024-10-11 15:25:58,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:25:58,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:25:58,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:25:58,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:25:58,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,660 INFO L138 Inliner]: procedures = 149, calls = 525, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1670 [2024-10-11 15:25:58,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:25:58,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:25:58,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:25:58,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:25:58,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,861 INFO L175 MemorySlicer]: Split 260 memory accesses to 10 slices as follows [2, 4, 8, 1, 8, 191, 25, 19, 1, 1]. 73 percent of accesses are in the largest equivalence class. The 62 initializations are split as follows [2, 0, 8, 0, 8, 25, 0, 19, 0, 0]. The 57 writes are split as follows [0, 2, 0, 1, 0, 50, 3, 0, 0, 1]. [2024-10-11 15:25:58,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,923 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,969 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:25:58,970 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:25:58,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:25:58,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:25:58,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (1/1) ... [2024-10-11 15:25:58,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:25:58,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:25:59,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 15:25:59,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 15:25:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2024-10-11 15:25:59,046 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2024-10-11 15:25:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 15:25:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 15:25:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 15:25:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#4 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#5 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#6 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#7 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#8 [2024-10-11 15:25:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#9 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-10-11 15:25:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-10-11 15:25:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-10-11 15:25:59,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2024-10-11 15:25:59,054 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2024-10-11 15:25:59,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2024-10-11 15:25:59,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~C_UINT~X~$Pointer$~X~C_UINT~TO~VOID [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~C_UINT~X~$Pointer$~X~C_UINT~TO~VOID [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:25:59,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:25:59,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2024-10-11 15:25:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2024-10-11 15:25:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2024-10-11 15:25:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 15:25:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2024-10-11 15:25:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2024-10-11 15:25:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2024-10-11 15:25:59,056 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:25:59,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-10-11 15:25:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-10-11 15:25:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-10-11 15:25:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:25:59,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2024-10-11 15:25:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2024-10-11 15:25:59,062 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2024-10-11 15:25:59,062 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2024-10-11 15:25:59,063 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2024-10-11 15:25:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:25:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:25:59,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:25:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:25:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:25:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:25:59,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-10-11 15:25:59,067 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-11 15:25:59,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#4 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#5 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#6 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#7 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#8 [2024-10-11 15:25:59,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#9 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2024-10-11 15:25:59,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 15:25:59,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 15:25:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-10-11 15:25:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-10-11 15:25:59,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 15:25:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-10-11 15:25:59,076 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2024-10-11 15:25:59,076 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2024-10-11 15:25:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2024-10-11 15:25:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2024-10-11 15:25:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:25:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:25:59,077 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 15:25:59,077 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 15:25:59,606 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:25:59,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:25:59,711 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2024-10-11 15:26:07,472 INFO L? ?]: Removed 971 outVars from TransFormulas that were not future-live. [2024-10-11 15:26:07,472 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:26:07,677 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:26:07,677 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 15:26:07,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:07 BoogieIcfgContainer [2024-10-11 15:26:07,678 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:26:07,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:26:07,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:26:07,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:26:07,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:25:57" (1/3) ... [2024-10-11 15:26:07,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0dce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:07, skipping insertion in model container [2024-10-11 15:26:07,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:25:58" (2/3) ... [2024-10-11 15:26:07,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0dce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:26:07, skipping insertion in model container [2024-10-11 15:26:07,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:26:07" (3/3) ... [2024-10-11 15:26:07,685 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-11 15:26:07,702 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:26:07,702 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:26:07,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:26:07,827 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;@387f36c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:26:07,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:26:07,841 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-11 15:26:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 15:26:07,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:07,854 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-11 15:26:07,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:07,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2073759364, now seen corresponding path program 1 times [2024-10-11 15:26:07,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:07,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092024353] [2024-10-11 15:26:07,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:07,886 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-11 15:26:07,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:07,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 15:26:07,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:08,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 15:26:08,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:08,256 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-11 15:26:08,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:08,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:08,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092024353] [2024-10-11 15:26:08,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092024353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:08,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:08,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:26:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391517384] [2024-10-11 15:26:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:08,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 15:26:08,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 15:26:08,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 15:26:08,298 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-11 15:26:11,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:12,163 INFO L93 Difference]: Finished difference Result 709 states and 1041 transitions. [2024-10-11 15:26:12,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 15:26:12,166 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-11 15:26:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:12,175 INFO L225 Difference]: With dead ends: 709 [2024-10-11 15:26:12,176 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 15:26:12,181 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-11 15:26:12,184 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 3.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:12,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-11 15:26:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 15:26:12,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-10-11 15:26:12,256 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-11 15:26:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 483 transitions. [2024-10-11 15:26:12,262 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 483 transitions. Word has length 35 [2024-10-11 15:26:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:12,263 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 483 transitions. [2024-10-11 15:26:12,263 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-11 15:26:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 483 transitions. [2024-10-11 15:26:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 15:26:12,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:12,265 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-11 15:26:12,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 15:26:12,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 15:26:12,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:12,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:12,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2135798978, now seen corresponding path program 1 times [2024-10-11 15:26:12,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:12,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417612292] [2024-10-11 15:26:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:12,468 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-11 15:26:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:12,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 15:26:12,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 15:26:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:12,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 15:26:12,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:12,836 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-11 15:26:12,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:12,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:12,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417612292] [2024-10-11 15:26:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417612292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:12,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:12,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 15:26:12,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398164813] [2024-10-11 15:26:12,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:12,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 15:26:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:12,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 15:26:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:26:12,839 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) [2024-10-11 15:26:17,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:18,800 INFO L93 Difference]: Finished difference Result 680 states and 964 transitions. [2024-10-11 15:26:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 15:26:18,800 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 35 [2024-10-11 15:26:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:18,803 INFO L225 Difference]: With dead ends: 680 [2024-10-11 15:26:18,803 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 15:26:18,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 15:26:18,805 INFO L432 NwaCegarLoop]: 409 mSDtfsCounter, 0 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:18,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1221 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-11 15:26:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 15:26:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-10-11 15:26:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 238 states have (on average 1.3781512605042017) internal successors, (328), 246 states have internal predecessors, (328), 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-11 15:26:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 484 transitions. [2024-10-11 15:26:18,822 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 484 transitions. Word has length 35 [2024-10-11 15:26:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:18,823 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 484 transitions. [2024-10-11 15:26:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-10-11 15:26:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 484 transitions. [2024-10-11 15:26:18,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 15:26:18,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:18,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:26:18,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 15:26:19,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 15:26:19,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1108833560, now seen corresponding path program 1 times [2024-10-11 15:26:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:19,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766251096] [2024-10-11 15:26:19,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:19,027 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-11 15:26:19,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:19,037 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 15:26:19,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (4)] Waiting until timeout for monitored process [2024-10-11 15:26:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:19,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 15:26:19,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:19,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 15:26:19,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:26:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 15:26:19,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766251096] [2024-10-11 15:26:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766251096] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:26:19,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 15:26:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 15:26:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648800904] [2024-10-11 15:26:19,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 15:26:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 15:26:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:19,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 15:26:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:26:19,694 INFO L87 Difference]: Start difference. First operand 342 states and 484 transitions. Second operand has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 15:26:27,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:30,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:31,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:32,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:35,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:35,673 INFO L93 Difference]: Finished difference Result 689 states and 977 transitions. [2024-10-11 15:26:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 15:26:35,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 37 [2024-10-11 15:26:35,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:35,677 INFO L225 Difference]: With dead ends: 689 [2024-10-11 15:26:35,677 INFO L226 Difference]: Without dead ends: 350 [2024-10-11 15:26:35,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-11 15:26:35,679 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 4 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:35,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2028 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2024-10-11 15:26:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-11 15:26:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-10-11 15:26:35,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 245 states have (on average 1.379591836734694) internal successors, (338), 253 states have internal predecessors, (338), 79 states have call successors, (79), 26 states have call predecessors, (79), 25 states have return successors, (77), 77 states have call predecessors, (77), 77 states have call successors, (77) [2024-10-11 15:26:35,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 494 transitions. [2024-10-11 15:26:35,695 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 494 transitions. Word has length 37 [2024-10-11 15:26:35,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:35,696 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 494 transitions. [2024-10-11 15:26:35,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 5.333333333333333) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 15:26:35,696 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 494 transitions. [2024-10-11 15:26:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-11 15:26:35,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:35,697 INFO L215 NwaCegarLoop]: trace histogram [6, 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-11 15:26:35,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (4)] Ended with exit code 0 [2024-10-11 15:26:35,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 15:26:35,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:35,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:35,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2041814306, now seen corresponding path program 2 times [2024-10-11 15:26:35,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:35,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462718700] [2024-10-11 15:26:35,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 15:26:35,900 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-11 15:26:35,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:35,903 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 15:26:35,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Waiting until timeout for monitored process [2024-10-11 15:26:36,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 15:26:36,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 15:26:36,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 15:26:36,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 15:26:36,321 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 15:26:36,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:36,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462718700] [2024-10-11 15:26:36,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462718700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:26:36,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:26:36,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 15:26:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087539313] [2024-10-11 15:26:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:26:36,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:26:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:26:36,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:36,326 INFO L87 Difference]: Start difference. First operand 350 states and 494 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 15:26:39,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:43,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 15:26:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:26:43,621 INFO L93 Difference]: Finished difference Result 994 states and 1412 transitions. [2024-10-11 15:26:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:26:43,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2024-10-11 15:26:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:26:43,628 INFO L225 Difference]: With dead ends: 994 [2024-10-11 15:26:43,628 INFO L226 Difference]: Without dead ends: 663 [2024-10-11 15:26:43,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:26:43,630 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 443 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:26:43,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 812 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-10-11 15:26:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-10-11 15:26:43,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 660. [2024-10-11 15:26:43,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 464 states have (on average 1.3814655172413792) internal successors, (641), 479 states have internal predecessors, (641), 149 states have call successors, (149), 47 states have call predecessors, (149), 46 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2024-10-11 15:26:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 937 transitions. [2024-10-11 15:26:43,668 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 937 transitions. Word has length 41 [2024-10-11 15:26:43,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:26:43,669 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 937 transitions. [2024-10-11 15:26:43,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 15:26:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 937 transitions. [2024-10-11 15:26:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 15:26:43,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:26:43,670 INFO L215 NwaCegarLoop]: trace histogram [6, 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-11 15:26:43,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (5)] Ended with exit code 0 [2024-10-11 15:26:43,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 15:26:43,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:26:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:26:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 664912176, now seen corresponding path program 1 times [2024-10-11 15:26:43,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 15:26:43,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772545333] [2024-10-11 15:26:43,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:26:43,872 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-11 15:26:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 15:26:43,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 15:26:43,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (6)] Waiting until timeout for monitored process [2024-10-11 15:26:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:26:44,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 15:26:44,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 15:26:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 15:26:44,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 15:26:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 15:26:45,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 15:26:45,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772545333] [2024-10-11 15:26:45,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772545333] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 15:26:45,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 15:26:45,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 15:26:45,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586189733] [2024-10-11 15:26:45,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 15:26:45,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 15:26:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 15:26:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 15:26:45,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-11 15:26:45,020 INFO L87 Difference]: Start difference. First operand 660 states and 937 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)