/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 21:09:29,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 21:09:29,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 21:09:30,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 21:09:30,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 21:09:30,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 21:09:30,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 21:09:30,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 21:09:30,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 21:09:30,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 21:09:30,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 21:09:30,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 21:09:30,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 21:09:30,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 21:09:30,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 21:09:30,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 21:09:30,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 21:09:30,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 21:09:30,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 21:09:30,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 21:09:30,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 21:09:30,029 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 21:09:30,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 21:09:30,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 21:09:30,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 21:09:30,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 21:09:30,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 21:09:30,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 21:09:30,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 21:09:30,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 21:09:30,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 21:09:30,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 21:09:30,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 21:09:30,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 21:09:30,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 21:09:30,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 21:09:30,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 21:09:30,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 21:09:30,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 21:09:30,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 21:09:30,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 21:09:30,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-15 21:09:30,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 21:09:30,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 21:09:30,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 21:09:30,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 21:09:30,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 21:09:30,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 21:09:30,090 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 21:09:30,090 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 21:09:30,090 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 21:09:30,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 21:09:30,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 21:09:30,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 21:09:30,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 21:09:30,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 21:09:30,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 21:09:30,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-15 21:09:30,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 21:09:30,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-15 21:09:30,092 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-15 21:09:30,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 21:09:30,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-15 21:09:30,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 21:09:30,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-15 21:09:30,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 21:09:30,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 21:09:30,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 21:09:30,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:09:30,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 21:09:30,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 21:09:30,095 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-15 21:09:30,095 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 21:09:30,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 21:09:30,096 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-15 21:09:30,096 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 [2022-10-15 21:09:30,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 21:09:30,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 21:09:30,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 21:09:30,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 21:09:30,538 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 21:09:30,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-10-15 21:09:30,628 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a661d30/b24d2d6c0a7a44f598121eeb86d0f381/FLAG015e38426 [2022-10-15 21:09:31,706 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 21:09:31,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-10-15 21:09:31,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a661d30/b24d2d6c0a7a44f598121eeb86d0f381/FLAG015e38426 [2022-10-15 21:09:32,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a661d30/b24d2d6c0a7a44f598121eeb86d0f381 [2022-10-15 21:09:32,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 21:09:32,115 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 21:09:32,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 21:09:32,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 21:09:32,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 21:09:32,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:09:32" (1/1) ... [2022-10-15 21:09:32,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d42e232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:32, skipping insertion in model container [2022-10-15 21:09:32,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 09:09:32" (1/1) ... [2022-10-15 21:09:32,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 21:09:32,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 21:09:34,485 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-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-10-15 21:09:34,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:09:34,607 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 21:09:35,232 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-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-10-15 21:09:35,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 21:09:35,429 INFO L208 MainTranslator]: Completed translation [2022-10-15 21:09:35,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35 WrapperNode [2022-10-15 21:09:35,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 21:09:35,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 21:09:35,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 21:09:35,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 21:09:35,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:35,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:35,782 INFO L138 Inliner]: procedures = 236, calls = 1201, calls flagged for inlining = 124, calls inlined = 121, statements flattened = 3795 [2022-10-15 21:09:35,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 21:09:35,784 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 21:09:35,784 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 21:09:35,784 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 21:09:35,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:35,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:35,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:35,827 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:36,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:36,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:36,065 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:36,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:36,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 21:09:36,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 21:09:36,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 21:09:36,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 21:09:36,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (1/1) ... [2022-10-15 21:09:36,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 21:09:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:09:36,203 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-10-15 21:09:36,217 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-10-15 21:09:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2022-10-15 21:09:36,281 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2022-10-15 21:09:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-10-15 21:09:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-10-15 21:09:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure vfs_fsync [2022-10-15 21:09:36,282 INFO L138 BoogieDeclarations]: Found implementation of procedure vfs_fsync [2022-10-15 21:09:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-10-15 21:09:36,282 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-10-15 21:09:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-10-15 21:09:36,282 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-10-15 21:09:36,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-15 21:09:36,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-15 21:09:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure add_disk [2022-10-15 21:09:36,283 INFO L138 BoogieDeclarations]: Found implementation of procedure add_disk [2022-10-15 21:09:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_uevent [2022-10-15 21:09:36,283 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_uevent [2022-10-15 21:09:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-10-15 21:09:36,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-10-15 21:09:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_xor [2022-10-15 21:09:36,284 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_xor [2022-10-15 21:09:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure invalidate_bdev [2022-10-15 21:09:36,285 INFO L138 BoogieDeclarations]: Found implementation of procedure invalidate_bdev [2022-10-15 21:09:36,285 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-10-15 21:09:36,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-10-15 21:09:36,285 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-10-15 21:09:36,285 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-10-15 21:09:36,285 INFO L130 BoogieDeclarations]: Found specification of procedure huge_encode_dev [2022-10-15 21:09:36,286 INFO L138 BoogieDeclarations]: Found implementation of procedure huge_encode_dev [2022-10-15 21:09:36,286 INFO L130 BoogieDeclarations]: Found specification of procedure lo_do_transfer [2022-10-15 21:09:36,286 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_do_transfer [2022-10-15 21:09:36,286 INFO L130 BoogieDeclarations]: Found specification of procedure loop_sysfs_exit [2022-10-15 21:09:36,286 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_sysfs_exit [2022-10-15 21:09:36,287 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-10-15 21:09:36,287 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-10-15 21:09:36,287 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_should_stop [2022-10-15 21:09:36,287 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_should_stop [2022-10-15 21:09:36,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-10-15 21:09:36,288 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-10-15 21:09:36,288 INFO L130 BoogieDeclarations]: Found specification of procedure loop_alloc [2022-10-15 21:09:36,288 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_alloc [2022-10-15 21:09:36,288 INFO L130 BoogieDeclarations]: Found specification of procedure loop_make_request [2022-10-15 21:09:36,288 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_make_request [2022-10-15 21:09:36,288 INFO L130 BoogieDeclarations]: Found specification of procedure __do_lo_send_write [2022-10-15 21:09:36,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_lo_send_write [2022-10-15 21:09:36,289 INFO L130 BoogieDeclarations]: Found specification of procedure loop_get_status [2022-10-15 21:09:36,383 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_get_status [2022-10-15 21:09:36,383 INFO L130 BoogieDeclarations]: Found specification of procedure loop_clr_fd [2022-10-15 21:09:36,383 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_clr_fd [2022-10-15 21:09:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-15 21:09:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure figure_loop_size [2022-10-15 21:09:36,384 INFO L138 BoogieDeclarations]: Found implementation of procedure figure_loop_size [2022-10-15 21:09:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure ioctl_by_bdev [2022-10-15 21:09:36,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ioctl_by_bdev [2022-10-15 21:09:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-15 21:09:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-10-15 21:09:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-10-15 21:09:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-15 21:09:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-15 21:09:36,385 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-10-15 21:09:36,385 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-10-15 21:09:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-10-15 21:09:36,387 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-10-15 21:09:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure fput [2022-10-15 21:09:36,387 INFO L138 BoogieDeclarations]: Found implementation of procedure fput [2022-10-15 21:09:36,387 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-10-15 21:09:36,388 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-10-15 21:09:36,388 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_capacity [2022-10-15 21:09:36,388 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_capacity [2022-10-15 21:09:36,388 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_empty [2022-10-15 21:09:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_empty [2022-10-15 21:09:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-10-15 21:09:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-10-15 21:09:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-10-15 21:09:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure loop_free [2022-10-15 21:09:36,389 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_free [2022-10-15 21:09:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_none [2022-10-15 21:09:36,390 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_none [2022-10-15 21:09:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-15 21:09:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure bd_set_size [2022-10-15 21:09:36,390 INFO L138 BoogieDeclarations]: Found implementation of procedure bd_set_size [2022-10-15 21:09:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-15 21:09:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure fget [2022-10-15 21:09:36,390 INFO L138 BoogieDeclarations]: Found implementation of procedure fget [2022-10-15 21:09:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_set_gfp_mask [2022-10-15 21:09:36,391 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_set_gfp_mask [2022-10-15 21:09:36,391 INFO L130 BoogieDeclarations]: Found specification of procedure xor_init [2022-10-15 21:09:36,391 INFO L138 BoogieDeclarations]: Found implementation of procedure xor_init [2022-10-15 21:09:36,392 INFO L130 BoogieDeclarations]: Found specification of procedure kmap [2022-10-15 21:09:36,392 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap [2022-10-15 21:09:36,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-10-15 21:09:36,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-10-15 21:09:36,392 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-10-15 21:09:36,392 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-10-15 21:09:36,392 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-10-15 21:09:36,393 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-10-15 21:09:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-10-15 21:09:36,393 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-10-15 21:09:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-15 21:09:36,393 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-10-15 21:09:36,393 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-10-15 21:09:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure __kmap_atomic [2022-10-15 21:09:36,394 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmap_atomic [2022-10-15 21:09:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-10-15 21:09:36,394 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-10-15 21:09:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-15 21:09:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-10-15 21:09:36,394 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-10-15 21:09:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 21:09:36,394 INFO L130 BoogieDeclarations]: Found specification of procedure get_loop_size [2022-10-15 21:09:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure get_loop_size [2022-10-15 21:09:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-15 21:09:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-10-15 21:09:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-10-15 21:09:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_status [2022-10-15 21:09:36,395 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_status [2022-10-15 21:09:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-10-15 21:09:36,395 INFO L130 BoogieDeclarations]: Found specification of procedure lo_ioctl [2022-10-15 21:09:36,396 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_ioctl [2022-10-15 21:09:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-10-15 21:09:36,396 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-10-15 21:09:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-10-15 21:09:36,396 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-10-15 21:09:36,396 INFO L130 BoogieDeclarations]: Found specification of procedure loop_release_xfer [2022-10-15 21:09:36,396 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_release_xfer [2022-10-15 21:09:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure _cond_resched [2022-10-15 21:09:36,397 INFO L138 BoogieDeclarations]: Found implementation of procedure _cond_resched [2022-10-15 21:09:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure kunmap [2022-10-15 21:09:36,397 INFO L138 BoogieDeclarations]: Found implementation of procedure kunmap [2022-10-15 21:09:36,397 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-10-15 21:09:36,397 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-10-15 21:09:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure loop_switch [2022-10-15 21:09:36,398 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_switch [2022-10-15 21:09:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_gfp_mask [2022-10-15 21:09:36,398 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_gfp_mask [2022-10-15 21:09:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-10-15 21:09:36,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-10-15 21:09:36,398 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-10-15 21:09:36,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-10-15 21:09:36,399 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2022-10-15 21:09:36,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2022-10-15 21:09:36,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 21:09:36,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 21:09:36,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 21:09:36,399 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-15 21:09:36,399 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-15 21:09:37,246 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 21:09:37,251 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 21:09:38,051 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:09:40,865 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-10-15 21:09:40,866 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-10-15 21:09:40,893 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-10-15 21:09:40,894 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-10-15 21:09:41,658 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-10-15 21:09:41,658 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-10-15 21:09:42,350 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:09:42,353 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-10-15 21:09:46,034 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##72: assume !false; [2022-10-15 21:09:46,034 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume false; [2022-10-15 21:09:46,034 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-10-15 21:09:46,034 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-10-15 21:09:46,131 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 21:09:46,151 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 21:09:46,151 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-10-15 21:09:46,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:09:46 BoogieIcfgContainer [2022-10-15 21:09:46,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 21:09:46,160 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 21:09:46,160 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 21:09:46,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 21:09:46,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 09:09:32" (1/3) ... [2022-10-15 21:09:46,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cccd35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:09:46, skipping insertion in model container [2022-10-15 21:09:46,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 09:09:35" (2/3) ... [2022-10-15 21:09:46,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cccd35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 09:09:46, skipping insertion in model container [2022-10-15 21:09:46,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 09:09:46" (3/3) ... [2022-10-15 21:09:46,169 INFO L112 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-loop.ko.cil.out.i [2022-10-15 21:09:46,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 21:09:46,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-10-15 21:09:46,313 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 21:09:46,324 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=FINITE_AUTOMATA, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@90923d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 21:09:46,324 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-10-15 21:09:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 1247 states, 902 states have (on average 1.3835920177383592) internal successors, (1248), 972 states have internal predecessors, (1248), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) [2022-10-15 21:09:46,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-10-15 21:09:46,345 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:46,346 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-10-15 21:09:46,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:46,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2057545232, now seen corresponding path program 1 times [2022-10-15 21:09:46,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:46,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092897298] [2022-10-15 21:09:46,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:46,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:09:47,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:47,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092897298] [2022-10-15 21:09:47,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092897298] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:47,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:09:47,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:09:47,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512060984] [2022-10-15 21:09:47,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:47,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:09:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:09:47,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:09:47,318 INFO L87 Difference]: Start difference. First operand has 1247 states, 902 states have (on average 1.3835920177383592) internal successors, (1248), 972 states have internal predecessors, (1248), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:09:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:47,677 INFO L93 Difference]: Finished difference Result 2469 states and 3416 transitions. [2022-10-15 21:09:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:09:47,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-10-15 21:09:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:47,713 INFO L225 Difference]: With dead ends: 2469 [2022-10-15 21:09:47,714 INFO L226 Difference]: Without dead ends: 1205 [2022-10-15 21:09:47,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:09:47,747 INFO L413 NwaCegarLoop]: 1641 mSDtfsCounter, 1642 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1642 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:47,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1642 Valid, 1641 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:09:47,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2022-10-15 21:09:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1205. [2022-10-15 21:09:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 874 states have (on average 1.3558352402745995) internal successors, (1185), 937 states have internal predecessors, (1185), 215 states have call successors, (215), 62 states have call predecessors, (215), 62 states have return successors, (215), 214 states have call predecessors, (215), 215 states have call successors, (215) [2022-10-15 21:09:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1615 transitions. [2022-10-15 21:09:48,047 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1615 transitions. Word has length 5 [2022-10-15 21:09:48,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:48,048 INFO L495 AbstractCegarLoop]: Abstraction has 1205 states and 1615 transitions. [2022-10-15 21:09:48,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:09:48,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1615 transitions. [2022-10-15 21:09:48,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-15 21:09:48,050 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:48,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-15 21:09:48,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 21:09:48,052 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash -640597009, now seen corresponding path program 1 times [2022-10-15 21:09:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:48,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269237766] [2022-10-15 21:09:48,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:09:48,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:48,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269237766] [2022-10-15 21:09:48,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269237766] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:48,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:09:48,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:09:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987625033] [2022-10-15 21:09:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:48,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:09:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:09:48,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:09:48,374 INFO L87 Difference]: Start difference. First operand 1205 states and 1615 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:09:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:48,535 INFO L93 Difference]: Finished difference Result 1205 states and 1615 transitions. [2022-10-15 21:09:48,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:09:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-15 21:09:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:48,559 INFO L225 Difference]: With dead ends: 1205 [2022-10-15 21:09:48,560 INFO L226 Difference]: Without dead ends: 1203 [2022-10-15 21:09:48,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:09:48,563 INFO L413 NwaCegarLoop]: 1611 mSDtfsCounter, 1609 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:48,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 1611 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:09:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2022-10-15 21:09:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1203. [2022-10-15 21:09:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 874 states have (on average 1.3535469107551488) internal successors, (1183), 935 states have internal predecessors, (1183), 215 states have call successors, (215), 62 states have call predecessors, (215), 62 states have return successors, (215), 214 states have call predecessors, (215), 215 states have call successors, (215) [2022-10-15 21:09:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1613 transitions. [2022-10-15 21:09:48,695 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1613 transitions. Word has length 6 [2022-10-15 21:09:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:48,696 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1613 transitions. [2022-10-15 21:09:48,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:09:48,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1613 transitions. [2022-10-15 21:09:48,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 21:09:48,697 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:48,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:09:48,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 21:09:48,698 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1252016502, now seen corresponding path program 1 times [2022-10-15 21:09:48,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:48,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651081264] [2022-10-15 21:09:48,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:09:48,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:48,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651081264] [2022-10-15 21:09:48,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651081264] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:48,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:09:48,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 21:09:48,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715758561] [2022-10-15 21:09:48,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:48,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 21:09:48,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 21:09:48,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:09:48,875 INFO L87 Difference]: Start difference. First operand 1203 states and 1613 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:09:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:49,027 INFO L93 Difference]: Finished difference Result 2389 states and 3207 transitions. [2022-10-15 21:09:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 21:09:49,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-15 21:09:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:49,041 INFO L225 Difference]: With dead ends: 2389 [2022-10-15 21:09:49,042 INFO L226 Difference]: Without dead ends: 1193 [2022-10-15 21:09:49,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 21:09:49,057 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 1595 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:49,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 1601 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:09:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2022-10-15 21:09:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2022-10-15 21:09:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 868 states have (on average 1.347926267281106) internal successors, (1170), 925 states have internal predecessors, (1170), 215 states have call successors, (215), 62 states have call predecessors, (215), 62 states have return successors, (215), 214 states have call predecessors, (215), 215 states have call successors, (215) [2022-10-15 21:09:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1600 transitions. [2022-10-15 21:09:49,225 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1600 transitions. Word has length 10 [2022-10-15 21:09:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:49,226 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1600 transitions. [2022-10-15 21:09:49,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-15 21:09:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1600 transitions. [2022-10-15 21:09:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 21:09:49,229 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:49,229 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:09:49,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 21:09:49,230 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __kmap_atomicErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 589865174, now seen corresponding path program 1 times [2022-10-15 21:09:49,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:49,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144173921] [2022-10-15 21:09:49,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:49,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:49,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-15 21:09:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:09:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:49,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144173921] [2022-10-15 21:09:49,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144173921] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:49,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:09:49,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:09:49,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791075610] [2022-10-15 21:09:49,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:49,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:09:49,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:49,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:09:49,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:09:49,443 INFO L87 Difference]: Start difference. First operand 1193 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:09:49,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:49,624 INFO L93 Difference]: Finished difference Result 2293 states and 3092 transitions. [2022-10-15 21:09:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:09:49,625 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-10-15 21:09:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:49,636 INFO L225 Difference]: With dead ends: 2293 [2022-10-15 21:09:49,637 INFO L226 Difference]: Without dead ends: 1193 [2022-10-15 21:09:49,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:09:49,652 INFO L413 NwaCegarLoop]: 1599 mSDtfsCounter, 1 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4790 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:49,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4790 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:09:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2022-10-15 21:09:49,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1193. [2022-10-15 21:09:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 868 states have (on average 1.346774193548387) internal successors, (1169), 925 states have internal predecessors, (1169), 215 states have call successors, (215), 62 states have call predecessors, (215), 62 states have return successors, (215), 214 states have call predecessors, (215), 215 states have call successors, (215) [2022-10-15 21:09:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1599 transitions. [2022-10-15 21:09:49,754 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1599 transitions. Word has length 23 [2022-10-15 21:09:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:49,754 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1599 transitions. [2022-10-15 21:09:49,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:09:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1599 transitions. [2022-10-15 21:09:49,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-10-15 21:09:49,760 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:49,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-10-15 21:09:49,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-15 21:09:49,761 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __kmap_atomicErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:49,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash -597023331, now seen corresponding path program 1 times [2022-10-15 21:09:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:49,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424352713] [2022-10-15 21:09:49,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-10-15 21:09:50,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:09:50,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:50,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424352713] [2022-10-15 21:09:50,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424352713] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:50,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:09:50,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:09:50,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144359583] [2022-10-15 21:09:50,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:50,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:09:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:09:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:09:50,076 INFO L87 Difference]: Start difference. First operand 1193 states and 1599 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:09:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:50,253 INFO L93 Difference]: Finished difference Result 2293 states and 3091 transitions. [2022-10-15 21:09:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:09:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-10-15 21:09:50,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:50,265 INFO L225 Difference]: With dead ends: 2293 [2022-10-15 21:09:50,265 INFO L226 Difference]: Without dead ends: 1176 [2022-10-15 21:09:50,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-15 21:09:50,273 INFO L413 NwaCegarLoop]: 1598 mSDtfsCounter, 1 mSDsluCounter, 3190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4788 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:50,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4788 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 21:09:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2022-10-15 21:09:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1176. [2022-10-15 21:09:50,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 857 states have (on average 1.3477246207701283) internal successors, (1155), 914 states have internal predecessors, (1155), 211 states have call successors, (211), 60 states have call predecessors, (211), 60 states have return successors, (211), 210 states have call predecessors, (211), 211 states have call successors, (211) [2022-10-15 21:09:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1577 transitions. [2022-10-15 21:09:50,369 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1577 transitions. Word has length 30 [2022-10-15 21:09:50,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:50,370 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1577 transitions. [2022-10-15 21:09:50,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:09:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1577 transitions. [2022-10-15 21:09:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-10-15 21:09:50,377 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:50,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:09:50,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-15 21:09:50,378 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting loop_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:50,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:50,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1691423574, now seen corresponding path program 1 times [2022-10-15 21:09:50,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:50,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801395324] [2022-10-15 21:09:50,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:50,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:51,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-15 21:09:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:51,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-10-15 21:09:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 21:09:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:51,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801395324] [2022-10-15 21:09:51,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801395324] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 21:09:51,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404003097] [2022-10-15 21:09:51,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:51,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 21:09:51,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 21:09:51,395 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-10-15 21:09:51,416 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-10-15 21:09:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:51,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 37 conjunts are in the unsatisfiable core [2022-10-15 21:09:51,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 21:09:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:09:52,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-15 21:09:52,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404003097] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:52,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-15 21:09:52,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2022-10-15 21:09:52,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334610605] [2022-10-15 21:09:52,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:52,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-15 21:09:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:52,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-15 21:09:52,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:09:52,088 INFO L87 Difference]: Start difference. First operand 1176 states and 1577 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:09:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:52,537 INFO L93 Difference]: Finished difference Result 2350 states and 3160 transitions. [2022-10-15 21:09:52,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 21:09:52,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2022-10-15 21:09:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:52,555 INFO L225 Difference]: With dead ends: 2350 [2022-10-15 21:09:52,556 INFO L226 Difference]: Without dead ends: 1186 [2022-10-15 21:09:52,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-10-15 21:09:52,570 INFO L413 NwaCegarLoop]: 1572 mSDtfsCounter, 18 mSDsluCounter, 9413 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10985 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:52,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10985 Invalid, 53 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:09:52,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-10-15 21:09:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1183. [2022-10-15 21:09:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 863 states have (on average 1.3453070683661645) internal successors, (1161), 920 states have internal predecessors, (1161), 211 states have call successors, (211), 60 states have call predecessors, (211), 61 states have return successors, (218), 211 states have call predecessors, (218), 211 states have call successors, (218) [2022-10-15 21:09:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1590 transitions. [2022-10-15 21:09:52,748 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1590 transitions. Word has length 34 [2022-10-15 21:09:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:52,749 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1590 transitions. [2022-10-15 21:09:52,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-10-15 21:09:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1590 transitions. [2022-10-15 21:09:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-10-15 21:09:52,754 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:52,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-15 21:09:52,811 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-10-15 21:09:52,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-15 21:09:52,969 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __kmap_atomicErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:52,969 INFO L85 PathProgramCache]: Analyzing trace with hash 54147076, now seen corresponding path program 1 times [2022-10-15 21:09:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:52,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592716152] [2022-10-15 21:09:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:53,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-15 21:09:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 21:09:53,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:53,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592716152] [2022-10-15 21:09:53,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592716152] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:53,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:09:53,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-15 21:09:53,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68001170] [2022-10-15 21:09:53,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:53,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-15 21:09:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:53,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-15 21:09:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:09:53,293 INFO L87 Difference]: Start difference. First operand 1183 states and 1590 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:09:53,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:53,585 INFO L93 Difference]: Finished difference Result 2304 states and 3110 transitions. [2022-10-15 21:09:53,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-15 21:09:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-10-15 21:09:53,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:53,597 INFO L225 Difference]: With dead ends: 2304 [2022-10-15 21:09:53,598 INFO L226 Difference]: Without dead ends: 1190 [2022-10-15 21:09:53,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-10-15 21:09:53,606 INFO L413 NwaCegarLoop]: 1575 mSDtfsCounter, 172 mSDsluCounter, 2899 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 4474 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:53,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 4474 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 21:09:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2022-10-15 21:09:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2022-10-15 21:09:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 868 states have (on average 1.3433179723502304) internal successors, (1166), 925 states have internal predecessors, (1166), 213 states have call successors, (213), 60 states have call predecessors, (213), 61 states have return successors, (220), 213 states have call predecessors, (220), 213 states have call successors, (220) [2022-10-15 21:09:53,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1599 transitions. [2022-10-15 21:09:53,696 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1599 transitions. Word has length 35 [2022-10-15 21:09:53,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:53,696 INFO L495 AbstractCegarLoop]: Abstraction has 1190 states and 1599 transitions. [2022-10-15 21:09:53,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 21:09:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1599 transitions. [2022-10-15 21:09:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-10-15 21:09:53,698 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:53,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:09:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-15 21:09:53,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting loop_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1237207571, now seen corresponding path program 1 times [2022-10-15 21:09:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:53,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914959749] [2022-10-15 21:09:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:53,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:54,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-10-15 21:09:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:54,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 21:09:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:54,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-15 21:09:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 21:09:54,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-15 21:09:54,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 21:09:54,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914959749] [2022-10-15 21:09:54,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914959749] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 21:09:54,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 21:09:54,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-15 21:09:54,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582367453] [2022-10-15 21:09:54,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 21:09:54,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-15 21:09:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 21:09:54,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-15 21:09:54,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-15 21:09:54,640 INFO L87 Difference]: Start difference. First operand 1190 states and 1599 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:09:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 21:09:58,708 INFO L93 Difference]: Finished difference Result 2601 states and 3534 transitions. [2022-10-15 21:09:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 21:09:58,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2022-10-15 21:09:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 21:09:58,723 INFO L225 Difference]: With dead ends: 2601 [2022-10-15 21:09:58,723 INFO L226 Difference]: Without dead ends: 1425 [2022-10-15 21:09:58,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-10-15 21:09:58,733 INFO L413 NwaCegarLoop]: 1514 mSDtfsCounter, 598 mSDsluCounter, 5124 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 6638 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-10-15 21:09:58,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 6638 Invalid, 2715 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [263 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-10-15 21:09:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2022-10-15 21:09:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1193. [2022-10-15 21:09:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 871 states have (on average 1.3421354764638347) internal successors, (1169), 927 states have internal predecessors, (1169), 213 states have call successors, (213), 60 states have call predecessors, (213), 61 states have return successors, (220), 214 states have call predecessors, (220), 213 states have call successors, (220) [2022-10-15 21:09:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1602 transitions. [2022-10-15 21:09:58,833 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1602 transitions. Word has length 41 [2022-10-15 21:09:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 21:09:58,834 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1602 transitions. [2022-10-15 21:09:58,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-15 21:09:58,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1602 transitions. [2022-10-15 21:09:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-10-15 21:09:58,836 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 21:09:58,836 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-15 21:09:58,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-15 21:09:58,837 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting loop_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2022-10-15 21:09:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 21:09:58,838 INFO L85 PathProgramCache]: Analyzing trace with hash 921464730, now seen corresponding path program 1 times [2022-10-15 21:09:58,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 21:09:58,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596453572] [2022-10-15 21:09:58,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 21:09:58,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 21:09:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:09:58,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 21:09:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 21:09:59,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 21:09:59,184 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 21:09:59,186 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location loop_allocErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 58 remaining) [2022-10-15 21:09:59,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location get_loop_sizeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 58 remaining) [2022-10-15 21:09:59,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location get_loop_sizeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 58 remaining) [2022-10-15 21:09:59,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_set_statusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 58 remaining) [2022-10-15 21:09:59,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_set_statusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 58 remaining) [2022-10-15 21:09:59,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lo_ioctlErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 58 remaining) [2022-10-15 21:09:59,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lo_ioctlErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 58 remaining) [2022-10-15 21:09:59,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lo_ioctlErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 58 remaining) [2022-10-15 21:09:59,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lo_ioctlErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 58 remaining) [2022-10-15 21:09:59,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 58 remaining) [2022-10-15 21:09:59,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 58 remaining) [2022-10-15 21:09:59,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 58 remaining) [2022-10-15 21:09:59,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 58 remaining) [2022-10-15 21:09:59,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 58 remaining) [2022-10-15 21:09:59,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 58 remaining) [2022-10-15 21:09:59,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 58 remaining) [2022-10-15 21:09:59,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 58 remaining) [2022-10-15 21:09:59,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 58 remaining) [2022-10-15 21:09:59,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 58 remaining) [2022-10-15 21:09:59,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 58 remaining) [2022-10-15 21:09:59,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 58 remaining) [2022-10-15 21:09:59,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 58 remaining) [2022-10-15 21:09:59,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_release_xferErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 58 remaining) [2022-10-15 21:09:59,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lowmem_page_addressErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 58 remaining) [2022-10-15 21:09:59,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lowmem_page_addressErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 58 remaining) [2022-10-15 21:09:59,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lowmem_page_addressErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 58 remaining) [2022-10-15 21:09:59,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location lowmem_page_addressErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 58 remaining) [2022-10-15 21:09:59,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_module_putErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 58 remaining) [2022-10-15 21:09:59,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_module_putErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 58 remaining) [2022-10-15 21:09:59,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location transfer_xorErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 58 remaining) [2022-10-15 21:09:59,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location transfer_xorErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 58 remaining) [2022-10-15 21:09:59,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~X~$Pointer$~TO~intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 58 remaining) [2022-10-15 21:09:59,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~X~$Pointer$~TO~intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 58 remaining) [2022-10-15 21:09:59,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kmap_atomicErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 58 remaining) [2022-10-15 21:09:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kmap_atomicErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 58 remaining) [2022-10-15 21:09:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kunmap_atomicErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 58 remaining) [2022-10-15 21:09:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __kunmap_atomicErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 58 remaining) [2022-10-15 21:09:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_set_capacityErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 58 remaining) [2022-10-15 21:09:59,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_set_capacityErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 58 remaining) [2022-10-15 21:09:59,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_allocErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 58 remaining) [2022-10-15 21:09:59,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_allocErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 58 remaining) [2022-10-15 21:09:59,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location loop_allocErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 58 remaining) [2022-10-15 21:09:59,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 58 remaining) [2022-10-15 21:09:59,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 58 remaining) [2022-10-15 21:09:59,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 58 remaining) [2022-10-15 21:09:59,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 58 remaining) [2022-10-15 21:09:59,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 58 remaining) [2022-10-15 21:09:59,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 58 remaining) [2022-10-15 21:09:59,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 58 remaining) [2022-10-15 21:09:59,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 58 remaining) [2022-10-15 21:09:59,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 58 remaining) [2022-10-15 21:09:59,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 58 remaining) [2022-10-15 21:09:59,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 58 remaining) [2022-10-15 21:09:59,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 58 remaining) [2022-10-15 21:09:59,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 58 remaining) [2022-10-15 21:09:59,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 58 remaining) [2022-10-15 21:09:59,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 58 remaining) [2022-10-15 21:09:59,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 58 remaining) [2022-10-15 21:09:59,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 21:09:59,212 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 21:09:59,217 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 21:09:59,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 09:09:59 BoogieIcfgContainer [2022-10-15 21:09:59,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 21:09:59,403 INFO L158 Benchmark]: Toolchain (without parser) took 27293.14ms. Allocated memory was 161.5MB in the beginning and 637.5MB in the end (delta: 476.1MB). Free memory was 128.5MB in the beginning and 351.3MB in the end (delta: -222.8MB). Peak memory consumption was 254.8MB. Max. memory is 8.0GB. [2022-10-15 21:09:59,404 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 161.5MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 21:09:59,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 3311.52ms. Allocated memory was 161.5MB in the beginning and 208.7MB in the end (delta: 47.2MB). Free memory was 128.3MB in the beginning and 141.0MB in the end (delta: -12.8MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2022-10-15 21:09:59,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 351.76ms. Allocated memory is still 208.7MB. Free memory was 140.5MB in the beginning and 117.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-10-15 21:09:59,406 INFO L158 Benchmark]: Boogie Preprocessor took 364.96ms. Allocated memory is still 208.7MB. Free memory was 117.4MB in the beginning and 137.9MB in the end (delta: -20.4MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. [2022-10-15 21:09:59,406 INFO L158 Benchmark]: RCFGBuilder took 10007.10ms. Allocated memory was 208.7MB in the beginning and 392.2MB in the end (delta: 183.5MB). Free memory was 137.9MB in the beginning and 249.4MB in the end (delta: -111.5MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. [2022-10-15 21:09:59,407 INFO L158 Benchmark]: TraceAbstraction took 13242.68ms. Allocated memory was 392.2MB in the beginning and 637.5MB in the end (delta: 245.4MB). Free memory was 248.3MB in the beginning and 351.3MB in the end (delta: -102.9MB). Peak memory consumption was 142.4MB. Max. memory is 8.0GB. [2022-10-15 21:09:59,411 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.25ms. Allocated memory is still 161.5MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 3311.52ms. Allocated memory was 161.5MB in the beginning and 208.7MB in the end (delta: 47.2MB). Free memory was 128.3MB in the beginning and 141.0MB in the end (delta: -12.8MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 351.76ms. Allocated memory is still 208.7MB. Free memory was 140.5MB in the beginning and 117.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 364.96ms. Allocated memory is still 208.7MB. Free memory was 117.4MB in the beginning and 137.9MB in the end (delta: -20.4MB). Peak memory consumption was 16.3MB. Max. memory is 8.0GB. * RCFGBuilder took 10007.10ms. Allocated memory was 208.7MB in the beginning and 392.2MB in the end (delta: 183.5MB). Free memory was 137.9MB in the beginning and 249.4MB in the end (delta: -111.5MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13242.68ms. Allocated memory was 392.2MB in the beginning and 637.5MB in the end (delta: 245.4MB). Free memory was 248.3MB in the beginning and 351.3MB in the end (delta: -102.9MB). Peak memory consumption was 142.4MB. Max. memory is 8.0GB. * 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: 6738]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of large string literal at line 4162, overapproximation of shiftLeft at line 6738, overapproximation of bitwiseOr at line 3928. Possible FailurePath: [L4158] static struct list_head loop_devices = {& loop_devices, & loop_devices}; [L4159-L4167] static struct mutex loop_devices_mutex = {{1}, {{{{0U}, 3735899821U, 4294967295U, (void *)0x0fffffffffffffffUL, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, "loop_devices_mutex.wait_lock", 0, 0UL}}}}, {& loop_devices_mutex.wait_list, & loop_devices_mutex.wait_list}, (struct task_struct *)0, (char const *)0, (void *)(& loop_devices_mutex), {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, "loop_devices_mutex", 0, 0UL}}; [L4168] static int max_part ; [L4169] static int part_shift ; [L4279-L4281] static struct loop_func_table none_funcs = {0, & transfer_none, (int (*)(struct loop_device * , struct loop_info64 const * ))0, (int (*)(struct loop_device * ))0, (int (*)(struct loop_device * , int , unsigned long ))0, (struct module *)0}; [L4282-L4285] static struct loop_func_table xor_funcs = {1, & transfer_xor, & xor_init, (int (*)(struct loop_device * ))0, (int (*)(struct loop_device * , int , unsigned long ))0, (struct module *)0}; [L4286] static struct loop_func_table *xfer_funcs[20U] = { & none_funcs, & xor_funcs}; [L5306-L5310] static struct device_attribute loop_attr_backing_file = {{"backing_file", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, & loop_attr_do_show_backing_file, (ssize_t (*)(struct device * , struct device_attribute * , char const * , size_t ))0}; [L5321-L5324] static struct device_attribute loop_attr_offset = {{"offset", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, & loop_attr_do_show_offset, (ssize_t (*)(struct device * , struct device_attribute * , char const * , size_t ))0}; [L5335-L5338] static struct device_attribute loop_attr_sizelimit = {{"sizelimit", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, & loop_attr_do_show_sizelimit, (ssize_t (*)(struct device * , struct device_attribute * , char const * , size_t ))0}; [L5349-L5352] static struct device_attribute loop_attr_autoclear = {{"autoclear", 292U, (struct lock_class_key *)0, {{{(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}, {(char)0}}}}, & loop_attr_do_show_autoclear, (ssize_t (*)(struct device * , struct device_attribute * , char const * , size_t ))0}; [L5353-L5354] static struct attribute *loop_attrs[5U] = { & loop_attr_backing_file.attr, & loop_attr_offset.attr, & loop_attr_sizelimit.attr, & loop_attr_autoclear.attr, (struct attribute *)0}; [L5355] static struct attribute_group loop_attribute_group = {"loop", (mode_t (*)(struct kobject * , struct attribute * , int ))0, (struct attribute **)(& loop_attrs)}; [L6640-L6647] static struct block_device_operations const lo_fops = {& lo_open, & lo_release, & lo_ioctl, & lo_compat_ioctl, (int (*)(struct block_device * , sector_t , void ** , unsigned long * ))0, (unsigned int (*)(struct gendisk * , unsigned int ))0, (int (*)(struct gendisk * ))0, (void (*)(struct gendisk * ))0, (int (*)(struct gendisk * ))0, (int (*)(struct block_device * , struct hd_geometry * ))0, (void (*)(struct block_device * , unsigned long ))0, & __this_module}; [L6648] static int max_loop ; [L7017] int LDV_IN_INTERRUPT ; [L7179] int ldv_module_refcounter = 1; VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=0, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7019] struct loop_device *var_group1 ; [L7020] int var_transfer_none_0_p1 ; [L7021] struct page *var_transfer_none_0_p2 ; [L7022] unsigned int var_transfer_none_0_p3 ; [L7023] struct page *var_transfer_none_0_p4 ; [L7024] unsigned int var_transfer_none_0_p5 ; [L7025] int var_transfer_none_0_p6 ; [L7026] sector_t var_transfer_none_0_p7 ; [L7027] int var_transfer_xor_1_p1 ; [L7028] struct page *var_transfer_xor_1_p2 ; [L7029] unsigned int var_transfer_xor_1_p3 ; [L7030] struct page *var_transfer_xor_1_p4 ; [L7031] unsigned int var_transfer_xor_1_p5 ; [L7032] int var_transfer_xor_1_p6 ; [L7033] sector_t var_transfer_xor_1_p7 ; [L7034] struct loop_info64 const *var_xor_init_2_p1 ; [L7035] struct block_device *var_group2 ; [L7036] fmode_t var_lo_open_51_p1 ; [L7037] int res_lo_open_51 ; [L7038] struct gendisk *var_group3 ; [L7039] fmode_t var_lo_release_52_p1 ; [L7040] fmode_t var_lo_ioctl_45_p1 ; [L7041] unsigned int var_lo_ioctl_45_p2 ; [L7042] unsigned long var_lo_ioctl_45_p3 ; [L7043] fmode_t var_lo_compat_ioctl_50_p1 ; [L7044] unsigned int var_lo_compat_ioctl_50_p2 ; [L7045] unsigned long var_lo_compat_ioctl_50_p3 ; [L7046] int ldv_s_lo_fops_block_device_operations ; [L7047] int tmp ; [L7048] int tmp___0 ; [L7049] int tmp___1 ; [L7052] ldv_s_lo_fops_block_device_operations = 0 [L7053] LDV_IN_INTERRUPT = 1 [L7054] FCALL ldv_initialize() [L7055] CALL loop_init() [L6859] int i ; [L6860] int nr ; [L6861] unsigned long range ; [L6862] struct loop_device *lo ; [L6863] struct loop_device *next ; [L6864] int tmp ; [L6865] struct list_head const *__mptr ; [L6866] struct list_head const *__mptr___0 ; [L6867] struct list_head const *__mptr___1 ; [L6868] struct list_head const *__mptr___2 ; [L6869] struct list_head const *__mptr___3 ; [L6871] part_shift = 0 VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6872] COND FALSE !(max_part > 0) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6879] COND FALSE !(1UL << part_shift > 256UL) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6883] EXPR 20 - part_shift VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6883] COND FALSE !((unsigned long )max_loop > 1UL << (20 - part_shift)) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6887] COND FALSE !(max_loop != 0) [L6891] nr = 8 [L6892] range = 1048576UL VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, nr=8, part_shift=0, range=1048576, xfer_funcs={38:0}, xor_funcs={37:0}] [L6895] CALL, EXPR register_blkdev(7U, "loop") [L7496] return __VERIFIER_nondet_int(); [L6895] RET, EXPR register_blkdev(7U, "loop") [L6895] tmp = register_blkdev(7U, "loop") [L6897] COND FALSE !(tmp != 0) [L6901] i = 0 VAL [__this_module={4294967299:4294967298}, i=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, nr=8, part_shift=0, range=1048576, tmp=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6916] COND TRUE i < nr VAL [__this_module={4294967299:4294967298}, i=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, nr=8, part_shift=0, range=1048576, tmp=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6905] CALL loop_alloc(i) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L6714] struct loop_device *lo ; [L6715] struct gendisk *disk ; [L6716] void *tmp ; [L6717] struct gendisk *tmp___0 ; [L6718] struct lock_class_key __key ; [L6719] struct lock_class_key __key___0 ; [L6720] struct lock_class_key __key___1 ; [L6723] CALL, EXPR kzalloc(672UL, 208U) [L3925] void *tmp ; [L3928] CALL, EXPR kmalloc(size, flags | 32768U) [L3915] void *tmp___2 ; [L3918] CALL, EXPR __kmalloc(size, flags) [L7326] CALL, EXPR ldv_malloc(arg0) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7320] COND FALSE !(__VERIFIER_nondet_bool()) [L7321] void *p = malloc(size); [L7322] CALL, EXPR IS_ERR(p) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, ptr={-4294967297:0}, xfer_funcs={38:0}, xor_funcs={37:0}] [L3705] long tmp ; [L3708] tmp = __builtin_expect((long )((unsigned long )ptr > 0x0ffffffffffff000UL), 0L) [L3710] return (tmp); VAL [\result=0, __this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, ptr={-4294967297:0}, ptr={-4294967297:0}, tmp=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7322] RET, EXPR IS_ERR(p) VAL [\old(size)=672, __this_module={4294967299:4294967298}, IS_ERR(p)=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, p={-4294967297:0}, part_shift=0, size=672, xfer_funcs={38:0}, xor_funcs={37:0}] [L7322] CALL assume_abort_if_not(IS_ERR(p) == 0) [L7316] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={4294967299:4294967298}, cond=1, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7322] RET assume_abort_if_not(IS_ERR(p) == 0) [L7323] return p; VAL [\old(size)=672, \result={-4294967297:0}, __this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, p={-4294967297:0}, part_shift=0, size=672, xfer_funcs={38:0}, xor_funcs={37:0}] [L7326] RET, EXPR ldv_malloc(arg0) VAL [\old(arg0)=672, \old(arg1)=1, __this_module={4294967299:4294967298}, arg0=672, arg1=1, LDV_IN_INTERRUPT=1, ldv_malloc(arg0)={-4294967297:0}, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7326] return ldv_malloc(arg0); [L3918] RET, EXPR __kmalloc(size, flags) [L3918] tmp___2 = __kmalloc(size, flags) [L3920] return (tmp___2); VAL [\old(flags)=1, \old(size)=672, \result={-4294967297:0}, __this_module={4294967299:4294967298}, flags=1, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, size=672, tmp___2={-4294967297:0}, xfer_funcs={38:0}, xor_funcs={37:0}] [L3928] RET, EXPR kmalloc(size, flags | 32768U) [L3928] tmp = kmalloc(size, flags | 32768U) [L3930] return (tmp); VAL [\old(flags)=208, \old(size)=672, \result={-4294967297:0}, __this_module={4294967299:4294967298}, flags=208, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, size=672, tmp={-4294967297:0}, xfer_funcs={38:0}, xor_funcs={37:0}] [L6723] RET, EXPR kzalloc(672UL, 208U) [L6723] tmp = kzalloc(672UL, 208U) [L6724] lo = (struct loop_device *)tmp VAL [\old(i)=0, __key={46:0}, __key___0={51:0}, __key___1={50:0}, __this_module={4294967299:4294967298}, i=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo={-4294967297:0}, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, tmp={-4294967297:0}, xfer_funcs={38:0}, xor_funcs={37:0}] [L6726] COND FALSE !((unsigned long )lo == (unsigned long )((struct loop_device *)0)) [L6731] CALL, EXPR blk_alloc_queue(208U) [L7387] CALL, EXPR ldv_malloc(sizeof(struct request_queue)) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7320] COND FALSE !(__VERIFIER_nondet_bool()) [L7321] void *p = malloc(size); [L7322] CALL, EXPR IS_ERR(p) VAL [__this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, ptr={-4294967295:0}, xfer_funcs={38:0}, xor_funcs={37:0}] [L3705] long tmp ; [L3708] tmp = __builtin_expect((long )((unsigned long )ptr > 0x0ffffffffffff000UL), 0L) [L3710] return (tmp); VAL [\result=0, __this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, ptr={-4294967295:0}, ptr={-4294967295:0}, tmp=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7322] RET, EXPR IS_ERR(p) VAL [\old(size)=1563, __this_module={4294967299:4294967298}, IS_ERR(p)=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, p={-4294967295:0}, part_shift=0, size=1563, xfer_funcs={38:0}, xor_funcs={37:0}] [L7322] CALL assume_abort_if_not(IS_ERR(p) == 0) [L7316] COND FALSE !(!cond) VAL [\old(cond)=1, __this_module={4294967299:4294967298}, cond=1, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7322] RET assume_abort_if_not(IS_ERR(p) == 0) [L7323] return p; VAL [\old(size)=1563, \result={-4294967295:0}, __this_module={4294967299:4294967298}, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, p={-4294967295:0}, part_shift=0, size=1563, xfer_funcs={38:0}, xor_funcs={37:0}] [L7387] RET, EXPR ldv_malloc(sizeof(struct request_queue)) VAL [\old(arg0)=208, __this_module={4294967299:4294967298}, arg0=208, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct request_queue))={-4294967295:0}, ldv_module_refcounter=1, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, xfer_funcs={38:0}, xor_funcs={37:0}] [L7387] return ldv_malloc(sizeof(struct request_queue)); [L6731] RET, EXPR blk_alloc_queue(208U) [L6731] lo->lo_queue = blk_alloc_queue(208U) [L6733] EXPR lo->lo_queue VAL [\old(i)=0, __key={46:0}, __key___0={51:0}, __key___1={50:0}, __this_module={4294967299:4294967298}, i=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo={-4294967297:0}, lo->lo_queue={-4294967295:0}, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, tmp={-4294967297:0}, xfer_funcs={38:0}, xor_funcs={37:0}] [L6733] COND FALSE !((unsigned long )lo->lo_queue == (unsigned long )((struct request_queue *)0)) [L6738] 1 << part_shift VAL [\old(i)=0, __key={46:0}, __key___0={51:0}, __key___1={50:0}, __this_module={4294967299:4294967298}, i=0, LDV_IN_INTERRUPT=1, ldv_module_refcounter=1, lo={-4294967297:0}, lo_fops={45:0}, loop_attr_autoclear={42:0}, loop_attr_backing_file={39:0}, loop_attr_offset={40:0}, loop_attr_sizelimit={41:0}, loop_attribute_group={44:0}, loop_attrs={43:0}, loop_devices={34:0}, loop_devices_mutex={35:0}, max_loop=0, max_part=0, none_funcs={36:0}, part_shift=0, tmp={-4294967297:0}, xfer_funcs={38:0}, xor_funcs={37:0}] - UnprovableResult [Line: 4295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4295]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7198]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7184]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7184]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5505]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5505]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4716]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4716]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4716]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4716]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4430]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4430]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4579]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4579]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4581]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4694]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4694]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3960]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3960]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3960]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3960]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7218]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7218]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4247]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4247]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5253]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 5253]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4026]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4026]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4038]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 4038]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6192]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6738]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6754]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3650]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 3650]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6883]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6883]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6889]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6889]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6913]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6913]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6600]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6600]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 7118]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6613]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6613]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6983]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 6983]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 65 procedures, 1247 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5764 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5636 mSDsluCounter, 36528 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23817 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2580 IncrementalHoareTripleChecker+Invalid, 2854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 12711 mSDtfsCounter, 2580 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1247occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 235 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 439 SizeOfPredicates, 14 NumberOfNonLiveVariables, 938 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 10/12 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-10-15 21:09:59,463 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...