./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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.2-?-f4b24e3 [2022-07-14 00:46:03,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:46:03,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:46:03,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:46:03,826 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:46:03,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:46:03,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:46:03,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:46:03,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:46:03,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:46:03,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:46:03,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:46:03,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:46:03,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:46:03,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:46:03,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:46:03,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:46:03,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:46:03,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:46:03,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:46:03,869 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:46:03,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:46:03,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:46:03,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:46:03,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:46:03,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:46:03,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:46:03,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:46:03,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:46:03,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:46:03,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:46:03,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:46:03,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:46:03,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:46:03,898 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:46:03,899 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:46:03,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:46:03,900 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:46:03,900 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:46:03,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:46:03,901 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:46:03,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:46:03,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:46:03,937 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:46:03,937 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:46:03,938 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:46:03,938 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:46:03,938 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:46:03,939 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:46:03,939 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:46:03,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:46:03,940 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:46:03,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:46:03,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:46:03,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:46:03,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:46:03,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:46:03,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:46:03,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:46:03,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:46:03,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:46:03,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:46:03,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:46:03,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:46:03,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:46:03,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:46:03,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:46:03,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:46:03,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:46:03,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:46:03,945 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:46:03,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:46:03,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:46:03,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-07-14 00:46:04,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:46:04,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:46:04,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:46:04,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:46:04,181 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:46:04,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:46:04,256 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf3c4eeb/336fdb02f2d543eabdcaea460513d280/FLAGe63d3140e [2022-07-14 00:46:04,908 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:46:04,908 INFO L160 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 [2022-07-14 00:46:04,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf3c4eeb/336fdb02f2d543eabdcaea460513d280/FLAGe63d3140e [2022-07-14 00:46:05,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf3c4eeb/336fdb02f2d543eabdcaea460513d280 [2022-07-14 00:46:05,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:46:05,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:46:05,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:46:05,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:46:05,289 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:46:05,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:46:05" (1/1) ... [2022-07-14 00:46:05,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@150df96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:05, skipping insertion in model container [2022-07-14 00:46:05,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:46:05" (1/1) ... [2022-07-14 00:46:05,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:46:05,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:46:06,130 WARN L230 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] [2022-07-14 00:46:06,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:46:06,185 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:46:06,450 WARN L230 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] [2022-07-14 00:46:06,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:46:06,493 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:46:06,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06 WrapperNode [2022-07-14 00:46:06,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:46:06,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:46:06,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:46:06,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:46:06,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,647 INFO L137 Inliner]: procedures = 142, calls = 521, calls flagged for inlining = 83, calls inlined = 83, statements flattened = 1668 [2022-07-14 00:46:06,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:46:06,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:46:06,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:46:06,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:46:06,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:46:06,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:46:06,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:46:06,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:46:06,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (1/1) ... [2022-07-14 00:46:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:46:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:06,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 00:46:06,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 00:46:06,887 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_segment_size [2022-07-14 00:46:06,888 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_segment_size [2022-07-14 00:46:06,888 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_config_buf [2022-07-14 00:46:06,888 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_config_buf [2022-07-14 00:46:06,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:46:06,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:46:06,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:46:06,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 00:46:06,889 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 00:46:06,889 INFO L130 BoogieDeclarations]: Found specification of procedure req_get_ioprio [2022-07-14 00:46:06,889 INFO L138 BoogieDeclarations]: Found implementation of procedure req_get_ioprio [2022-07-14 00:46:06,889 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-14 00:46:06,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~TO~VOID [2022-07-14 00:46:06,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:46:06,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:46:06,890 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_free [2022-07-14 00:46:06,890 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_free [2022-07-14 00:46:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure sg_set_buf [2022-07-14 00:46:06,892 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_set_buf [2022-07-14 00:46:06,892 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:46:06,892 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:46:06,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:46:06,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-14 00:46:06,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-14 00:46:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 00:46:06,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 00:46:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure index_to_minor [2022-07-14 00:46:06,893 INFO L138 BoogieDeclarations]: Found implementation of procedure index_to_minor [2022-07-14 00:46:06,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 00:46:06,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 00:46:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:46:06,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:46:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:46:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-14 00:46:06,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-14 00:46:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-14 00:46:06,895 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-14 00:46:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:46:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure virtio_has_feature [2022-07-14 00:46:06,895 INFO L138 BoogieDeclarations]: Found implementation of procedure virtio_has_feature [2022-07-14 00:46:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:46:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:46:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 00:46:06,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 00:46:06,896 INFO L130 BoogieDeclarations]: Found specification of procedure virtblk_remove [2022-07-14 00:46:06,897 INFO L138 BoogieDeclarations]: Found implementation of procedure virtblk_remove [2022-07-14 00:46:06,897 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-07-14 00:46:06,897 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-07-14 00:46:06,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:46:06,897 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-14 00:46:06,897 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-14 00:46:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 00:46:06,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 00:46:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:46:06,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:46:06,899 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-14 00:46:06,899 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-14 00:46:06,900 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_ordered [2022-07-14 00:46:06,900 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_ordered [2022-07-14 00:46:06,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:46:06,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:46:06,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:46:06,902 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-14 00:46:06,902 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-14 00:46:07,313 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:46:07,319 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:46:07,796 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:46:08,346 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:46:08,361 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:46:08,361 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:46:08,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:46:08 BoogieIcfgContainer [2022-07-14 00:46:08,363 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:46:08,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:46:08,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:46:08,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:46:08,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:46:05" (1/3) ... [2022-07-14 00:46:08,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d3cc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:46:08, skipping insertion in model container [2022-07-14 00:46:08,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:06" (2/3) ... [2022-07-14 00:46:08,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d3cc79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:46:08, skipping insertion in model container [2022-07-14 00:46:08,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:46:08" (3/3) ... [2022-07-14 00:46:08,370 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:46:08,381 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:46:08,382 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:46:08,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:46:08,473 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@396d8056, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c3fce66 [2022-07-14 00:46:08,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:46:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 352 states have (on average 1.2982954545454546) internal successors, (457), 364 states have internal predecessors, (457), 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) [2022-07-14 00:46:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 00:46:08,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:08,490 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:08,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1450174539, now seen corresponding path program 1 times [2022-07-14 00:46:08,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:08,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150726777] [2022-07-14 00:46:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:08,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:08,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:46:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 00:46:08,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:08,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150726777] [2022-07-14 00:46:08,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150726777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:08,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:08,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:46:08,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840896095] [2022-07-14 00:46:08,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:08,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:46:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:46:08,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:46:08,922 INFO L87 Difference]: Start difference. First operand has 463 states, 352 states have (on average 1.2982954545454546) internal successors, (457), 364 states have internal predecessors, (457), 84 states have call successors, (84), 26 states have call predecessors, (84), 25 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 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) [2022-07-14 00:46:09,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:09,831 INFO L93 Difference]: Finished difference Result 1020 states and 1424 transitions. [2022-07-14 00:46:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:46:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 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 46 [2022-07-14 00:46:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:09,849 INFO L225 Difference]: With dead ends: 1020 [2022-07-14 00:46:09,849 INFO L226 Difference]: Without dead ends: 542 [2022-07-14 00:46:09,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:46:09,862 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 294 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:09,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1199 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 00:46:09,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-14 00:46:09,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 445. [2022-07-14 00:46:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 341 states have (on average 1.2609970674486803) internal successors, (430), 346 states have internal predecessors, (430), 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) [2022-07-14 00:46:09,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 586 transitions. [2022-07-14 00:46:09,954 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 586 transitions. Word has length 46 [2022-07-14 00:46:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:09,955 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 586 transitions. [2022-07-14 00:46:09,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 2 states have internal predecessors, (31), 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) [2022-07-14 00:46:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 586 transitions. [2022-07-14 00:46:09,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 00:46:09,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:09,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:09,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:46:09,959 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:09,960 INFO L85 PathProgramCache]: Analyzing trace with hash 606169037, now seen corresponding path program 1 times [2022-07-14 00:46:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:09,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224568670] [2022-07-14 00:46:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:09,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:46:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 00:46:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:10,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224568670] [2022-07-14 00:46:10,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224568670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:10,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:10,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:46:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746444262] [2022-07-14 00:46:10,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:10,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:46:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:46:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:46:10,184 INFO L87 Difference]: Start difference. First operand 445 states and 586 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-07-14 00:46:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:11,676 INFO L93 Difference]: Finished difference Result 1470 states and 1993 transitions. [2022-07-14 00:46:11,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:46:11,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 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 46 [2022-07-14 00:46:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:11,685 INFO L225 Difference]: With dead ends: 1470 [2022-07-14 00:46:11,685 INFO L226 Difference]: Without dead ends: 1039 [2022-07-14 00:46:11,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:46:11,689 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 1185 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:11,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 1581 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 00:46:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2022-07-14 00:46:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 846. [2022-07-14 00:46:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 651 states have (on average 1.2642089093701996) internal successors, (823), 660 states have internal predecessors, (823), 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) [2022-07-14 00:46:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1119 transitions. [2022-07-14 00:46:11,759 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1119 transitions. Word has length 46 [2022-07-14 00:46:11,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:11,760 INFO L495 AbstractCegarLoop]: Abstraction has 846 states and 1119 transitions. [2022-07-14 00:46:11,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 3 states have internal predecessors, (31), 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) [2022-07-14 00:46:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1119 transitions. [2022-07-14 00:46:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 00:46:11,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:11,770 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:11,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:46:11,771 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1350486453, now seen corresponding path program 1 times [2022-07-14 00:46:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:11,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326451582] [2022-07-14 00:46:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:11,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:46:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 00:46:11,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326451582] [2022-07-14 00:46:11,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326451582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:11,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:11,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:46:11,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488678936] [2022-07-14 00:46:11,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:11,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:46:11,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:11,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:46:11,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:46:11,926 INFO L87 Difference]: Start difference. First operand 846 states and 1119 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 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) [2022-07-14 00:46:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:13,383 INFO L93 Difference]: Finished difference Result 2038 states and 2791 transitions. [2022-07-14 00:46:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:46:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 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 49 [2022-07-14 00:46:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:13,399 INFO L225 Difference]: With dead ends: 2038 [2022-07-14 00:46:13,400 INFO L226 Difference]: Without dead ends: 2029 [2022-07-14 00:46:13,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:46:13,406 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 1091 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:13,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1646 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 00:46:13,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2022-07-14 00:46:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1653. [2022-07-14 00:46:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1274 states have (on average 1.2637362637362637) internal successors, (1610), 1291 states have internal predecessors, (1610), 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) [2022-07-14 00:46:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2186 transitions. [2022-07-14 00:46:13,510 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2186 transitions. Word has length 49 [2022-07-14 00:46:13,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:13,513 INFO L495 AbstractCegarLoop]: Abstraction has 1653 states and 2186 transitions. [2022-07-14 00:46:13,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 3 states have internal predecessors, (34), 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) [2022-07-14 00:46:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2186 transitions. [2022-07-14 00:46:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 00:46:13,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:13,521 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:13,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:46:13,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash -403228486, now seen corresponding path program 1 times [2022-07-14 00:46:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:13,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65308176] [2022-07-14 00:46:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:13,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:13,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:46:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-14 00:46:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 00:46:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-14 00:46:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:46:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 00:46:13,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65308176] [2022-07-14 00:46:13,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65308176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:13,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:13,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:46:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821192015] [2022-07-14 00:46:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:13,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:46:13,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:46:13,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:46:13,742 INFO L87 Difference]: Start difference. First operand 1653 states and 2186 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 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) [2022-07-14 00:46:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:15,332 INFO L93 Difference]: Finished difference Result 6066 states and 8330 transitions. [2022-07-14 00:46:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:46:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 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 110 [2022-07-14 00:46:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:15,370 INFO L225 Difference]: With dead ends: 6066 [2022-07-14 00:46:15,370 INFO L226 Difference]: Without dead ends: 4427 [2022-07-14 00:46:15,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:46:15,381 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 1573 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 900 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 900 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:15,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 1678 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [900 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 00:46:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4427 states. [2022-07-14 00:46:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4427 to 3063. [2022-07-14 00:46:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2352 states have (on average 1.2610544217687074) internal successors, (2966), 2385 states have internal predecessors, (2966), 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) [2022-07-14 00:46:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4034 transitions. [2022-07-14 00:46:15,549 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4034 transitions. Word has length 110 [2022-07-14 00:46:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:15,550 INFO L495 AbstractCegarLoop]: Abstraction has 3063 states and 4034 transitions. [2022-07-14 00:46:15,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 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) [2022-07-14 00:46:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4034 transitions. [2022-07-14 00:46:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 00:46:15,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:15,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:15,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:46:15,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1207270975, now seen corresponding path program 1 times [2022-07-14 00:46:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:15,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479686393] [2022-07-14 00:46:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:46:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 00:46:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 00:46:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:46:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:46:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 00:46:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:46:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 00:46:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-14 00:46:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:15,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479686393] [2022-07-14 00:46:15,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479686393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:15,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:15,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:46:15,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596729922] [2022-07-14 00:46:15,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:15,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:46:15,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:15,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:46:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:46:15,848 INFO L87 Difference]: Start difference. First operand 3063 states and 4034 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 00:46:17,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:17,092 INFO L93 Difference]: Finished difference Result 7475 states and 10179 transitions. [2022-07-14 00:46:17,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:46:17,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 153 [2022-07-14 00:46:17,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:17,134 INFO L225 Difference]: With dead ends: 7475 [2022-07-14 00:46:17,134 INFO L226 Difference]: Without dead ends: 4430 [2022-07-14 00:46:17,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:46:17,192 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 634 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:17,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1975 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 00:46:17,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4430 states. [2022-07-14 00:46:17,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4430 to 3066. [2022-07-14 00:46:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2355 states have (on average 1.259872611464968) internal successors, (2967), 2388 states have internal predecessors, (2967), 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) [2022-07-14 00:46:17,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 4035 transitions. [2022-07-14 00:46:17,373 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 4035 transitions. Word has length 153 [2022-07-14 00:46:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:17,374 INFO L495 AbstractCegarLoop]: Abstraction has 3066 states and 4035 transitions. [2022-07-14 00:46:17,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 00:46:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 4035 transitions. [2022-07-14 00:46:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-14 00:46:17,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:17,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:17,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:46:17,382 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:17,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2012347474, now seen corresponding path program 1 times [2022-07-14 00:46:17,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:17,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361486506] [2022-07-14 00:46:17,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:17,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:46:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:46:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:46:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 00:46:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:46:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 00:46:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-14 00:46:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:17,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361486506] [2022-07-14 00:46:17,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361486506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:17,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:17,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:46:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042263364] [2022-07-14 00:46:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:17,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:46:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:17,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:46:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:46:17,742 INFO L87 Difference]: Start difference. First operand 3066 states and 4035 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 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) [2022-07-14 00:46:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:19,188 INFO L93 Difference]: Finished difference Result 7468 states and 10163 transitions. [2022-07-14 00:46:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:46:19,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 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 154 [2022-07-14 00:46:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:19,220 INFO L225 Difference]: With dead ends: 7468 [2022-07-14 00:46:19,220 INFO L226 Difference]: Without dead ends: 4422 [2022-07-14 00:46:19,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:46:19,236 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 457 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 1651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:19,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2700 Invalid, 1651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 00:46:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2022-07-14 00:46:19,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 3070. [2022-07-14 00:46:19,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3070 states, 2357 states have (on average 1.2596521001272805) internal successors, (2969), 2392 states have internal predecessors, (2969), 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) [2022-07-14 00:46:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 4053 transitions. [2022-07-14 00:46:19,401 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 4053 transitions. Word has length 154 [2022-07-14 00:46:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:19,401 INFO L495 AbstractCegarLoop]: Abstraction has 3070 states and 4053 transitions. [2022-07-14 00:46:19,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 4 states have internal predecessors, (87), 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) [2022-07-14 00:46:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 4053 transitions. [2022-07-14 00:46:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-14 00:46:19,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:19,409 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:19,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:46:19,409 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash 999453106, now seen corresponding path program 1 times [2022-07-14 00:46:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:19,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005703135] [2022-07-14 00:46:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-14 00:46:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 00:46:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 00:46:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 00:46:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 00:46:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:46:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:46:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 00:46:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 00:46:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-14 00:46:19,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:19,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005703135] [2022-07-14 00:46:19,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005703135] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:19,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371267863] [2022-07-14 00:46:19,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:19,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:19,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:19,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 00:46:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:20,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 00:46:20,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-14 00:46:20,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:46:20,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371267863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:20,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:46:20,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-14 00:46:20,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983980699] [2022-07-14 00:46:20,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:20,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:46:20,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:20,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:46:20,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:46:20,258 INFO L87 Difference]: Start difference. First operand 3070 states and 4053 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:46:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:20,408 INFO L93 Difference]: Finished difference Result 6128 states and 8094 transitions. [2022-07-14 00:46:20,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:46:20,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 175 [2022-07-14 00:46:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:20,426 INFO L225 Difference]: With dead ends: 6128 [2022-07-14 00:46:20,426 INFO L226 Difference]: Without dead ends: 3071 [2022-07-14 00:46:20,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:46:20,439 INFO L413 NwaCegarLoop]: 584 mSDtfsCounter, 3 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:20,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1747 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:46:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2022-07-14 00:46:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2022-07-14 00:46:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3071 states, 2358 states have (on average 1.2595419847328244) internal successors, (2970), 2393 states have internal predecessors, (2970), 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) [2022-07-14 00:46:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4054 transitions. [2022-07-14 00:46:20,602 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4054 transitions. Word has length 175 [2022-07-14 00:46:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:20,602 INFO L495 AbstractCegarLoop]: Abstraction has 3071 states and 4054 transitions. [2022-07-14 00:46:20,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:46:20,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4054 transitions. [2022-07-14 00:46:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-14 00:46:20,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:20,610 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:20,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:20,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:20,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash -492521926, now seen corresponding path program 1 times [2022-07-14 00:46:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:20,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961395827] [2022-07-14 00:46:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:20,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:20,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:20,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 00:46:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 00:46:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 00:46:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-14 00:46:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-14 00:46:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:46:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:46:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:46:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 00:46:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,142 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-14 00:46:21,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961395827] [2022-07-14 00:46:21,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961395827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:21,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136192432] [2022-07-14 00:46:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:21,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:21,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:21,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:21,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:46:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 1270 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 00:46:21,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-14 00:46:21,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:46:21,984 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-14 00:46:21,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136192432] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:46:21,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:46:21,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 16 [2022-07-14 00:46:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258408175] [2022-07-14 00:46:21,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:46:21,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 00:46:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:21,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 00:46:21,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:46:21,988 INFO L87 Difference]: Start difference. First operand 3071 states and 4054 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 12 states have internal predecessors, (129), 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) [2022-07-14 00:46:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:25,100 INFO L93 Difference]: Finished difference Result 7490 states and 10201 transitions. [2022-07-14 00:46:25,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 00:46:25,101 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 12 states have internal predecessors, (129), 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 177 [2022-07-14 00:46:25,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:25,138 INFO L225 Difference]: With dead ends: 7490 [2022-07-14 00:46:25,138 INFO L226 Difference]: Without dead ends: 4429 [2022-07-14 00:46:25,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2022-07-14 00:46:25,154 INFO L413 NwaCegarLoop]: 551 mSDtfsCounter, 385 mSDsluCounter, 4466 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:25,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 5017 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 00:46:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4429 states. [2022-07-14 00:46:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4429 to 3081. [2022-07-14 00:46:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 2367 states have (on average 1.2589776087874947) internal successors, (2980), 2402 states have internal predecessors, (2980), 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) [2022-07-14 00:46:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4064 transitions. [2022-07-14 00:46:25,337 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4064 transitions. Word has length 177 [2022-07-14 00:46:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:25,337 INFO L495 AbstractCegarLoop]: Abstraction has 3081 states and 4064 transitions. [2022-07-14 00:46:25,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 12 states have internal predecessors, (129), 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) [2022-07-14 00:46:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4064 transitions. [2022-07-14 00:46:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-14 00:46:25,346 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:25,346 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:25,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:25,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-07-14 00:46:25,572 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:25,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1819792238, now seen corresponding path program 2 times [2022-07-14 00:46:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:25,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486228224] [2022-07-14 00:46:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:25,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 00:46:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 00:46:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:46:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:46:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 00:46:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 00:46:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:46:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:46:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 00:46:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-14 00:46:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-14 00:46:25,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:25,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486228224] [2022-07-14 00:46:25,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486228224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:25,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108231520] [2022-07-14 00:46:25,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:46:25,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:25,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:25,991 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:25,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 00:46:26,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:46:26,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:46:26,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 00:46:26,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-14 00:46:26,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:46:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-14 00:46:26,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108231520] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:46:26,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:46:26,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2022-07-14 00:46:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693078751] [2022-07-14 00:46:26,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:46:26,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 00:46:26,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:26,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 00:46:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-14 00:46:26,900 INFO L87 Difference]: Start difference. First operand 3081 states and 4064 transitions. Second operand has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 13 states have internal predecessors, (132), 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) [2022-07-14 00:46:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:29,433 INFO L93 Difference]: Finished difference Result 7497 states and 10207 transitions. [2022-07-14 00:46:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 00:46:29,434 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 13 states have internal predecessors, (132), 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 181 [2022-07-14 00:46:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:29,463 INFO L225 Difference]: With dead ends: 7497 [2022-07-14 00:46:29,464 INFO L226 Difference]: Without dead ends: 4433 [2022-07-14 00:46:29,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2022-07-14 00:46:29,479 INFO L413 NwaCegarLoop]: 552 mSDtfsCounter, 654 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:29,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 3230 Invalid, 2077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-14 00:46:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2022-07-14 00:46:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 3085. [2022-07-14 00:46:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3085 states, 2371 states have (on average 1.258540700126529) internal successors, (2984), 2406 states have internal predecessors, (2984), 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) [2022-07-14 00:46:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3085 states to 3085 states and 4068 transitions. [2022-07-14 00:46:29,655 INFO L78 Accepts]: Start accepts. Automaton has 3085 states and 4068 transitions. Word has length 181 [2022-07-14 00:46:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:29,656 INFO L495 AbstractCegarLoop]: Abstraction has 3085 states and 4068 transitions. [2022-07-14 00:46:29,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.764705882352941) internal successors, (132), 13 states have internal predecessors, (132), 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) [2022-07-14 00:46:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3085 states and 4068 transitions. [2022-07-14 00:46:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-14 00:46:29,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:29,668 INFO L195 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:29,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:29,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:29,878 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:29,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1633431598, now seen corresponding path program 3 times [2022-07-14 00:46:29,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:29,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397396003] [2022-07-14 00:46:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-14 00:46:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 00:46:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 00:46:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 00:46:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-14 00:46:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-14 00:46:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 00:46:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 00:46:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 00:46:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:46:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-14 00:46:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:30,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397396003] [2022-07-14 00:46:30,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397396003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394582701] [2022-07-14 00:46:30,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 00:46:30,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:30,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:30,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:30,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 00:46:32,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-14 00:46:32,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:46:32,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 00:46:32,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 75 proven. 21 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-14 00:46:33,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:46:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-14 00:46:33,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394582701] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:46:33,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:46:33,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 29 [2022-07-14 00:46:33,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038393136] [2022-07-14 00:46:33,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:46:33,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 00:46:33,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:33,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 00:46:33,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=652, Unknown=0, NotChecked=0, Total=812 [2022-07-14 00:46:33,475 INFO L87 Difference]: Start difference. First operand 3085 states and 4068 transitions. Second operand has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 25 states have internal predecessors, (144), 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) [2022-07-14 00:46:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:37,480 INFO L93 Difference]: Finished difference Result 7507 states and 10218 transitions. [2022-07-14 00:46:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 00:46:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 25 states have internal predecessors, (144), 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 185 [2022-07-14 00:46:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:37,542 INFO L225 Difference]: With dead ends: 7507 [2022-07-14 00:46:37,542 INFO L226 Difference]: Without dead ends: 4443 [2022-07-14 00:46:37,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=467, Invalid=1789, Unknown=0, NotChecked=0, Total=2256 [2022-07-14 00:46:37,555 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 490 mSDsluCounter, 5419 mSDsCounter, 0 mSdLazyCounter, 3238 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 3580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 3238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:37,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 5972 Invalid, 3580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 3238 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-14 00:46:37,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4443 states. [2022-07-14 00:46:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4443 to 3089. [2022-07-14 00:46:37,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 2375 states have (on average 1.2585263157894737) internal successors, (2989), 2410 states have internal predecessors, (2989), 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) [2022-07-14 00:46:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 4073 transitions. [2022-07-14 00:46:37,719 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 4073 transitions. Word has length 185 [2022-07-14 00:46:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:37,719 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 4073 transitions. [2022-07-14 00:46:37,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.9655172413793105) internal successors, (144), 25 states have internal predecessors, (144), 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) [2022-07-14 00:46:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 4073 transitions. [2022-07-14 00:46:37,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-14 00:46:37,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:37,726 INFO L195 NwaCegarLoop]: trace histogram [12, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:37,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:37,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:37,951 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:37,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 45303154, now seen corresponding path program 4 times [2022-07-14 00:46:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:37,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051233930] [2022-07-14 00:46:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:46:38,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 00:46:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:46:38,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 00:46:38,474 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 00:46:38,475 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-14 00:46:38,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 00:46:38,481 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:38,485 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 00:46:38,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,521 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,522 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,526 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,527 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,528 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,529 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:46:38,530 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:46:38,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:46:38 BoogieIcfgContainer [2022-07-14 00:46:38,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 00:46:38,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 00:46:38,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 00:46:38,681 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 00:46:38,682 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:46:08" (3/4) ... [2022-07-14 00:46:38,684 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 00:46:38,684 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 00:46:38,685 INFO L158 Benchmark]: Toolchain (without parser) took 33407.82ms. Allocated memory was 81.8MB in the beginning and 471.9MB in the end (delta: 390.1MB). Free memory was 42.6MB in the beginning and 131.0MB in the end (delta: -88.3MB). Peak memory consumption was 303.6MB. Max. memory is 16.1GB. [2022-07-14 00:46:38,685 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 39.9MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:46:38,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1217.62ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 42.4MB in the beginning and 47.4MB in the end (delta: -5.0MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2022-07-14 00:46:38,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 151.00ms. Allocated memory is still 98.6MB. Free memory was 47.4MB in the beginning and 36.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 00:46:38,686 INFO L158 Benchmark]: Boogie Preprocessor took 162.89ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 36.9MB in the beginning and 79.9MB in the end (delta: -43.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-14 00:46:38,687 INFO L158 Benchmark]: RCFGBuilder took 1539.03ms. Allocated memory is still 127.9MB. Free memory was 79.9MB in the beginning and 48.9MB in the end (delta: 31.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2022-07-14 00:46:38,687 INFO L158 Benchmark]: TraceAbstraction took 30315.94ms. Allocated memory was 127.9MB in the beginning and 471.9MB in the end (delta: 343.9MB). Free memory was 48.2MB in the beginning and 131.0MB in the end (delta: -82.8MB). Peak memory consumption was 261.4MB. Max. memory is 16.1GB. [2022-07-14 00:46:38,687 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 471.9MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:46:38,689 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 81.8MB. Free memory was 39.9MB in the beginning and 39.9MB in the end (delta: 47.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1217.62ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 42.4MB in the beginning and 47.4MB in the end (delta: -5.0MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 151.00ms. Allocated memory is still 98.6MB. Free memory was 47.4MB in the beginning and 36.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 162.89ms. Allocated memory was 98.6MB in the beginning and 127.9MB in the end (delta: 29.4MB). Free memory was 36.9MB in the beginning and 79.9MB in the end (delta: -43.0MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1539.03ms. Allocated memory is still 127.9MB. Free memory was 79.9MB in the beginning and 48.9MB in the end (delta: 31.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * TraceAbstraction took 30315.94ms. Allocated memory was 127.9MB in the beginning and 471.9MB in the end (delta: 343.9MB). Free memory was 48.2MB in the beginning and 131.0MB in the end (delta: -82.8MB). Peak memory consumption was 261.4MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 471.9MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 4030. 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}; [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}; [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; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0: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 [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] CALL, EXPR ldv_init_zalloc(16UL) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={-18446744073709551617:0}, ref_cnt=0, size=16, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=16, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={-18446744073709551617:0}, ref_cnt=0, size=16, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=16, \result={-18446744073709551617:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-18446744073709551617:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={-18446744073709551617:0}, ref_cnt=0, size=16, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4082] RET, EXPR ldv_init_zalloc(16UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(16UL)={-18446744073709551617: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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14: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 [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14: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); VAL [\old(c)=0, \old(n)=8, \result={2016:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, c=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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, n=8, ref_cnt=0, s={2016:0}, s={2016:0}, tmp={2016:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4085] RET ldv_memset((void *)(& ldvarg1), 0, 8UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg1), 0, 8UL)={2016: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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4086] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14: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); VAL [\old(c)=0, \old(n)=4, \result={2015:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, c=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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, n=4, ref_cnt=0, s={2015:0}, s={2015:0}, tmp={2015:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4086] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_memset((void *)(& ldvarg3), 0, 4UL)={2015: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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14: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 [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: [L4125] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4126] COND TRUE ldv_state_variable_0 != 0 [L4127] tmp___2 = __VERIFIER_nondet_int() [L4129] case 0: [L4137] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4138] COND TRUE ldv_state_variable_0 == 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 [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4139] RET, EXPR init() [L4139] ldv_retval_1 = init() [L4140] COND TRUE ldv_retval_1 == 0 [L4141] ldv_state_variable_0 = 3 [L4142] ldv_state_variable_2 = 1 [L4143] CALL ldv_initialize_block_device_operations_2() [L4063] void *tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] CALL, EXPR ldv_init_zalloc(464UL) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={-36893488147419103233:0}, ref_cnt=0, size=464, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=464, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={-36893488147419103233:0}, ref_cnt=0, size=464, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=464, \result={-36893488147419103233:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-36893488147419103233:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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={-36893488147419103233:0}, ref_cnt=0, size=464, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] RET, EXPR ldv_init_zalloc(464UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(464UL)={-36893488147419103233: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={11:0}, virtblk_fops_group0={0:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4065] tmp = ldv_init_zalloc(464UL) [L4066] virtblk_fops_group0 = (struct block_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, 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, tmp={-36893488147419103233:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [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 [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] CALL, EXPR ldv_init_zalloc(1048UL) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3290] void *p ; [L3291] void *tmp ; [L3293] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, size=1048, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3293] tmp = calloc(1UL, size) [L3294] p = tmp VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={-55340232221128654849:0}, ref_cnt=0, size=1048, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3295] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1048, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={-55340232221128654849:0}, ref_cnt=0, size=1048, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L3296] return (p); VAL [\old(size)=1048, \result={-55340232221128654849:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, calloc(1UL, size)={-55340232221128654849:0}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={-55340232221128654849:0}, ref_cnt=0, size=1048, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] RET, EXPR ldv_init_zalloc(1048UL) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1048UL)={-55340232221128654849: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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={0:0}] [L4056] tmp = ldv_init_zalloc(1048UL) [L4057] virtio_blk_group0 = (struct virtio_device *)tmp VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, tmp={-55340232221128654849:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4145] RET ldv_initialize_virtio_driver_1() [L4148] COND FALSE !(ldv_retval_1 != 0) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: [L4125] case 1: [L4163] case 2: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=2, tmp___2=1, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4164] COND TRUE ldv_state_variable_2 != 0 [L4165] tmp___3 = __VERIFIER_nondet_int() [L4167] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=2, tmp___2=1, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4168] COND TRUE ldv_state_variable_2 == 1 [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 [\old(size)=112, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849: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 [\old(size)=112, \result={0:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, size=112, tmp___0=1, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4381] RET, EXPR ldv_malloc(sizeof(struct bio)) VAL [\old(arg2)=20, \old(arg3)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, arg0={4294967298:4294967303}, arg0={4294967298:4294967303}, arg1={2014:0}, arg1={2014:0}, arg2=20, arg3=208, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct bio))={0: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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849: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 [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4216] bool tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={0:0}, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4242] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={0:0}, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] RET, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_is_err(ptr)=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}, ptr={0:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={0:0}, ptr={0:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3734] RET, EXPR IS_ERR((void const *)bio) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bio={0:0}, disk={4294967302:0}, disk={4294967302:0}, features={13:0}, id_str={2014:0}, id_str={2014:0}, id_table={12:0}, index=0, IS_ERR((void const *)bio)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849: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 [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, mask=208, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4312] COND FALSE !(ldv_blk_rq != 0) VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, mask=208, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4316] CALL, EXPR ldv_malloc(sizeof(struct request)) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849: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 [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3264] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3264] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] CALL, EXPR IS_ERR(p) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4216] bool tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4242] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] RET, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_is_err(ptr)=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] RET, EXPR IS_ERR(p) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, IS_ERR(p)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] CALL assume_abort_if_not(IS_ERR(p) == 0) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3249] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, cond=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3265] RET assume_abort_if_not(IS_ERR(p) == 0) VAL [\old(size)=322, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, IS_ERR(p)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3266] return (p); VAL [\old(size)=322, \result={2012:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, p={2012:0}, ref_cnt=0, size=322, tmp={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4316] RET, EXPR ldv_malloc(sizeof(struct request)) VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct request))={2012: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, mask=208, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4316] res = ldv_malloc(sizeof(struct request)) [L4317] COND FALSE !((unsigned long )res == (unsigned long )((struct request *)0)) VAL [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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, mask=208, ref_cnt=0, res={2012:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4321] CALL, EXPR IS_ERR___0((void const *)res) [L4277] long tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4279] CALL, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) VAL [\old(c)=0, \old(exp)=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3333] return (exp); VAL [\old(c)=0, \old(exp)=0, \result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, c=0, exp=0, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4279] RET, EXPR ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L)=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4279] tmp = ldv__builtin_expect((unsigned long )ptr > 0xfffffffffffff000UL, 0L) [L4280] return (tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=0, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [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 [\old(mask)=208, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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, mask=208, ref_cnt=0, res={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4326] return (res); VAL [\old(mask)=208, \result={2012:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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, mask=208, ref_cnt=0, res={2012:0}, tmp___0=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4227] RET, EXPR ldv_blk_make_request(ldv_func_arg3) [L4227] tmp = ldv_blk_make_request(ldv_func_arg3) [L4228] return (tmp); VAL [\old(ldv_func_arg3)=208, \result={2012:0}, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, ldv_func_arg1={4294967298:4294967303}, ldv_func_arg1={4294967298:4294967303}, ldv_func_arg2={0:0}, ldv_func_arg2={0:0}, ldv_func_arg3=208, LDV_IN_INTERRUPT=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, tmp={2012:0}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [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 [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4216] bool tmp ; VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] CALL, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4242] return ((unsigned long )ptr > 2012UL); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] RET, EXPR ldv_is_err(ptr) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=1, ldv_is_err(ptr)=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}, ptr={2012:0}, ref_cnt=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4218] tmp = ldv_is_err(ptr) [L4219] return ((long )tmp); VAL [\result=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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}, ptr={2012:0}, ref_cnt=0, tmp=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3741] RET, EXPR IS_ERR((void const *)req) VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bio={0:0}, disk={4294967302:0}, disk={4294967302:0}, features={13:0}, id_str={2014:0}, id_str={2014:0}, id_table={12:0}, index=0, IS_ERR((void const *)req)=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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}, tmp___0=0, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849: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 [\result=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bio={0:0}, disk={4294967302:0}, disk={4294967302:0}, features={13:0}, id_str={2014:0}, id_str={2014:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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}, tmp___0=0, tmp___2=0, tmp___3=1, vblk={4294967300:-2}, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849: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 [\old(cmd)=1447184708, \old(data)=0, \old(mode)=0, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bdev={-36893488147419103233:0}, bdev={-36893488147419103233:0}, cmd=1447184708, data=0, disk={4294967302:0}, err=1, features={13:0}, id_str={2014:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L3779] return (err); [L3779] return (err); VAL [\old(cmd)=1447184708, \old(data)=0, \old(mode)=0, \result=1, __mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, bdev={-36893488147419103233:0}, bdev={-36893488147419103233:0}, cmd=1447184708, data=0, disk={4294967302:0}, err=1, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4169] RET virtblk_ioctl(virtblk_fops_group0, ldvarg3, ldvarg2, ldvarg1) [L4170] ldv_state_variable_2 = 1 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=2, tmp___2=1, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4093] tmp___0 = __VERIFIER_nondet_int() [L4095] case 0: [L4125] case 1: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=1, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4126] COND TRUE ldv_state_variable_0 != 0 [L4127] tmp___2 = __VERIFIER_nondet_int() [L4129] case 0: VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4130] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [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 [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={-18446744073709551617:0}, ldvarg1={2016:0}, ldvarg2=1447184708, ldvarg3={2015:0}, major=0, ref_cnt=0, tmp={-18446744073709551617:0}, tmp___0=1, tmp___2=0, tmp___3=0, virtblk_fops={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4194] CALL ldv_check_final_state() [L4343] COND TRUE ldv_blk_rq != 0 VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4344] CALL ldv_error() VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] [L4236] reach_error() VAL [__mod_virtio_device_table=0, __mod_virtio_device_table=0, __this_module={4294967297:4294967301}, features={13:0}, id_table={12:0}, index=0, ldv_blk_rq=1, LDV_IN_INTERRUPT=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={11:0}, virtblk_fops_group0={-36893488147419103233:0}, virtio_blk={14:0}, virtio_blk_group0={-55340232221128654849:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 464 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.0s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 18.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7162 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6766 mSDsluCounter, 26745 SdHoareTripleChecker+Invalid, 12.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20971 mSDsCounter, 4298 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12202 IncrementalHoareTripleChecker+Invalid, 16500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4298 mSolverCounterUnsat, 5774 mSDtfsCounter, 12202 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1679 GetRequests, 1521 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3089occurred in iteration=10, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 8796 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2181 NumberOfCodeBlocks, 2181 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2520 ConstructedInterpolants, 0 QuantifiedInterpolants, 3954 SizeOfPredicates, 15 NumberOfNonLiveVariables, 5230 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 1520/1720 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 [2022-07-14 00:46:38,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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.2-?-f4b24e3 [2022-07-14 00:46:40,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:46:40,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:46:40,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:46:40,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:46:40,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:46:40,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:46:40,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:46:40,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:46:40,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:46:40,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:46:40,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:46:40,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:46:40,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:46:40,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:46:40,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:46:40,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:46:40,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:46:40,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:46:40,716 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:46:40,717 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:46:40,720 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:46:40,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:46:40,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:46:40,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:46:40,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:46:40,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:46:40,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:46:40,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:46:40,726 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:46:40,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:46:40,727 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:46:40,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:46:40,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:46:40,729 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:46:40,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:46:40,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:46:40,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:46:40,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:46:40,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:46:40,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:46:40,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:46:40,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-14 00:46:40,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:46:40,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:46:40,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:46:40,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:46:40,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:46:40,788 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:46:40,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:46:40,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:46:40,789 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:46:40,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:46:40,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:46:40,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:46:40,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:46:40,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:46:40,791 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 00:46:40,791 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 00:46:40,792 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 00:46:40,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:46:40,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:46:40,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:46:40,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:46:40,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:46:40,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:46:40,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:46:40,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:46:40,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:46:40,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:46:40,794 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 00:46:40,794 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 00:46:40,794 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:46:40,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:46:40,795 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:46:40,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 00:46:40,795 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 [2022-07-14 00:46:41,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:46:41,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:46:41,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:46:41,135 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:46:41,135 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:46:41,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-39a1d13-1-101_1a-drivers--block--virtio_blk.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:46:41,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f81e345/1dc3fc1e17634cff9f5667b693d656eb/FLAGe7164c50c [2022-07-14 00:46:41,867 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:46:41,868 INFO L160 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 [2022-07-14 00:46:41,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f81e345/1dc3fc1e17634cff9f5667b693d656eb/FLAGe7164c50c [2022-07-14 00:46:42,069 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74f81e345/1dc3fc1e17634cff9f5667b693d656eb [2022-07-14 00:46:42,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:46:42,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:46:42,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:46:42,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:46:42,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:46:42,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:46:42" (1/1) ... [2022-07-14 00:46:42,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a6cd0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:46:42, skipping insertion in model container [2022-07-14 00:46:42,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:46:42" (1/1) ... [2022-07-14 00:46:42,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:46:42,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:46:42,855 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:728) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 00:46:42,861 INFO L158 Benchmark]: Toolchain (without parser) took 786.20ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 24.5MB in the beginning and 33.5MB in the end (delta: -9.1MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-07-14 00:46:42,862 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:46:42,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 783.51ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 24.3MB in the beginning and 33.5MB in the end (delta: -9.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2022-07-14 00:46:42,866 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 52.4MB. Free memory was 34.3MB in the beginning and 34.2MB in the end (delta: 46.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 783.51ms. Allocated memory was 52.4MB in the beginning and 71.3MB in the end (delta: 18.9MB). Free memory was 24.3MB in the beginning and 33.5MB in the end (delta: -9.2MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range