./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 23:43:23,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 23:43:23,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 23:43:23,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 23:43:23,621 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 23:43:23,622 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 23:43:23,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 23:43:23,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 23:43:23,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 23:43:23,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 23:43:23,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 23:43:23,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 23:43:23,627 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 23:43:23,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 23:43:23,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 23:43:23,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 23:43:23,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 23:43:23,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 23:43:23,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 23:43:23,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 23:43:23,633 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 23:43:23,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 23:43:23,635 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 23:43:23,636 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 23:43:23,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 23:43:23,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 23:43:23,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 23:43:23,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 23:43:23,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 23:43:23,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 23:43:23,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 23:43:23,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 23:43:23,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 23:43:23,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 23:43:23,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 23:43:23,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 23:43:23,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 23:43:23,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 23:43:23,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 23:43:23,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 23:43:23,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 23:43:23,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 23:43:23,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 23:43:23,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 23:43:23,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 23:43:23,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 23:43:23,665 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 23:43:23,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 23:43:23,666 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 23:43:23,666 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 23:43:23,666 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 23:43:23,666 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 23:43:23,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 23:43:23,667 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 23:43:23,667 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 23:43:23,667 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 23:43:23,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 23:43:23,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 23:43:23,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 23:43:23,668 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 23:43:23,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 23:43:23,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 23:43:23,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 23:43:23,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 23:43:23,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:43:23,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 23:43:23,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 23:43:23,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 23:43:23,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 23:43:23,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 23:43:23,670 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 23:43:23,670 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 23:43:23,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 23:43:23,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 [2022-07-22 23:43:23,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 23:43:23,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 23:43:23,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 23:43:23,837 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 23:43:23,838 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 23:43:23,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-22 23:43:23,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d80f9c3f/4ae1a900b04e4f3380022d5e7bdea03f/FLAG2609576ee [2022-07-22 23:43:24,466 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 23:43:24,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-22 23:43:24,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d80f9c3f/4ae1a900b04e4f3380022d5e7bdea03f/FLAG2609576ee [2022-07-22 23:43:24,918 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d80f9c3f/4ae1a900b04e4f3380022d5e7bdea03f [2022-07-22 23:43:24,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 23:43:24,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 23:43:24,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 23:43:24,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 23:43:24,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 23:43:24,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f0b904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:24, skipping insertion in model container [2022-07-22 23:43:24,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:43:24" (1/1) ... [2022-07-22 23:43:24,930 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 23:43:25,023 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:43:25,672 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-22 23:43:26,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:43:26,059 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 23:43:26,181 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-22 23:43:26,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:43:26,389 INFO L208 MainTranslator]: Completed translation [2022-07-22 23:43:26,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26 WrapperNode [2022-07-22 23:43:26,390 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 23:43:26,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 23:43:26,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 23:43:26,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 23:43:26,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,531 INFO L137 Inliner]: procedures = 163, calls = 1186, calls flagged for inlining = 76, calls inlined = 76, statements flattened = 3081 [2022-07-22 23:43:26,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 23:43:26,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 23:43:26,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 23:43:26,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 23:43:26,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 23:43:26,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 23:43:26,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 23:43:26,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 23:43:26,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (1/1) ... [2022-07-22 23:43:26,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:43:26,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:43:26,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 23:43:26,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 23:43:26,848 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-22 23:43:26,848 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-22 23:43:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_unregister_dev [2022-07-22 23:43:26,849 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_unregister_dev [2022-07-22 23:43:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2022-07-22 23:43:26,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2022-07-22 23:43:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_from_linear_data [2022-07-22 23:43:26,849 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_from_linear_data [2022-07-22 23:43:26,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-22 23:43:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2022-07-22 23:43:26,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2022-07-22 23:43:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 23:43:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 23:43:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-22 23:43:26,850 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-22 23:43:26,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-22 23:43:26,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-22 23:43:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 23:43:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-22 23:43:26,851 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-22 23:43:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-22 23:43:26,851 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-22 23:43:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-22 23:43:26,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-22 23:43:26,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 23:43:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 23:43:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_disconnect [2022-07-22 23:43:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_disconnect [2022-07-22 23:43:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-22 23:43:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-22 23:43:26,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 23:43:26,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 23:43:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-22 23:43:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-22 23:43:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-22 23:43:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-22 23:43:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_get_priv [2022-07-22 23:43:26,853 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_get_priv [2022-07-22 23:43:26,853 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_submit_rx_urb [2022-07-22 23:43:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_submit_rx_urb [2022-07-22 23:43:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 23:43:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 23:43:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 23:43:26,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-22 23:43:26,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-22 23:43:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_rx_complete [2022-07-22 23:43:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_rx_complete [2022-07-22 23:43:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-22 23:43:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-22 23:43:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-22 23:43:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-22 23:43:26,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-22 23:43:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-22 23:43:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-22 23:43:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-22 23:43:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-22 23:43:26,857 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-22 23:43:26,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 23:43:26,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 23:43:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 23:43:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-22 23:43:26,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-22 23:43:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-22 23:43:26,858 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-22 23:43:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 23:43:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-22 23:43:26,858 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-22 23:43:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-22 23:43:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-22 23:43:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 23:43:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 23:43:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:43:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:43:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_cmd_event_complete [2022-07-22 23:43:26,859 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_cmd_event_complete [2022-07-22 23:43:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2022-07-22 23:43:26,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2022-07-22 23:43:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 23:43:26,860 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-22 23:43:26,860 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-22 23:43:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-22 23:43:26,861 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-22 23:43:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 23:43:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 23:43:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_10 [2022-07-22 23:43:26,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_10 [2022-07-22 23:43:26,861 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-22 23:43:26,861 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-22 23:43:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-22 23:43:26,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-22 23:43:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 23:43:26,862 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_resume [2022-07-22 23:43:26,862 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_resume [2022-07-22 23:43:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-22 23:43:26,863 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-22 23:43:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-22 23:43:26,863 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-22 23:43:26,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-22 23:43:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u8 [2022-07-22 23:43:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-22 23:43:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-22 23:43:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 23:43:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 23:43:26,865 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_out [2022-07-22 23:43:26,865 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_out [2022-07-22 23:43:27,339 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 23:43:27,342 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 23:43:27,578 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-22 23:43:28,108 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-22 23:43:31,156 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 23:43:31,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 23:43:31,199 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 23:43:31,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:43:31 BoogieIcfgContainer [2022-07-22 23:43:31,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 23:43:31,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 23:43:31,203 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 23:43:31,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 23:43:31,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:43:24" (1/3) ... [2022-07-22 23:43:31,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c59ef8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:43:31, skipping insertion in model container [2022-07-22 23:43:31,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:43:26" (2/3) ... [2022-07-22 23:43:31,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c59ef8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:43:31, skipping insertion in model container [2022-07-22 23:43:31,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:43:31" (3/3) ... [2022-07-22 23:43:31,211 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-22 23:43:31,222 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 23:43:31,223 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 23:43:31,296 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 23:43:31,301 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b020e03, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70c8ae95 [2022-07-22 23:43:31,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 23:43:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) [2022-07-22 23:43:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 23:43:31,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:31,330 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:43:31,331 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash -967497407, now seen corresponding path program 1 times [2022-07-22 23:43:31,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:31,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132700414] [2022-07-22 23:43:31,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:31,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:43:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:31,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:43:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:43:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 23:43:31,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:31,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132700414] [2022-07-22 23:43:31,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132700414] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:31,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:31,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026757126] [2022-07-22 23:43:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:31,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:31,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:31,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:31,819 INFO L87 Difference]: Start difference. First operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 23:43:34,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:36,109 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:39,368 INFO L93 Difference]: Finished difference Result 2754 states and 4123 transitions. [2022-07-22 23:43:39,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:43:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-22 23:43:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:39,401 INFO L225 Difference]: With dead ends: 2754 [2022-07-22 23:43:39,402 INFO L226 Difference]: Without dead ends: 1880 [2022-07-22 23:43:39,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:43:39,413 INFO L413 NwaCegarLoop]: 1330 mSDtfsCounter, 1892 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 1010 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1010 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:39,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 3387 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1010 Valid, 1549 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-07-22 23:43:39,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-07-22 23:43:39,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1612. [2022-07-22 23:43:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1197 states have (on average 1.3751044277360067) internal successors, (1646), 1229 states have internal predecessors, (1646), 332 states have call successors, (332), 83 states have call predecessors, (332), 82 states have return successors, (327), 311 states have call predecessors, (327), 327 states have call successors, (327) [2022-07-22 23:43:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2305 transitions. [2022-07-22 23:43:39,561 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2305 transitions. Word has length 44 [2022-07-22 23:43:39,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:39,562 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 2305 transitions. [2022-07-22 23:43:39,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 23:43:39,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2305 transitions. [2022-07-22 23:43:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-22 23:43:39,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:39,567 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:43:39,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 23:43:39,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1415687837, now seen corresponding path program 1 times [2022-07-22 23:43:39,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:39,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257354820] [2022-07-22 23:43:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:39,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:39,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:39,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:43:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:39,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:43:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:39,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:43:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 23:43:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:43:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 23:43:39,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257354820] [2022-07-22 23:43:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257354820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:39,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:39,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:39,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382332870] [2022-07-22 23:43:39,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:39,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:39,875 INFO L87 Difference]: Start difference. First operand 1612 states and 2305 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:43:42,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:44,051 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:46,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:48,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:43:51,357 INFO L93 Difference]: Finished difference Result 5349 states and 7945 transitions. [2022-07-22 23:43:51,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:43:51,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-07-22 23:43:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:43:51,376 INFO L225 Difference]: With dead ends: 5349 [2022-07-22 23:43:51,377 INFO L226 Difference]: Without dead ends: 3748 [2022-07-22 23:43:51,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:43:51,384 INFO L413 NwaCegarLoop]: 1357 mSDtfsCounter, 1948 mSDsluCounter, 2109 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 1012 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:43:51,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 3466 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 1562 Invalid, 4 Unknown, 0 Unchecked, 11.3s Time] [2022-07-22 23:43:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2022-07-22 23:43:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3286. [2022-07-22 23:43:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 2434 states have (on average 1.3697617091207888) internal successors, (3334), 2504 states have internal predecessors, (3334), 671 states have call successors, (671), 165 states have call predecessors, (671), 180 states have return successors, (762), 642 states have call predecessors, (762), 666 states have call successors, (762) [2022-07-22 23:43:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4767 transitions. [2022-07-22 23:43:51,493 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4767 transitions. Word has length 61 [2022-07-22 23:43:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:43:51,494 INFO L495 AbstractCegarLoop]: Abstraction has 3286 states and 4767 transitions. [2022-07-22 23:43:51,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:43:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4767 transitions. [2022-07-22 23:43:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-22 23:43:51,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:43:51,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:43:51,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 23:43:51,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:43:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:43:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash -937016713, now seen corresponding path program 1 times [2022-07-22 23:43:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:43:51,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388084453] [2022-07-22 23:43:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:43:51,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:43:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:43:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:43:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:43:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:43:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 23:43:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:43:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:43:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 23:43:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:43:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388084453] [2022-07-22 23:43:51,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388084453] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:43:51,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:43:51,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:43:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910844352] [2022-07-22 23:43:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:43:51,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:43:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:43:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:43:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:43:51,873 INFO L87 Difference]: Start difference. First operand 3286 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:43:54,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:56,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:43:59,722 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:01,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:03,408 INFO L93 Difference]: Finished difference Result 10731 states and 16197 transitions. [2022-07-22 23:44:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:44:03,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-07-22 23:44:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:03,509 INFO L225 Difference]: With dead ends: 10731 [2022-07-22 23:44:03,510 INFO L226 Difference]: Without dead ends: 7456 [2022-07-22 23:44:03,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:44:03,522 INFO L413 NwaCegarLoop]: 1298 mSDtfsCounter, 2006 mSDsluCounter, 2017 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 1034 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2146 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:03,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2146 Valid, 3315 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1525 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2022-07-22 23:44:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2022-07-22 23:44:03,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 6627. [2022-07-22 23:44:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 4901 states have (on average 1.3650275453988983) internal successors, (6690), 5047 states have internal predecessors, (6690), 1349 states have call successors, (1349), 329 states have call predecessors, (1349), 376 states have return successors, (1702), 1304 states have call predecessors, (1702), 1344 states have call successors, (1702) [2022-07-22 23:44:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 9741 transitions. [2022-07-22 23:44:03,726 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 9741 transitions. Word has length 62 [2022-07-22 23:44:03,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:03,727 INFO L495 AbstractCegarLoop]: Abstraction has 6627 states and 9741 transitions. [2022-07-22 23:44:03,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:44:03,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 9741 transitions. [2022-07-22 23:44:03,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-22 23:44:03,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:03,729 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:03,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 23:44:03,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:03,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:03,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1016891110, now seen corresponding path program 1 times [2022-07-22 23:44:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:03,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757834696] [2022-07-22 23:44:03,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:03,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:03,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:03,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:03,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 23:44:03,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:03,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:44:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 23:44:03,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:03,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757834696] [2022-07-22 23:44:03,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757834696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:03,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:03,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:44:03,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688840984] [2022-07-22 23:44:03,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:03,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:44:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:44:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:44:03,937 INFO L87 Difference]: Start difference. First operand 6627 states and 9741 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:44:06,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:08,154 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:11,690 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:13,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:15,335 INFO L93 Difference]: Finished difference Result 7454 states and 11168 transitions. [2022-07-22 23:44:15,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 23:44:15,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-07-22 23:44:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:15,371 INFO L225 Difference]: With dead ends: 7454 [2022-07-22 23:44:15,371 INFO L226 Difference]: Without dead ends: 7451 [2022-07-22 23:44:15,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:44:15,377 INFO L413 NwaCegarLoop]: 1302 mSDtfsCounter, 2003 mSDsluCounter, 2020 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 1027 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1027 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:15,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 3322 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1027 Valid, 1522 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2022-07-22 23:44:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2022-07-22 23:44:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 6628. [2022-07-22 23:44:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6628 states, 4902 states have (on average 1.364953080375357) internal successors, (6691), 5048 states have internal predecessors, (6691), 1349 states have call successors, (1349), 329 states have call predecessors, (1349), 376 states have return successors, (1702), 1304 states have call predecessors, (1702), 1344 states have call successors, (1702) [2022-07-22 23:44:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6628 states to 6628 states and 9742 transitions. [2022-07-22 23:44:15,659 INFO L78 Accepts]: Start accepts. Automaton has 6628 states and 9742 transitions. Word has length 63 [2022-07-22 23:44:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:15,661 INFO L495 AbstractCegarLoop]: Abstraction has 6628 states and 9742 transitions. [2022-07-22 23:44:15,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:44:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 6628 states and 9742 transitions. [2022-07-22 23:44:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-22 23:44:15,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:15,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:15,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 23:44:15,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:15,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:15,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1458496346, now seen corresponding path program 1 times [2022-07-22 23:44:15,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:15,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482699570] [2022-07-22 23:44:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:15,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:15,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:15,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:15,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:15,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 23:44:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:44:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 23:44:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:15,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482699570] [2022-07-22 23:44:15,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482699570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:15,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:15,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:44:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406113152] [2022-07-22 23:44:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:15,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:44:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:44:15,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:44:15,839 INFO L87 Difference]: Start difference. First operand 6628 states and 9742 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:44:17,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:20,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:22,093 INFO L93 Difference]: Finished difference Result 7450 states and 11164 transitions. [2022-07-22 23:44:22,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:44:22,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-07-22 23:44:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:22,125 INFO L225 Difference]: With dead ends: 7450 [2022-07-22 23:44:22,126 INFO L226 Difference]: Without dead ends: 7447 [2022-07-22 23:44:22,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:44:22,130 INFO L413 NwaCegarLoop]: 1123 mSDtfsCounter, 1541 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 573 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:22,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 2211 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 796 Invalid, 2 Unknown, 0 Unchecked, 6.1s Time] [2022-07-22 23:44:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7447 states. [2022-07-22 23:44:22,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 6627. [2022-07-22 23:44:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 4902 states have (on average 1.364749082007344) internal successors, (6690), 5047 states have internal predecessors, (6690), 1348 states have call successors, (1348), 329 states have call predecessors, (1348), 376 states have return successors, (1702), 1304 states have call predecessors, (1702), 1344 states have call successors, (1702) [2022-07-22 23:44:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 9740 transitions. [2022-07-22 23:44:22,364 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 9740 transitions. Word has length 64 [2022-07-22 23:44:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:22,364 INFO L495 AbstractCegarLoop]: Abstraction has 6627 states and 9740 transitions. [2022-07-22 23:44:22,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:44:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 9740 transitions. [2022-07-22 23:44:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 23:44:22,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:22,366 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:22,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 23:44:22,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:22,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2031605655, now seen corresponding path program 1 times [2022-07-22 23:44:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:22,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267107486] [2022-07-22 23:44:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 23:44:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:44:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 23:44:22,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:22,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267107486] [2022-07-22 23:44:22,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267107486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:22,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:22,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:44:22,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272195578] [2022-07-22 23:44:22,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:22,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:44:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:22,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:44:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:44:22,535 INFO L87 Difference]: Start difference. First operand 6627 states and 9740 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:44:24,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:26,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:28,733 INFO L93 Difference]: Finished difference Result 7449 states and 11162 transitions. [2022-07-22 23:44:28,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:44:28,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 65 [2022-07-22 23:44:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:28,761 INFO L225 Difference]: With dead ends: 7449 [2022-07-22 23:44:28,762 INFO L226 Difference]: Without dead ends: 7417 [2022-07-22 23:44:28,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:44:28,768 INFO L413 NwaCegarLoop]: 1125 mSDtfsCounter, 1537 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 572 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:28,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 2213 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 796 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-22 23:44:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2022-07-22 23:44:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 6597. [2022-07-22 23:44:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 4875 states have (on average 1.3645128205128205) internal successors, (6652), 5019 states have internal predecessors, (6652), 1345 states have call successors, (1345), 329 states have call predecessors, (1345), 376 states have return successors, (1696), 1302 states have call predecessors, (1696), 1342 states have call successors, (1696) [2022-07-22 23:44:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 9693 transitions. [2022-07-22 23:44:28,971 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 9693 transitions. Word has length 65 [2022-07-22 23:44:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:28,973 INFO L495 AbstractCegarLoop]: Abstraction has 6597 states and 9693 transitions. [2022-07-22 23:44:28,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:44:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 9693 transitions. [2022-07-22 23:44:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-22 23:44:28,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:28,977 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:28,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 23:44:28,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:28,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1428627121, now seen corresponding path program 1 times [2022-07-22 23:44:28,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:28,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562164446] [2022-07-22 23:44:28,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:29,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 23:44:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:44:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 23:44:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 23:44:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 23:44:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:29,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562164446] [2022-07-22 23:44:29,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562164446] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:29,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:29,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:44:29,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010248564] [2022-07-22 23:44:29,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:29,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:44:29,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:29,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:44:29,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:44:29,267 INFO L87 Difference]: Start difference. First operand 6597 states and 9693 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 23:44:31,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:33,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:37,449 INFO L93 Difference]: Finished difference Result 20473 states and 30444 transitions. [2022-07-22 23:44:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 23:44:37,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2022-07-22 23:44:37,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:37,543 INFO L225 Difference]: With dead ends: 20473 [2022-07-22 23:44:37,551 INFO L226 Difference]: Without dead ends: 13887 [2022-07-22 23:44:37,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-22 23:44:37,583 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 2133 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 1596 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2270 SdHoareTripleChecker+Valid, 3905 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1596 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:37,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2270 Valid, 3905 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1596 Valid, 1701 Invalid, 2 Unknown, 0 Unchecked, 7.7s Time] [2022-07-22 23:44:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13887 states. [2022-07-22 23:44:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13887 to 12437. [2022-07-22 23:44:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12437 states, 9104 states have (on average 1.3474297012302285) internal successors, (12267), 9423 states have internal predecessors, (12267), 2516 states have call successors, (2516), 623 states have call predecessors, (2516), 816 states have return successors, (3667), 2490 states have call predecessors, (3667), 2513 states have call successors, (3667) [2022-07-22 23:44:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12437 states to 12437 states and 18450 transitions. [2022-07-22 23:44:38,014 INFO L78 Accepts]: Start accepts. Automaton has 12437 states and 18450 transitions. Word has length 98 [2022-07-22 23:44:38,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:38,014 INFO L495 AbstractCegarLoop]: Abstraction has 12437 states and 18450 transitions. [2022-07-22 23:44:38,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 23:44:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 12437 states and 18450 transitions. [2022-07-22 23:44:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-22 23:44:38,024 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:38,024 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:38,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 23:44:38,024 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:38,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:38,025 INFO L85 PathProgramCache]: Analyzing trace with hash -173781947, now seen corresponding path program 1 times [2022-07-22 23:44:38,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:38,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552669733] [2022-07-22 23:44:38,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:38,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 23:44:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:44:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:44:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:44:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 23:44:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:44:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-22 23:44:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:38,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552669733] [2022-07-22 23:44:38,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552669733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:38,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:38,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 23:44:38,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511552538] [2022-07-22 23:44:38,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:38,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 23:44:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:38,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 23:44:38,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 23:44:38,375 INFO L87 Difference]: Start difference. First operand 12437 states and 18450 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 23:44:40,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:42,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:44,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:48,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:48,770 INFO L93 Difference]: Finished difference Result 26259 states and 39141 transitions. [2022-07-22 23:44:48,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 23:44:48,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 124 [2022-07-22 23:44:48,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:48,820 INFO L225 Difference]: With dead ends: 26259 [2022-07-22 23:44:48,820 INFO L226 Difference]: Without dead ends: 13844 [2022-07-22 23:44:48,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-07-22 23:44:48,857 INFO L413 NwaCegarLoop]: 1145 mSDtfsCounter, 679 mSDsluCounter, 5102 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 697 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 6247 SdHoareTripleChecker+Invalid, 3273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:48,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 6247 Invalid, 3273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 2573 Invalid, 3 Unknown, 0 Unchecked, 9.8s Time] [2022-07-22 23:44:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13844 states. [2022-07-22 23:44:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13844 to 12457. [2022-07-22 23:44:49,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12457 states, 9120 states have (on average 1.3468201754385964) internal successors, (12283), 9435 states have internal predecessors, (12283), 2520 states have call successors, (2520), 623 states have call predecessors, (2520), 816 states have return successors, (3671), 2498 states have call predecessors, (3671), 2517 states have call successors, (3671) [2022-07-22 23:44:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12457 states to 12457 states and 18474 transitions. [2022-07-22 23:44:49,309 INFO L78 Accepts]: Start accepts. Automaton has 12457 states and 18474 transitions. Word has length 124 [2022-07-22 23:44:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:49,309 INFO L495 AbstractCegarLoop]: Abstraction has 12457 states and 18474 transitions. [2022-07-22 23:44:49,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-22 23:44:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12457 states and 18474 transitions. [2022-07-22 23:44:49,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-22 23:44:49,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:49,317 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:49,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 23:44:49,317 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 582365067, now seen corresponding path program 1 times [2022-07-22 23:44:49,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:49,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933726289] [2022-07-22 23:44:49,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:49,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 23:44:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-22 23:44:49,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-22 23:44:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-22 23:44:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-22 23:44:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 23:44:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:49,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933726289] [2022-07-22 23:44:49,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933726289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:49,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:49,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 23:44:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257765332] [2022-07-22 23:44:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:49,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:44:49,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:49,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:44:49,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:44:49,578 INFO L87 Difference]: Start difference. First operand 12457 states and 18474 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 23:44:51,828 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:53,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:44:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:56,724 INFO L93 Difference]: Finished difference Result 26280 states and 39126 transitions. [2022-07-22 23:44:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 23:44:56,725 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2022-07-22 23:44:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:56,779 INFO L225 Difference]: With dead ends: 26280 [2022-07-22 23:44:56,779 INFO L226 Difference]: Without dead ends: 13826 [2022-07-22 23:44:56,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:44:56,807 INFO L413 NwaCegarLoop]: 1131 mSDtfsCounter, 914 mSDsluCounter, 2991 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 956 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 4122 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:56,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 4122 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [956 Valid, 1551 Invalid, 2 Unknown, 0 Unchecked, 6.5s Time] [2022-07-22 23:44:56,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-07-22 23:44:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 12466. [2022-07-22 23:44:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 9129 states have (on average 1.346478256106912) internal successors, (12292), 9444 states have internal predecessors, (12292), 2520 states have call successors, (2520), 623 states have call predecessors, (2520), 816 states have return successors, (3671), 2498 states have call predecessors, (3671), 2517 states have call successors, (3671) [2022-07-22 23:44:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 18483 transitions. [2022-07-22 23:44:57,324 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 18483 transitions. Word has length 130 [2022-07-22 23:44:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:57,325 INFO L495 AbstractCegarLoop]: Abstraction has 12466 states and 18483 transitions. [2022-07-22 23:44:57,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 23:44:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 18483 transitions. [2022-07-22 23:44:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-22 23:44:57,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:57,332 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:57,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 23:44:57,333 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash -413463987, now seen corresponding path program 1 times [2022-07-22 23:44:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:57,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063961511] [2022-07-22 23:44:57,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:57,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 23:44:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 23:44:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 23:44:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:44:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-22 23:44:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:44:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-22 23:44:57,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:57,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063961511] [2022-07-22 23:44:57,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063961511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:44:57,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529390486] [2022-07-22 23:44:57,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:57,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:44:57,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:44:57,668 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:44:57,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 23:44:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:58,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 2200 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-22 23:44:58,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:44:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-22 23:44:58,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:44:58,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529390486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:58,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:44:58,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-22 23:44:58,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377846875] [2022-07-22 23:44:58,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:58,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:44:58,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:44:58,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:44:58,317 INFO L87 Difference]: Start difference. First operand 12466 states and 18483 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 23:44:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:44:58,730 INFO L93 Difference]: Finished difference Result 20320 states and 30035 transitions. [2022-07-22 23:44:58,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:44:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2022-07-22 23:44:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:44:58,765 INFO L225 Difference]: With dead ends: 20320 [2022-07-22 23:44:58,765 INFO L226 Difference]: Without dead ends: 7867 [2022-07-22 23:44:58,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-22 23:44:58,796 INFO L413 NwaCegarLoop]: 1195 mSDtfsCounter, 38 mSDsluCounter, 3576 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4771 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:44:58,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4771 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:44:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2022-07-22 23:44:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 7640. [2022-07-22 23:44:59,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7640 states, 5599 states have (on average 1.342025361671727) internal successors, (7514), 5793 states have internal predecessors, (7514), 1533 states have call successors, (1533), 397 states have call predecessors, (1533), 507 states have return successors, (2172), 1510 states have call predecessors, (2172), 1530 states have call successors, (2172) [2022-07-22 23:44:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 11219 transitions. [2022-07-22 23:44:59,112 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 11219 transitions. Word has length 131 [2022-07-22 23:44:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:44:59,112 INFO L495 AbstractCegarLoop]: Abstraction has 7640 states and 11219 transitions. [2022-07-22 23:44:59,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 23:44:59,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 11219 transitions. [2022-07-22 23:44:59,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-22 23:44:59,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:44:59,121 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:44:59,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 23:44:59,343 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,SelfDestructingSolverStorable9 [2022-07-22 23:44:59,344 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:44:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:44:59,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1984420258, now seen corresponding path program 1 times [2022-07-22 23:44:59,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:44:59,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837365385] [2022-07-22 23:44:59,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:44:59,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:44:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:44:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:44:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:44:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:44:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 23:44:59,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 23:44:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:44:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:44:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 23:44:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-22 23:44:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 23:44:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-22 23:44:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 23:44:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:44:59,529 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-22 23:44:59,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:44:59,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837365385] [2022-07-22 23:44:59,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837365385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:44:59,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:44:59,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 23:44:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514182041] [2022-07-22 23:44:59,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:44:59,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 23:44:59,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:44:59,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 23:44:59,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:44:59,532 INFO L87 Difference]: Start difference. First operand 7640 states and 11219 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 23:45:01,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:03,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:45:10,174 INFO L93 Difference]: Finished difference Result 22089 states and 33842 transitions. [2022-07-22 23:45:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 23:45:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 135 [2022-07-22 23:45:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:45:10,242 INFO L225 Difference]: With dead ends: 22089 [2022-07-22 23:45:10,243 INFO L226 Difference]: Without dead ends: 13885 [2022-07-22 23:45:10,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-07-22 23:45:10,275 INFO L413 NwaCegarLoop]: 1614 mSDtfsCounter, 2469 mSDsluCounter, 3925 mSDsCounter, 0 mSdLazyCounter, 3125 mSolverCounterSat, 1765 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2623 SdHoareTripleChecker+Valid, 5539 SdHoareTripleChecker+Invalid, 4892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1765 IncrementalHoareTripleChecker+Valid, 3125 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-22 23:45:10,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2623 Valid, 5539 Invalid, 4892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1765 Valid, 3125 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2022-07-22 23:45:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13885 states. [2022-07-22 23:45:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13885 to 11472. [2022-07-22 23:45:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 8339 states have (on average 1.337570452092577) internal successors, (11154), 8682 states have internal predecessors, (11154), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2306 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-22 23:45:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17695 transitions. [2022-07-22 23:45:10,785 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17695 transitions. Word has length 135 [2022-07-22 23:45:10,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:10,785 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 17695 transitions. [2022-07-22 23:45:10,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 23:45:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17695 transitions. [2022-07-22 23:45:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 23:45:10,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:10,792 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:45:10,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 23:45:10,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:10,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash 2017702408, now seen corresponding path program 1 times [2022-07-22 23:45:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:10,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684041112] [2022-07-22 23:45:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:10,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:10,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:10,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:45:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:10,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:45:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:10,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:45:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 23:45:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 23:45:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 23:45:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:45:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 23:45:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 23:45:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 23:45:11,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:45:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684041112] [2022-07-22 23:45:11,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684041112] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:45:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338394475] [2022-07-22 23:45:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:45:11,148 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:45:11,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 23:45:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:12,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-22 23:45:12,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:45:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 23:45:12,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:45:12,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338394475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:45:12,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:45:12,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-22 23:45:12,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300256885] [2022-07-22 23:45:12,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:45:12,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:45:12,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:45:12,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:45:12,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-22 23:45:12,116 INFO L87 Difference]: Start difference. First operand 11472 states and 17695 transitions. Second operand has 8 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 23:45:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:45:12,749 INFO L93 Difference]: Finished difference Result 22916 states and 35355 transitions. [2022-07-22 23:45:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 23:45:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 137 [2022-07-22 23:45:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:45:12,800 INFO L225 Difference]: With dead ends: 22916 [2022-07-22 23:45:12,800 INFO L226 Difference]: Without dead ends: 11486 [2022-07-22 23:45:12,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-22 23:45:12,837 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 435 mSDsluCounter, 6601 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 7792 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:45:12,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 7792 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:45:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11486 states. [2022-07-22 23:45:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11486 to 11472. [2022-07-22 23:45:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 8339 states have (on average 1.337090778270776) internal successors, (11150), 8682 states have internal predecessors, (11150), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2306 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-22 23:45:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17691 transitions. [2022-07-22 23:45:13,366 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17691 transitions. Word has length 137 [2022-07-22 23:45:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:13,367 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 17691 transitions. [2022-07-22 23:45:13,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-22 23:45:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17691 transitions. [2022-07-22 23:45:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 23:45:13,372 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:13,373 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:45:13,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 23:45:13,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-22 23:45:13,599 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:13,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:13,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1438231226, now seen corresponding path program 1 times [2022-07-22 23:45:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:13,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608011388] [2022-07-22 23:45:13,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:13,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:45:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:45:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:45:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 23:45:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 23:45:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 23:45:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:45:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 23:45:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 23:45:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:13,926 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 23:45:13,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:45:13,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608011388] [2022-07-22 23:45:13,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608011388] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:45:13,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080662794] [2022-07-22 23:45:13,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:45:13,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:45:13,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 23:45:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:14,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 2278 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-22 23:45:14,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:45:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-22 23:45:14,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:45:14,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080662794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:45:14,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:45:14,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-07-22 23:45:14,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107957816] [2022-07-22 23:45:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:45:14,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:45:14,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:45:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:45:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-22 23:45:14,636 INFO L87 Difference]: Start difference. First operand 11472 states and 17691 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 23:45:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:45:15,254 INFO L93 Difference]: Finished difference Result 22902 states and 35331 transitions. [2022-07-22 23:45:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:45:15,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 137 [2022-07-22 23:45:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:45:15,299 INFO L225 Difference]: With dead ends: 22902 [2022-07-22 23:45:15,300 INFO L226 Difference]: Without dead ends: 11472 [2022-07-22 23:45:15,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-22 23:45:15,334 INFO L413 NwaCegarLoop]: 1189 mSDtfsCounter, 446 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 5392 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:45:15,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 5392 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:45:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2022-07-22 23:45:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11472. [2022-07-22 23:45:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 8339 states have (on average 1.3366111044489748) internal successors, (11146), 8682 states have internal predecessors, (11146), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2306 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-22 23:45:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17687 transitions. [2022-07-22 23:45:15,802 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17687 transitions. Word has length 137 [2022-07-22 23:45:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:15,802 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 17687 transitions. [2022-07-22 23:45:15,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 23:45:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17687 transitions. [2022-07-22 23:45:15,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-22 23:45:15,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:15,808 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:45:15,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-22 23:45:16,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:16,029 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:16,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 162839880, now seen corresponding path program 1 times [2022-07-22 23:45:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:16,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140701436] [2022-07-22 23:45:16,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:45:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:45:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:45:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 23:45:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 23:45:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 23:45:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:45:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 23:45:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 23:45:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:16,312 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-22 23:45:16,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:45:16,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140701436] [2022-07-22 23:45:16,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140701436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:45:16,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587062107] [2022-07-22 23:45:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:16,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:16,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:45:16,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:45:16,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 23:45:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:18,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 2279 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-22 23:45:18,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:45:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-22 23:45:18,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:45:18,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587062107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:45:18,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 23:45:18,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-07-22 23:45:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966329478] [2022-07-22 23:45:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:45:18,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 23:45:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:45:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 23:45:18,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-07-22 23:45:18,326 INFO L87 Difference]: Start difference. First operand 11472 states and 17687 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 23:45:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:45:19,976 INFO L93 Difference]: Finished difference Result 26073 states and 40497 transitions. [2022-07-22 23:45:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-22 23:45:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 137 [2022-07-22 23:45:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:45:20,039 INFO L225 Difference]: With dead ends: 26073 [2022-07-22 23:45:20,040 INFO L226 Difference]: Without dead ends: 14643 [2022-07-22 23:45:20,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-07-22 23:45:20,076 INFO L413 NwaCegarLoop]: 2315 mSDtfsCounter, 2548 mSDsluCounter, 20148 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 22463 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:45:20,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 22463 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 23:45:20,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14643 states. [2022-07-22 23:45:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14643 to 11460. [2022-07-22 23:45:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11460 states, 8327 states have (on average 1.3364957367599375) internal successors, (11129), 8671 states have internal predecessors, (11129), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2305 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-22 23:45:20,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11460 states to 11460 states and 17670 transitions. [2022-07-22 23:45:20,613 INFO L78 Accepts]: Start accepts. Automaton has 11460 states and 17670 transitions. Word has length 137 [2022-07-22 23:45:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:20,613 INFO L495 AbstractCegarLoop]: Abstraction has 11460 states and 17670 transitions. [2022-07-22 23:45:20,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 23:45:20,614 INFO L276 IsEmpty]: Start isEmpty. Operand 11460 states and 17670 transitions. [2022-07-22 23:45:20,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-22 23:45:20,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:20,621 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:45:20,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 23:45:20,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:20,843 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:20,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:20,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1052789049, now seen corresponding path program 1 times [2022-07-22 23:45:20,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:20,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009227296] [2022-07-22 23:45:20,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:20,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:20,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:45:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:20,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:45:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:45:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 23:45:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 23:45:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 23:45:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:45:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 23:45:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 23:45:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-22 23:45:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 23:45:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:21,091 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-22 23:45:21,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:45:21,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009227296] [2022-07-22 23:45:21,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009227296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:45:21,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:45:21,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 23:45:21,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421035750] [2022-07-22 23:45:21,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:45:21,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:45:21,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:45:21,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:45:21,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:45:21,094 INFO L87 Difference]: Start difference. First operand 11460 states and 17670 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 23:45:23,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:25,238 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:28,220 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:30,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:32,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:34,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:45:38,260 INFO L93 Difference]: Finished difference Result 29846 states and 46823 transitions. [2022-07-22 23:45:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 23:45:38,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 158 [2022-07-22 23:45:38,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:45:38,336 INFO L225 Difference]: With dead ends: 29846 [2022-07-22 23:45:38,336 INFO L226 Difference]: Without dead ends: 18428 [2022-07-22 23:45:38,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:45:38,378 INFO L413 NwaCegarLoop]: 1722 mSDtfsCounter, 1770 mSDsluCounter, 5145 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 890 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 6867 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 890 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:45:38,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 6867 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [890 Valid, 2485 Invalid, 6 Unknown, 0 Unchecked, 16.2s Time] [2022-07-22 23:45:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2022-07-22 23:45:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 11476. [2022-07-22 23:45:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11476 states, 8343 states have (on average 1.3358504135203164) internal successors, (11145), 8687 states have internal predecessors, (11145), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2305 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-22 23:45:39,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11476 states to 11476 states and 17686 transitions. [2022-07-22 23:45:39,049 INFO L78 Accepts]: Start accepts. Automaton has 11476 states and 17686 transitions. Word has length 158 [2022-07-22 23:45:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:39,049 INFO L495 AbstractCegarLoop]: Abstraction has 11476 states and 17686 transitions. [2022-07-22 23:45:39,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 23:45:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 11476 states and 17686 transitions. [2022-07-22 23:45:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-22 23:45:39,056 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:39,056 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:45:39,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 23:45:39,056 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1339354368, now seen corresponding path program 1 times [2022-07-22 23:45:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153755948] [2022-07-22 23:45:39,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-22 23:45:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 23:45:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 23:45:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 23:45:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-22 23:45:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 23:45:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-22 23:45:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-22 23:45:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-22 23:45:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 23:45:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-22 23:45:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 23:45:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 23:45:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 23:45:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 23:45:39,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153755948] [2022-07-22 23:45:39,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153755948] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 23:45:39,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520505807] [2022-07-22 23:45:39,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:39,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 23:45:39,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:45:39,404 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 23:45:39,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 23:45:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:45:40,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 23:45:40,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:45:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-22 23:45:40,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:45:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-22 23:45:40,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520505807] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:45:40,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 23:45:40,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2022-07-22 23:45:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683584282] [2022-07-22 23:45:40,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 23:45:40,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-22 23:45:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 23:45:40,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-22 23:45:40,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-22 23:45:40,497 INFO L87 Difference]: Start difference. First operand 11476 states and 17686 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 10 states have internal predecessors, (139), 2 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:45:42,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:44,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:46,899 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 23:45:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:45:51,080 INFO L93 Difference]: Finished difference Result 24491 states and 37816 transitions. [2022-07-22 23:45:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 23:45:51,081 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 10 states have internal predecessors, (139), 2 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 153 [2022-07-22 23:45:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:45:51,135 INFO L225 Difference]: With dead ends: 24491 [2022-07-22 23:45:51,136 INFO L226 Difference]: Without dead ends: 13021 [2022-07-22 23:45:51,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2022-07-22 23:45:51,168 INFO L413 NwaCegarLoop]: 1154 mSDtfsCounter, 928 mSDsluCounter, 4513 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 958 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 5667 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 958 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-22 23:45:51,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 5667 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [958 Valid, 2355 Invalid, 3 Unknown, 0 Unchecked, 9.6s Time] [2022-07-22 23:45:51,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2022-07-22 23:45:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11487. [2022-07-22 23:45:51,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11487 states, 8354 states have (on average 1.3354081876945176) internal successors, (11156), 8698 states have internal predecessors, (11156), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2305 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-22 23:45:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 17697 transitions. [2022-07-22 23:45:51,672 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 17697 transitions. Word has length 153 [2022-07-22 23:45:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:45:51,672 INFO L495 AbstractCegarLoop]: Abstraction has 11487 states and 17697 transitions. [2022-07-22 23:45:51,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 10 states have internal predecessors, (139), 2 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-22 23:45:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 17697 transitions. [2022-07-22 23:45:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-22 23:45:51,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:45:51,679 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:45:51,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 23:45:51,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-22 23:45:51,895 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:45:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:45:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash 436590142, now seen corresponding path program 2 times [2022-07-22 23:45:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 23:45:51,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62292853] [2022-07-22 23:45:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:45:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 23:45:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 23:45:52,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 23:45:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 23:45:52,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 23:45:52,494 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 23:45:52,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 23:45:52,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-22 23:45:52,498 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:45:52,501 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 23:45:52,524 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2022-07-22 23:45:52,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 11:45:52 BoogieIcfgContainer [2022-07-22 23:45:52,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 23:45:52,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 23:45:52,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 23:45:52,670 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 23:45:52,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:43:31" (3/4) ... [2022-07-22 23:45:52,673 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 23:45:52,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 23:45:52,673 INFO L158 Benchmark]: Toolchain (without parser) took 147751.99ms. Allocated memory was 79.7MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 44.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 759.9MB. Max. memory is 16.1GB. [2022-07-22 23:45:52,673 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 23:45:52,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1468.09ms. Allocated memory was 79.7MB in the beginning and 127.9MB in the end (delta: 48.2MB). Free memory was 44.2MB in the beginning and 70.5MB in the end (delta: -26.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2022-07-22 23:45:52,674 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.77ms. Allocated memory is still 127.9MB. Free memory was 70.5MB in the beginning and 53.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-22 23:45:52,677 INFO L158 Benchmark]: Boogie Preprocessor took 207.86ms. Allocated memory was 127.9MB in the beginning and 211.8MB in the end (delta: 83.9MB). Free memory was 53.3MB in the beginning and 137.8MB in the end (delta: -84.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-07-22 23:45:52,679 INFO L158 Benchmark]: RCFGBuilder took 4461.15ms. Allocated memory was 211.8MB in the beginning and 423.6MB in the end (delta: 211.8MB). Free memory was 137.8MB in the beginning and 350.8MB in the end (delta: -213.0MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. [2022-07-22 23:45:52,679 INFO L158 Benchmark]: TraceAbstraction took 141465.91ms. Allocated memory was 423.6MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 350.0MB in the beginning and 1.3GB in the end (delta: -936.9MB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-07-22 23:45:52,679 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 933.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 23:45:52,685 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.16ms. Allocated memory is still 79.7MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1468.09ms. Allocated memory was 79.7MB in the beginning and 127.9MB in the end (delta: 48.2MB). Free memory was 44.2MB in the beginning and 70.5MB in the end (delta: -26.3MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.77ms. Allocated memory is still 127.9MB. Free memory was 70.5MB in the beginning and 53.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 207.86ms. Allocated memory was 127.9MB in the beginning and 211.8MB in the end (delta: 83.9MB). Free memory was 53.3MB in the beginning and 137.8MB in the end (delta: -84.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * RCFGBuilder took 4461.15ms. Allocated memory was 211.8MB in the beginning and 423.6MB in the end (delta: 211.8MB). Free memory was 137.8MB in the beginning and 350.8MB in the end (delta: -213.0MB). Peak memory consumption was 135.4MB. Max. memory is 16.1GB. * TraceAbstraction took 141465.91ms. Allocated memory was 423.6MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 350.0MB in the beginning and 1.3GB in the end (delta: -936.9MB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 933.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7054]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 8527. Possible FailurePath: [L7077] int LDV_IN_INTERRUPT = 1; [L7078] struct usb_interface *mwifiex_usb_driver_group1 ; [L7079] int ldv_state_variable_2 ; [L7080] int ref_cnt ; [L7081] struct mwifiex_adapter *usb_ops_group0 ; [L7082] int ldv_state_variable_1 ; [L7083] int usb_counter ; [L7084] struct sk_buff *usb_ops_group1 ; [L7085] int ldv_state_variable_0 ; [L7166-L7168] static char const usbdriver_name[8U] = { 'u', 's', 'b', '8', '7', '9', '7', '\000'}; [L7170] static struct semaphore add_remove_card_sem ; [L7171] static struct usb_card_rec *usb_card ; [L7172-L7176] static struct usb_device_id mwifiex_usb_table[3U] = { {3U, 4742U, 8259U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {899U, 4742U, 8260U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 255U, 255U, (unsigned char)0, 0UL}}; [L7177] struct usb_device_id const __mod_usb_device_table ; [L8001-L8007] static struct usb_driver mwifiex_usb_driver = {(char const *)(& usbdriver_name), & mwifiex_usb_probe, & mwifiex_usb_disconnect, 0, & mwifiex_usb_suspend, & mwifiex_usb_resume, 0, 0, 0, (struct usb_device_id const *)(& mwifiex_usb_table), {{{{{{0U}}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, (unsigned char)0, 1U, (unsigned char)0, (unsigned char)0}; [L8502-L8506] static struct mwifiex_if_ops usb_ops = {0, 0, 0, 0, & mwifiex_register_dev, & mwifiex_unregister_dev, 0, 0, 0, & mwifiex_usb_host_to_card, & mwifiex_pm_wakeup_card, & mwifiex_pm_wakeup_card_complete, 0, 0, & mwifiex_usb_cmd_event_complete, & mwifiex_usb_cmd_event_complete, & mwifiex_usb_data_complete, 0, & mwifiex_usb_dnld_fw, 0, 0}; [L8586] int ldv_retval_0 ; [L8587] int ldv_retval_4 ; [L8588] int ldv_retval_1 ; [L8592] int ldv_retval_3 ; [L8593] int ldv_retval_2 ; [L8989] int INTERF_STATE = 0; [L8990] int SERIAL_STATE = 0; [L8991] void *usb_intfdata = 0; [L8992] struct urb *usb_urb = 0; [L8993] struct usb_device *usb_dev = 0; [L8994] int dev_counter = 0; [L8995] int completeFnIntCounter = 0; [L8996] int completeFnBulkCounter = 0; [L8997] void (*completeFnInt)(struct urb * ) ; [L8998] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8617] u8 ldvarg1 ; [L8618] u8 tmp ; [L8619] struct mwifiex_tx_param *ldvarg0 ; [L8620] void *tmp___0 ; [L8621] struct mwifiex_fw_image *ldvarg2 ; [L8622] void *tmp___1 ; [L8623] struct usb_device_id *ldvarg4 ; [L8624] void *tmp___2 ; [L8625] pm_message_t ldvarg3 ; [L8626] int tmp___3 ; [L8627] int tmp___4 ; [L8628] int tmp___5 ; [L8629] int tmp___6 ; [L8631] tmp = __VERIFIER_nondet_u8() [L8632] ldvarg1 = tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8633] CALL, EXPR ldv_zalloc(4UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=4, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=4, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8633] RET, EXPR ldv_zalloc(4UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(4UL)={0:0}, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8633] tmp___0 = ldv_zalloc(4UL) [L8634] ldvarg0 = (struct mwifiex_tx_param *)tmp___0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8635] CALL, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=32, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8635] RET, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(32UL)={0:0}, ldvarg0={0:0}, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8635] tmp___1 = ldv_zalloc(32UL) [L8636] ldvarg2 = (struct mwifiex_fw_image *)tmp___1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8637] CALL, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=32, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8637] RET, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(32UL)={0:0}, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8637] tmp___2 = ldv_zalloc(32UL) [L8638] ldvarg4 = (struct usb_device_id *)tmp___2 [L8639] FCALL ldv_initialize() [L8640] FCALL memset((void *)(& ldvarg3), 0, 4UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, memset((void *)(& ldvarg3), 0, 4UL)={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8641] ldv_state_variable_1 = 0 [L8642] ref_cnt = 0 [L8643] ldv_state_variable_0 = 1 [L8644] ldv_state_variable_2 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8646] tmp___3 = __VERIFIER_nondet_int() [L8648] case 0: [L8722] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8723] COND TRUE ldv_state_variable_0 != 0 [L8724] tmp___5 = __VERIFIER_nondet_int() [L8726] case 0: [L8734] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8735] COND TRUE ldv_state_variable_0 == 1 [L8736] CALL, EXPR mwifiex_usb_init_module() [L8509] int ret ; [L8510] struct _ddebug descriptor ; [L8511] long tmp ; [L8512] struct _ddebug descriptor___0 ; [L8513] long tmp___0 ; [L8515] descriptor.modname = "mwifiex_usb" [L8516] descriptor.function = "mwifiex_usb_init_module" [L8517] descriptor.filename = "/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6606/dscv_tempdir/dscv/ri/144_2a/drivers/net/wireless/mwifiex/usb.o.c.prepared" [L8518] descriptor.format = "Marvell USB8797 Driver\n" [L8519] descriptor.lineno = 1030U [L8520] descriptor.flags = 0U [L8521] EXPR descriptor.flags VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor.flags=0, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8521] CALL, EXPR ldv__builtin_expect((long )descriptor.flags & 1L, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7067] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8521] RET, EXPR ldv__builtin_expect((long )descriptor.flags & 1L, 0L) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor.flags=0, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, ldv__builtin_expect((long )descriptor.flags & 1L, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8521] tmp = ldv__builtin_expect((long )descriptor.flags & 1L, 0L) [L8522] COND FALSE !(tmp != 0L) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8526] CALL sema_init(& add_remove_card_sem, 1) [L6892] struct lock_class_key __key ; [L6893] struct semaphore __constr_expr_0 ; [L6895] __constr_expr_0.lock.raw_lock.ldv_2243.head_tail = 0U [L6896] __constr_expr_0.lock.magic = 3735899821U [L6897] __constr_expr_0.lock.owner_cpu = 4294967295U [L6898] __constr_expr_0.lock.owner = (void *)-1 [L6899] __constr_expr_0.lock.dep_map.key = 0 [L6900] __constr_expr_0.lock.dep_map.class_cache[0] = 0 [L6901] __constr_expr_0.lock.dep_map.class_cache[1] = 0 [L6902] __constr_expr_0.lock.dep_map.name = "(*sem).lock" [L6903] __constr_expr_0.lock.dep_map.cpu = 0 [L6904] __constr_expr_0.lock.dep_map.ip = 0UL [L6905] __constr_expr_0.count = (unsigned int )val [L6906] __constr_expr_0.wait_list.next = & sem->wait_list [L6907] __constr_expr_0.wait_list.prev = & sem->wait_list [L6908] *sem = __constr_expr_0 [L6909] FCALL lockdep_init_map(& sem->lock.dep_map, "semaphore->lock", & __key, 0) [L6910] return; [L6910] return; VAL [={0:0}, ={0:0}, \old(val)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, sem={161:0}, sem={161:0}, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, val=1] [L8526] RET sema_init(& add_remove_card_sem, 1) [L8527] CALL, EXPR ldv_usb_register_driver_22(& mwifiex_usb_driver, & __this_module, "mwifiex_usb") [L8961] ldv_func_ret_type ldv_func_res ; [L8962] int tmp ; [L8964] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L9357] return __VERIFIER_nondet_int(); [L8964] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L8964] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L8965] ldv_func_res = tmp [L8966] ldv_state_variable_2 = 1 [L8967] usb_counter = 0 [L8968] CALL ldv_usb_driver_2() [L8596] void *tmp ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8598] CALL, EXPR ldv_zalloc(1520UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=1520, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=1520, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8598] RET, EXPR ldv_zalloc(1520UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ldv_zalloc(1520UL)={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8598] tmp = ldv_zalloc(1520UL) [L8599] mwifiex_usb_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8968] RET ldv_usb_driver_2() [L8969] return (ldv_func_res); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ldv_func_arg1={163:0}, ldv_func_arg1={163:0}, ldv_func_arg2={4294967313:4294967299}, ldv_func_arg2={4294967313:4294967299}, ldv_func_arg3={153:0}, ldv_func_arg3={153:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8527] RET, EXPR ldv_usb_register_driver_22(& mwifiex_usb_driver, & __this_module, "mwifiex_usb") [L8527] ret = ldv_usb_register_driver_22(& mwifiex_usb_driver, & __this_module, "mwifiex_usb") [L8528] COND FALSE !(ret != 0) [L8531] descriptor___0.modname = "mwifiex_usb" [L8532] descriptor___0.function = "mwifiex_usb_init_module" [L8533] descriptor___0.filename = "/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6606/dscv_tempdir/dscv/ri/144_2a/drivers/net/wireless/mwifiex/usb.o.c.prepared" [L8534] descriptor___0.format = "info: Driver registered successfully!\n" [L8535] descriptor___0.lineno = 1038U [L8536] descriptor___0.flags = 0U [L8537] EXPR descriptor___0.flags VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, descriptor___0.flags=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8537] CALL, EXPR ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7067] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8537] RET, EXPR ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, descriptor___0.flags=0, dev_counter=0, INTERF_STATE=0, ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8537] tmp___0 = ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) [L8538] COND FALSE !(tmp___0 != 0L) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8543] return (ret); [L8543] return (ret); [L8543] return (ret); VAL [={0:0}, ={0:0}, \result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8736] RET, EXPR mwifiex_usb_init_module() [L8736] ldv_retval_0 = mwifiex_usb_init_module() [L8737] COND TRUE ldv_retval_0 == 0 [L8738] ldv_state_variable_0 = 3 [L8739] ldv_state_variable_1 = 1 [L8740] CALL ldv_initialize_mwifiex_if_ops_1() [L8605] void *tmp ; [L8606] void *tmp___0 ; VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8608] CALL, EXPR ldv_zalloc(5920UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=5920, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=5920, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8608] RET, EXPR ldv_zalloc(5920UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(5920UL)={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8608] tmp = ldv_zalloc(5920UL) [L8609] usb_ops_group0 = (struct mwifiex_adapter *)tmp VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8610] CALL, EXPR ldv_zalloc(240UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=240, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=240, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8610] RET, EXPR ldv_zalloc(240UL) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(240UL)={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8610] tmp___0 = ldv_zalloc(240UL) [L8611] usb_ops_group1 = (struct sk_buff *)tmp___0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8740] RET ldv_initialize_mwifiex_if_ops_1() [L8743] COND FALSE !(ldv_retval_0 != 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8646] tmp___3 = __VERIFIER_nondet_int() [L8648] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=0, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8649] COND TRUE ldv_state_variable_1 != 0 [L8650] tmp___4 = __VERIFIER_nondet_int() [L8652] case 0: [L8659] case 1: [L8666] case 2: [L8673] case 3: [L8680] case 4: [L8687] case 5: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=0, tmp___4=5, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8688] COND TRUE ldv_state_variable_1 == 1 [L8689] CALL mwifiex_usb_dnld_fw(usb_ops_group0, ldvarg2) [L8435] int ret ; [L8436] struct usb_card_rec *card ; [L8438] EXPR adapter->card [L8438] card = (struct usb_card_rec *)adapter->card [L8439] EXPR card->usb_boot_state VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, card->usb_boot_state=171, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, fw={0:0}, fw={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8439] COND FALSE !((unsigned int )card->usb_boot_state == 1U) [L8451] CALL, EXPR mwifiex_usb_rx_init(adapter) [L8045] struct usb_card_rec *card ; [L8046] int i ; [L8047] int tmp ; [L8048] int tmp___0 ; [L8050] EXPR adapter->card [L8050] card = (struct usb_card_rec *)adapter->card [L8051] card->rx_cmd.adapter = adapter [L8052] EXPR card->rx_cmd_ep [L8052] card->rx_cmd.ep = card->rx_cmd_ep [L8053] CALL, EXPR ldv_usb_alloc_urb_17(0, 208U) [L8936] struct urb *tmp ; VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mem_flags=208, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8938] CALL, EXPR ldv_alloc_urb() VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9021] struct urb *value ; [L9022] void *tmp ; [L9023] int tmp___0 ; VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9025] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7002] void *p ; [L7003] void *tmp ; [L7004] int tmp___0 ; [L7006] tmp___0 = __VERIFIER_nondet_int() [L7007] COND FALSE !(tmp___0 != 0) [L7010] tmp = malloc(size) [L7011] p = tmp VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=184, tmp={-18446744073709551617:0}, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7012] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L6998] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7012] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=184, tmp={-18446744073709551617:0}, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7013] return (p); VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=184, tmp={-18446744073709551617:0}, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9025] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9025] tmp = ldv_malloc(sizeof(struct urb)) [L9026] value = tmp VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9027] CALL, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7036] int tmp ; [L7038] tmp = __VERIFIER_nondet_int() [L7039] return (tmp); VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, \result=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9027] RET, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_undef_int()=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9027] tmp___0 = ldv_undef_int() [L9028] COND TRUE \read(tmp___0) VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9029] COND TRUE (unsigned long )value != (unsigned long )((struct urb *)0) [L9030] usb_urb = value VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9035] return (usb_urb); VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L8938] RET, EXPR ldv_alloc_urb() VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, ldv_alloc_urb()={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mem_flags=208, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8938] tmp = ldv_alloc_urb() [L8939] return (tmp); VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=208, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mem_flags=208, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8053] RET, EXPR ldv_usb_alloc_urb_17(0, 208U) [L8053] card->rx_cmd.urb = ldv_usb_alloc_urb_17(0, 208U) [L8054] EXPR card->rx_cmd.urb VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, card->rx_cmd.urb={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8054] COND FALSE !((unsigned long )card->rx_cmd.urb == (unsigned long )((struct urb *)0)) [L8059] CALL, EXPR dev_alloc_skb(2048U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7104] struct sk_buff *tmp ; [L7106] CALL, EXPR netdev_alloc_skb((struct net_device *)0, length) [L7096] struct sk_buff *tmp ; [L7098] CALL, EXPR __netdev_alloc_skb(dev, length, 32U) [L9240] CALL, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [={0:0}, ={0:0}, \old(size)=253, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7002] void *p ; [L7003] void *tmp ; [L7004] int tmp___0 ; [L7006] tmp___0 = __VERIFIER_nondet_int() [L7007] COND TRUE tmp___0 != 0 [L7008] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=253, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=253, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9240] RET, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [={0:0}, ={0:0}, \old(arg1)=2048, \old(arg2)=32, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, arg0={0:0}, arg0={0:0}, arg1=2048, arg2=32, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct sk_buff))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9240] struct sk_buff *skb = ldv_malloc(sizeof(struct sk_buff)); [L9241] COND FALSE !(\read(*skb)) VAL [={0:0}, ={0:0}, \old(arg1)=2048, \old(arg2)=32, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, arg0={0:0}, arg0={0:0}, arg1=2048, arg2=32, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, skb={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9247] return skb; VAL [={0:0}, ={0:0}, \old(arg1)=2048, \old(arg2)=32, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, arg0={0:0}, arg0={0:0}, arg1=2048, arg2=32, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, skb={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7098] RET, EXPR __netdev_alloc_skb(dev, length, 32U) [L7098] tmp = __netdev_alloc_skb(dev, length, 32U) [L7099] return (tmp); VAL [={0:0}, ={0:0}, \old(length)=2048, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={0:0}, dev={0:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, length=2048, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7106] RET, EXPR netdev_alloc_skb((struct net_device *)0, length) [L7106] tmp = netdev_alloc_skb((struct net_device *)0, length) [L7107] return (tmp); VAL [={0:0}, ={0:0}, \old(length)=2048, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, length=2048, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8059] RET, EXPR dev_alloc_skb(2048U) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_alloc_skb(2048U)={0:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8059] card->rx_cmd.skb = dev_alloc_skb(2048U) [L8060] EXPR card->rx_cmd.skb VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, card->rx_cmd.skb={0:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8060] COND TRUE (unsigned long )card->rx_cmd.skb == (unsigned long )((struct sk_buff *)0) [L8061] adapter->dev [L8062] return (-12); VAL [={0:0}, ={0:0}, \result=-12, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8451] RET, EXPR mwifiex_usb_rx_init(adapter) [L8451] ret = mwifiex_usb_rx_init(adapter) [L8452] COND FALSE !(ret == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, fw={0:0}, fw={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=-12, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8456] return (ret); VAL [={0:0}, ={0:0}, \result=-12, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, fw={0:0}, fw={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=-12, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8689] RET mwifiex_usb_dnld_fw(usb_ops_group0, ldvarg2) [L8690] ldv_state_variable_1 = 1 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=0, tmp___4=5, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8646] tmp___3 = __VERIFIER_nondet_int() [L8648] case 0: [L8722] case 1: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___4=5, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8723] COND TRUE ldv_state_variable_0 != 0 [L8724] tmp___5 = __VERIFIER_nondet_int() [L8726] case 0: VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___4=5, tmp___5=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8727] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L8728] CALL mwifiex_usb_cleanup_module() [L8548] int tmp ; [L8549] struct mwifiex_adapter *adapter ; [L8550] int i ; [L8551] struct mwifiex_private *tmp___0 ; [L8553] CALL, EXPR down_interruptible(& add_remove_card_sem) [L9262] return __VERIFIER_nondet_int(); [L8553] RET, EXPR down_interruptible(& add_remove_card_sem) [L8553] tmp = down_interruptible(& add_remove_card_sem) [L8554] COND FALSE !(tmp == 0) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8558] COND FALSE !((unsigned long )usb_card != (unsigned long )((struct usb_card_rec *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8582] CALL ldv_usb_deregister_23(& mwifiex_usb_driver) [L8975] FCALL usb_deregister(arg) [L8976] ldv_state_variable_2 = 0 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, arg={163:0}, arg={163:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8582] RET ldv_usb_deregister_23(& mwifiex_usb_driver) [L8728] RET mwifiex_usb_cleanup_module() [L8729] ldv_state_variable_0 = 2 VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___4=5, tmp___5=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8830] CALL ldv_check_final_state() [L9208] COND FALSE !((unsigned long )usb_urb == (unsigned long )((struct urb *)0)) VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9210] CALL ldv_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7054] reach_error() VAL [={0:0}, ={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 45 procedures, 857 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 141.2s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 123.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 24886 SdHoareTripleChecker+Valid, 114.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23287 mSDsluCounter, 90679 SdHoareTripleChecker+Invalid, 107.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68969 mSDsCounter, 12302 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22743 IncrementalHoareTripleChecker+Invalid, 35081 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12302 mSolverCounterUnsat, 21710 mSDtfsCounter, 22743 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1318 GetRequests, 1137 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12466occurred in iteration=9, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 22542 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2550 NumberOfCodeBlocks, 2550 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4867 SizeOfPredicates, 41 NumberOfNonLiveVariables, 11427 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 1228/1235 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 23:45:52,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 23:45:54,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 23:45:54,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 23:45:54,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 23:45:54,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 23:45:54,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 23:45:54,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 23:45:54,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 23:45:54,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 23:45:54,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 23:45:54,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 23:45:54,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 23:45:54,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 23:45:54,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 23:45:54,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 23:45:54,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 23:45:54,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 23:45:54,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 23:45:54,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 23:45:54,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 23:45:54,696 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 23:45:54,697 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 23:45:54,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 23:45:54,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 23:45:54,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 23:45:54,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 23:45:54,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 23:45:54,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 23:45:54,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 23:45:54,707 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 23:45:54,708 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 23:45:54,708 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 23:45:54,709 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 23:45:54,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 23:45:54,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 23:45:54,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 23:45:54,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 23:45:54,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 23:45:54,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 23:45:54,712 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 23:45:54,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 23:45:54,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 23:45:54,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-22 23:45:54,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 23:45:54,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 23:45:54,746 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 23:45:54,746 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 23:45:54,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 23:45:54,747 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 23:45:54,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 23:45:54,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 23:45:54,747 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 23:45:54,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 23:45:54,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 23:45:54,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 23:45:54,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 23:45:54,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 23:45:54,749 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 23:45:54,749 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 23:45:54,749 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 23:45:54,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 23:45:54,751 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 23:45:54,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 23:45:54,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 23:45:54,755 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 23:45:54,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 23:45:54,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:45:54,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 23:45:54,756 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 23:45:54,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 23:45:54,757 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 23:45:54,757 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 23:45:54,757 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 23:45:54,757 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 23:45:54,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 23:45:54,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 23:45:54,758 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 [2022-07-22 23:45:55,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 23:45:55,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 23:45:55,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 23:45:55,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 23:45:55,026 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 23:45:55,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-22 23:45:55,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4f4c2b7/f95577d6716e438ba3289a349d0fe283/FLAGe9a3557a7 [2022-07-22 23:45:55,699 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 23:45:55,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-22 23:45:55,738 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4f4c2b7/f95577d6716e438ba3289a349d0fe283/FLAGe9a3557a7 [2022-07-22 23:45:56,109 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e4f4c2b7/f95577d6716e438ba3289a349d0fe283 [2022-07-22 23:45:56,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 23:45:56,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 23:45:56,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 23:45:56,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 23:45:56,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 23:45:56,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:45:56" (1/1) ... [2022-07-22 23:45:56,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9e4da3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:56, skipping insertion in model container [2022-07-22 23:45:56,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:45:56" (1/1) ... [2022-07-22 23:45:56,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 23:45:56,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:45:56,869 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-22 23:45:57,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:45:57,189 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 23:45:57,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 23:45:57,323 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-22 23:45:57,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:45:57,476 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 23:45:57,655 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-22 23:45:57,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 23:45:57,816 INFO L208 MainTranslator]: Completed translation [2022-07-22 23:45:57,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57 WrapperNode [2022-07-22 23:45:57,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 23:45:57,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 23:45:57,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 23:45:57,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 23:45:57,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:57,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:57,950 INFO L137 Inliner]: procedures = 178, calls = 1186, calls flagged for inlining = 76, calls inlined = 76, statements flattened = 2976 [2022-07-22 23:45:57,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 23:45:57,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 23:45:57,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 23:45:57,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 23:45:57,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:57,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:57,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:57,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:58,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:58,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:58,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:58,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 23:45:58,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 23:45:58,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 23:45:58,163 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 23:45:58,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (1/1) ... [2022-07-22 23:45:58,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 23:45:58,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 23:45:58,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 23:45:58,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 23:45:58,247 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-22 23:45:58,247 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-22 23:45:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_unregister_dev [2022-07-22 23:45:58,248 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_unregister_dev [2022-07-22 23:45:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2022-07-22 23:45:58,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2022-07-22 23:45:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-22 23:45:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_from_linear_data [2022-07-22 23:45:58,248 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_from_linear_data [2022-07-22 23:45:58,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2022-07-22 23:45:58,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2022-07-22 23:45:58,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-22 23:45:58,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 23:45:58,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 23:45:58,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-22 23:45:58,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 23:45:58,249 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-22 23:45:58,249 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-22 23:45:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-22 23:45:58,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-22 23:45:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-22 23:45:58,250 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-22 23:45:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-22 23:45:58,250 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-22 23:45:58,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-22 23:45:58,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-22 23:45:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 23:45:58,251 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 23:45:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_disconnect [2022-07-22 23:45:58,251 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_disconnect [2022-07-22 23:45:58,251 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-22 23:45:58,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-22 23:45:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 23:45:58,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 23:45:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-22 23:45:58,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-22 23:45:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-22 23:45:58,252 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-22 23:45:58,252 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_get_priv [2022-07-22 23:45:58,252 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_get_priv [2022-07-22 23:45:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_submit_rx_urb [2022-07-22 23:45:58,253 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_submit_rx_urb [2022-07-22 23:45:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-22 23:45:58,253 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-22 23:45:58,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-22 23:45:58,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-22 23:45:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_rx_complete [2022-07-22 23:45:58,254 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_rx_complete [2022-07-22 23:45:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-22 23:45:58,254 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-22 23:45:58,255 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-22 23:45:58,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-22 23:45:58,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-22 23:45:58,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-22 23:45:58,256 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-22 23:45:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-22 23:45:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-22 23:45:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-22 23:45:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-22 23:45:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-22 23:45:58,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-22 23:45:58,257 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-22 23:45:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-22 23:45:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-22 23:45:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 23:45:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-22 23:45:58,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-22 23:45:58,258 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-22 23:45:58,259 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-22 23:45:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 23:45:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-22 23:45:58,259 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-22 23:45:58,259 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-22 23:45:58,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-22 23:45:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 23:45:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 23:45:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-22 23:45:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-22 23:45:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:45:58,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-22 23:45:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-22 23:45:58,260 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_cmd_event_complete [2022-07-22 23:45:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_cmd_event_complete [2022-07-22 23:45:58,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2022-07-22 23:45:58,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2022-07-22 23:45:58,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 23:45:58,261 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-22 23:45:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-22 23:45:58,262 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-22 23:45:58,262 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-22 23:45:58,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-22 23:45:58,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-22 23:45:58,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-22 23:45:58,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 23:45:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 23:45:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 23:45:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-22 23:45:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 23:45:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-22 23:45:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-22 23:45:58,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_10 [2022-07-22 23:45:58,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_10 [2022-07-22 23:45:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-22 23:45:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-22 23:45:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-22 23:45:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-22 23:45:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-22 23:45:58,265 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_resume [2022-07-22 23:45:58,265 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_resume [2022-07-22 23:45:58,266 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-22 23:45:58,266 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-22 23:45:58,267 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-22 23:45:58,269 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-22 23:45:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u8 [2022-07-22 23:45:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-22 23:45:58,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-22 23:45:58,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 23:45:58,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 23:45:58,270 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_out [2022-07-22 23:45:58,270 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_out [2022-07-22 23:45:58,664 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 23:45:58,665 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 23:45:59,171 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-22 23:46:05,802 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-22 23:46:16,991 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 23:46:17,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 23:46:17,007 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 23:46:17,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:46:17 BoogieIcfgContainer [2022-07-22 23:46:17,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 23:46:17,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 23:46:17,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 23:46:17,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 23:46:17,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:45:56" (1/3) ... [2022-07-22 23:46:17,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45092c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:46:17, skipping insertion in model container [2022-07-22 23:46:17,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:45:57" (2/3) ... [2022-07-22 23:46:17,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45092c6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:46:17, skipping insertion in model container [2022-07-22 23:46:17,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:46:17" (3/3) ... [2022-07-22 23:46:17,017 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-22 23:46:17,027 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 23:46:17,028 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 23:46:17,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 23:46:17,119 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1344ffed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12f21386 [2022-07-22 23:46:17,119 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 23:46:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) [2022-07-22 23:46:17,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-22 23:46:17,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:17,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:17,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash -967497407, now seen corresponding path program 1 times [2022-07-22 23:46:17,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:17,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852402804] [2022-07-22 23:46:17,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:17,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:17,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:17,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 23:46:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:17,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:46:17,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 23:46:17,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:17,841 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:17,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852402804] [2022-07-22 23:46:17,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852402804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:17,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:17,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:46:17,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055684512] [2022-07-22 23:46:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:17,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:46:17,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:46:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:46:17,872 INFO L87 Difference]: Start difference. First operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 23:46:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:18,088 INFO L93 Difference]: Finished difference Result 1708 states and 2504 transitions. [2022-07-22 23:46:18,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 23:46:18,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-22 23:46:18,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:18,104 INFO L225 Difference]: With dead ends: 1708 [2022-07-22 23:46:18,104 INFO L226 Difference]: Without dead ends: 842 [2022-07-22 23:46:18,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:46:18,115 INFO L413 NwaCegarLoop]: 1217 mSDtfsCounter, 2 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:18,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3648 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:46:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-22 23:46:18,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2022-07-22 23:46:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 626 states have (on average 1.3722044728434504) internal successors, (859), 644 states have internal predecessors, (859), 174 states have call successors, (174), 42 states have call predecessors, (174), 41 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2022-07-22 23:46:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1202 transitions. [2022-07-22 23:46:18,180 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1202 transitions. Word has length 44 [2022-07-22 23:46:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:18,181 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1202 transitions. [2022-07-22 23:46:18,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 23:46:18,182 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1202 transitions. [2022-07-22 23:46:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-22 23:46:18,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:18,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:18,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:18,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:18,403 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1457155709, now seen corresponding path program 1 times [2022-07-22 23:46:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:18,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588825569] [2022-07-22 23:46:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:18,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:18,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:18,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:18,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 23:46:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:18,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:46:18,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:19,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 23:46:19,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 23:46:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-22 23:46:19,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:19,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588825569] [2022-07-22 23:46:19,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588825569] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 23:46:19,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 23:46:19,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-22 23:46:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086280925] [2022-07-22 23:46:19,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 23:46:19,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 23:46:19,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:19,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 23:46:19,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 23:46:19,531 INFO L87 Difference]: Start difference. First operand 842 states and 1202 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-22 23:46:20,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:20,207 INFO L93 Difference]: Finished difference Result 1685 states and 2407 transitions. [2022-07-22 23:46:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 23:46:20,208 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-07-22 23:46:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:20,213 INFO L225 Difference]: With dead ends: 1685 [2022-07-22 23:46:20,213 INFO L226 Difference]: Without dead ends: 851 [2022-07-22 23:46:20,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-07-22 23:46:20,216 INFO L413 NwaCegarLoop]: 1199 mSDtfsCounter, 9 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:20,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4791 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 23:46:20,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-07-22 23:46:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-07-22 23:46:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 634 states have (on average 1.3722397476340693) internal successors, (870), 652 states have internal predecessors, (870), 174 states have call successors, (174), 43 states have call predecessors, (174), 42 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2022-07-22 23:46:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1213 transitions. [2022-07-22 23:46:20,242 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1213 transitions. Word has length 45 [2022-07-22 23:46:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:20,242 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1213 transitions. [2022-07-22 23:46:20,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-22 23:46:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1213 transitions. [2022-07-22 23:46:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-22 23:46:20,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:20,245 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:20,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:20,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:20,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:20,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:20,459 INFO L85 PathProgramCache]: Analyzing trace with hash 726542785, now seen corresponding path program 2 times [2022-07-22 23:46:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:20,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102211123] [2022-07-22 23:46:20,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 23:46:20,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:20,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:20,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 23:46:20,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-22 23:46:20,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 23:46:20,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:46:20,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 23:46:20,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:20,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:20,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102211123] [2022-07-22 23:46:20,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102211123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:20,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:20,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:46:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914773150] [2022-07-22 23:46:20,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:20,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:20,980 INFO L87 Difference]: Start difference. First operand 851 states and 1213 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 23:46:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:21,291 INFO L93 Difference]: Finished difference Result 2456 states and 3510 transitions. [2022-07-22 23:46:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-07-22 23:46:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:21,299 INFO L225 Difference]: With dead ends: 2456 [2022-07-22 23:46:21,299 INFO L226 Difference]: Without dead ends: 1624 [2022-07-22 23:46:21,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-07-22 23:46:21,304 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 1122 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:21,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 2553 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:46:21,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-07-22 23:46:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2022-07-22 23:46:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1208 states have (on average 1.3741721854304636) internal successors, (1660), 1240 states have internal predecessors, (1660), 332 states have call successors, (332), 84 states have call predecessors, (332), 83 states have return successors, (327), 311 states have call predecessors, (327), 327 states have call successors, (327) [2022-07-22 23:46:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2319 transitions. [2022-07-22 23:46:21,373 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2319 transitions. Word has length 48 [2022-07-22 23:46:21,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:21,374 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2319 transitions. [2022-07-22 23:46:21,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-22 23:46:21,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2319 transitions. [2022-07-22 23:46:21,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 23:46:21,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:21,379 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:21,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:21,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:21,595 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 11952355, now seen corresponding path program 1 times [2022-07-22 23:46:21,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:21,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214669435] [2022-07-22 23:46:21,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:21,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:21,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:21,598 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:21,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 23:46:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:22,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 23:46:22,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 23:46:22,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:22,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:22,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214669435] [2022-07-22 23:46:22,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214669435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:22,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:22,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:46:22,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744397726] [2022-07-22 23:46:22,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:22,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:46:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:22,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:46:22,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:46:22,719 INFO L87 Difference]: Start difference. First operand 1624 states and 2319 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 23:46:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:24,924 INFO L93 Difference]: Finished difference Result 3576 states and 5163 transitions. [2022-07-22 23:46:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:46:24,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-22 23:46:24,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:24,934 INFO L225 Difference]: With dead ends: 3576 [2022-07-22 23:46:24,935 INFO L226 Difference]: Without dead ends: 1971 [2022-07-22 23:46:24,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:46:24,941 INFO L413 NwaCegarLoop]: 1655 mSDtfsCounter, 451 mSDsluCounter, 6103 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 7758 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:24,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 7758 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-22 23:46:24,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2022-07-22 23:46:24,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1624. [2022-07-22 23:46:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1208 states have (on average 1.3733443708609272) internal successors, (1659), 1240 states have internal predecessors, (1659), 332 states have call successors, (332), 84 states have call predecessors, (332), 83 states have return successors, (327), 311 states have call predecessors, (327), 327 states have call successors, (327) [2022-07-22 23:46:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2318 transitions. [2022-07-22 23:46:24,996 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2318 transitions. Word has length 65 [2022-07-22 23:46:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:24,997 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2318 transitions. [2022-07-22 23:46:24,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 23:46:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2318 transitions. [2022-07-22 23:46:25,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 23:46:25,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:25,000 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:25,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:25,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:25,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:25,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash 230807073, now seen corresponding path program 1 times [2022-07-22 23:46:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:25,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548659975] [2022-07-22 23:46:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:25,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:25,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:25,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:25,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 23:46:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:26,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:46:26,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 23:46:27,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:27,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:27,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548659975] [2022-07-22 23:46:27,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548659975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:27,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:27,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 23:46:27,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413857813] [2022-07-22 23:46:27,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:27,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:27,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:27,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:27,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:27,901 INFO L87 Difference]: Start difference. First operand 1624 states and 2318 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:28,112 INFO L93 Difference]: Finished difference Result 4833 states and 7038 transitions. [2022-07-22 23:46:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:28,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 65 [2022-07-22 23:46:28,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:28,126 INFO L225 Difference]: With dead ends: 4833 [2022-07-22 23:46:28,127 INFO L226 Difference]: Without dead ends: 3228 [2022-07-22 23:46:28,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:28,133 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 1169 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:28,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 2655 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:46:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-07-22 23:46:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 3218. [2022-07-22 23:46:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 2397 states have (on average 1.3725490196078431) internal successors, (3290), 2457 states have internal predecessors, (3290), 655 states have call successors, (655), 166 states have call predecessors, (655), 165 states have return successors, (703), 618 states have call predecessors, (703), 650 states have call successors, (703) [2022-07-22 23:46:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4648 transitions. [2022-07-22 23:46:28,238 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4648 transitions. Word has length 65 [2022-07-22 23:46:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:28,239 INFO L495 AbstractCegarLoop]: Abstraction has 3218 states and 4648 transitions. [2022-07-22 23:46:28,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4648 transitions. [2022-07-22 23:46:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 23:46:28,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:28,242 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:28,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:28,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:28,467 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:28,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:28,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1435282055, now seen corresponding path program 1 times [2022-07-22 23:46:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:28,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464638524] [2022-07-22 23:46:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:28,468 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:28,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:28,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:28,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 23:46:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:29,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:46:29,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 23:46:31,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:31,104 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:31,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464638524] [2022-07-22 23:46:31,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464638524] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:31,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:31,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 23:46:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433761451] [2022-07-22 23:46:31,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:31,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:31,106 INFO L87 Difference]: Start difference. First operand 3218 states and 4648 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:31,519 INFO L93 Difference]: Finished difference Result 9607 states and 14192 transitions. [2022-07-22 23:46:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:31,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 66 [2022-07-22 23:46:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:31,549 INFO L225 Difference]: With dead ends: 9607 [2022-07-22 23:46:31,550 INFO L226 Difference]: Without dead ends: 6408 [2022-07-22 23:46:31,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:31,564 INFO L413 NwaCegarLoop]: 1383 mSDtfsCounter, 1159 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:31,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 2557 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 23:46:31,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6408 states. [2022-07-22 23:46:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6408 to 6399. [2022-07-22 23:46:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 4768 states have (on average 1.36996644295302) internal successors, (6532), 4884 states have internal predecessors, (6532), 1301 states have call successors, (1301), 330 states have call predecessors, (1301), 329 states have return successors, (1513), 1232 states have call predecessors, (1513), 1296 states have call successors, (1513) [2022-07-22 23:46:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 9346 transitions. [2022-07-22 23:46:31,743 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 9346 transitions. Word has length 66 [2022-07-22 23:46:31,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:31,744 INFO L495 AbstractCegarLoop]: Abstraction has 6399 states and 9346 transitions. [2022-07-22 23:46:31,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:31,744 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 9346 transitions. [2022-07-22 23:46:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-22 23:46:31,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:31,746 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:31,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:31,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:31,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:31,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1544432604, now seen corresponding path program 1 times [2022-07-22 23:46:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:31,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094410222] [2022-07-22 23:46:31,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:31,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:31,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:31,970 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:31,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 23:46:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:32,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:46:32,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 23:46:33,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:33,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:33,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094410222] [2022-07-22 23:46:33,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094410222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:33,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:33,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 23:46:33,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819897050] [2022-07-22 23:46:33,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:33,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:33,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:33,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:33,717 INFO L87 Difference]: Start difference. First operand 6399 states and 9346 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:33,907 INFO L93 Difference]: Finished difference Result 6406 states and 9352 transitions. [2022-07-22 23:46:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:33,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 67 [2022-07-22 23:46:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:33,935 INFO L225 Difference]: With dead ends: 6406 [2022-07-22 23:46:33,935 INFO L226 Difference]: Without dead ends: 6403 [2022-07-22 23:46:33,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-07-22 23:46:33,940 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 1156 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:33,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 2558 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:46:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2022-07-22 23:46:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6400. [2022-07-22 23:46:34,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6400 states, 4769 states have (on average 1.3698888655902706) internal successors, (6533), 4885 states have internal predecessors, (6533), 1301 states have call successors, (1301), 330 states have call predecessors, (1301), 329 states have return successors, (1513), 1232 states have call predecessors, (1513), 1296 states have call successors, (1513) [2022-07-22 23:46:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6400 states to 6400 states and 9347 transitions. [2022-07-22 23:46:34,133 INFO L78 Accepts]: Start accepts. Automaton has 6400 states and 9347 transitions. Word has length 67 [2022-07-22 23:46:34,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:34,134 INFO L495 AbstractCegarLoop]: Abstraction has 6400 states and 9347 transitions. [2022-07-22 23:46:34,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 6400 states and 9347 transitions. [2022-07-22 23:46:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-22 23:46:34,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:34,137 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:34,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:34,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:34,363 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash -633127460, now seen corresponding path program 1 times [2022-07-22 23:46:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:34,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415449847] [2022-07-22 23:46:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:34,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:34,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:34,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:34,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-22 23:46:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:35,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:46:35,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 23:46:36,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:36,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:36,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415449847] [2022-07-22 23:46:36,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415449847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:36,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:36,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 23:46:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791144170] [2022-07-22 23:46:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:36,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:36,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:36,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:36,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:36,112 INFO L87 Difference]: Start difference. First operand 6400 states and 9347 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:36,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:36,220 INFO L93 Difference]: Finished difference Result 6402 states and 9348 transitions. [2022-07-22 23:46:36,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:36,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2022-07-22 23:46:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:36,252 INFO L225 Difference]: With dead ends: 6402 [2022-07-22 23:46:36,252 INFO L226 Difference]: Without dead ends: 6399 [2022-07-22 23:46:36,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-07-22 23:46:36,256 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:36,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1197 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 23:46:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2022-07-22 23:46:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 6399. [2022-07-22 23:46:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 4769 states have (on average 1.369679178024743) internal successors, (6532), 4884 states have internal predecessors, (6532), 1300 states have call successors, (1300), 330 states have call predecessors, (1300), 329 states have return successors, (1513), 1232 states have call predecessors, (1513), 1296 states have call successors, (1513) [2022-07-22 23:46:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 9345 transitions. [2022-07-22 23:46:36,430 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 9345 transitions. Word has length 68 [2022-07-22 23:46:36,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:36,431 INFO L495 AbstractCegarLoop]: Abstraction has 6399 states and 9345 transitions. [2022-07-22 23:46:36,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 9345 transitions. [2022-07-22 23:46:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 23:46:36,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:36,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:36,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-22 23:46:36,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:36,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:36,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1847533095, now seen corresponding path program 1 times [2022-07-22 23:46:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:36,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681367008] [2022-07-22 23:46:36,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:36,654 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:36,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-22 23:46:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:37,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:46:37,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-22 23:46:38,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:38,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:38,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681367008] [2022-07-22 23:46:38,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681367008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:38,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:38,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 23:46:38,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11071733] [2022-07-22 23:46:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:38,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:38,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:38,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:38,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:38,467 INFO L87 Difference]: Start difference. First operand 6399 states and 9345 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:38,592 INFO L93 Difference]: Finished difference Result 6401 states and 9346 transitions. [2022-07-22 23:46:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:38,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2022-07-22 23:46:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:38,610 INFO L225 Difference]: With dead ends: 6401 [2022-07-22 23:46:38,610 INFO L226 Difference]: Without dead ends: 6369 [2022-07-22 23:46:38,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-07-22 23:46:38,616 INFO L413 NwaCegarLoop]: 1196 mSDtfsCounter, 1142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:38,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 23:46:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2022-07-22 23:46:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 6369. [2022-07-22 23:46:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6369 states, 4742 states have (on average 1.3694643610291017) internal successors, (6494), 4856 states have internal predecessors, (6494), 1297 states have call successors, (1297), 330 states have call predecessors, (1297), 329 states have return successors, (1508), 1230 states have call predecessors, (1508), 1294 states have call successors, (1508) [2022-07-22 23:46:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 9299 transitions. [2022-07-22 23:46:38,788 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 9299 transitions. Word has length 69 [2022-07-22 23:46:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:38,788 INFO L495 AbstractCegarLoop]: Abstraction has 6369 states and 9299 transitions. [2022-07-22 23:46:38,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-22 23:46:38,789 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 9299 transitions. [2022-07-22 23:46:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-22 23:46:38,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:38,800 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:38,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:39,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:39,028 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:39,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:39,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1553347695, now seen corresponding path program 1 times [2022-07-22 23:46:39,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:39,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562284236] [2022-07-22 23:46:39,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:39,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:39,034 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:39,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 23:46:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:39,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:46:39,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-22 23:46:40,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:40,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:40,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562284236] [2022-07-22 23:46:40,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562284236] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:40,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:40,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:46:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503341414] [2022-07-22 23:46:40,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:40,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:40,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:40,012 INFO L87 Difference]: Start difference. First operand 6369 states and 9299 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 23:46:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:41,067 INFO L93 Difference]: Finished difference Result 17378 states and 25193 transitions. [2022-07-22 23:46:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:41,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2022-07-22 23:46:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:41,107 INFO L225 Difference]: With dead ends: 17378 [2022-07-22 23:46:41,107 INFO L226 Difference]: Without dead ends: 11026 [2022-07-22 23:46:41,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 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-07-22 23:46:41,129 INFO L413 NwaCegarLoop]: 1603 mSDtfsCounter, 872 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:41,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 2752 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 23:46:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11026 states. [2022-07-22 23:46:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11026 to 10995. [2022-07-22 23:46:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10995 states, 8148 states have (on average 1.359720176730486) internal successors, (11079), 8361 states have internal predecessors, (11079), 2224 states have call successors, (2224), 623 states have call predecessors, (2224), 622 states have return successors, (2573), 2098 states have call predecessors, (2573), 2221 states have call successors, (2573) [2022-07-22 23:46:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10995 states to 10995 states and 15876 transitions. [2022-07-22 23:46:41,462 INFO L78 Accepts]: Start accepts. Automaton has 10995 states and 15876 transitions. Word has length 102 [2022-07-22 23:46:41,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:41,463 INFO L495 AbstractCegarLoop]: Abstraction has 10995 states and 15876 transitions. [2022-07-22 23:46:41,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-22 23:46:41,463 INFO L276 IsEmpty]: Start isEmpty. Operand 10995 states and 15876 transitions. [2022-07-22 23:46:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-22 23:46:41,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:41,469 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:41,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-07-22 23:46:41,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:41,683 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:41,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1390336057, now seen corresponding path program 1 times [2022-07-22 23:46:41,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:41,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928933692] [2022-07-22 23:46:41,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:41,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:41,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:41,686 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:41,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-22 23:46:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:42,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 23:46:42,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:43,143 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-22 23:46:43,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:43,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:43,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928933692] [2022-07-22 23:46:43,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928933692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:43,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:43,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:46:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366704374] [2022-07-22 23:46:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:43,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:46:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:46:43,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:46:43,145 INFO L87 Difference]: Start difference. First operand 10995 states and 15876 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 23:46:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:44,015 INFO L93 Difference]: Finished difference Result 17890 states and 25738 transitions. [2022-07-22 23:46:44,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:46:44,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 128 [2022-07-22 23:46:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:44,053 INFO L225 Difference]: With dead ends: 17890 [2022-07-22 23:46:44,053 INFO L226 Difference]: Without dead ends: 6911 [2022-07-22 23:46:44,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:46:44,082 INFO L413 NwaCegarLoop]: 1194 mSDtfsCounter, 38 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:44,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4767 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 23:46:44,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6911 states. [2022-07-22 23:46:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6911 to 6795. [2022-07-22 23:46:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6795 states, 5036 states have (on average 1.3534551231135823) internal successors, (6816), 5171 states have internal predecessors, (6816), 1362 states have call successors, (1362), 397 states have call predecessors, (1362), 396 states have return successors, (1549), 1280 states have call predecessors, (1549), 1359 states have call successors, (1549) [2022-07-22 23:46:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6795 states to 6795 states and 9727 transitions. [2022-07-22 23:46:44,240 INFO L78 Accepts]: Start accepts. Automaton has 6795 states and 9727 transitions. Word has length 128 [2022-07-22 23:46:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:44,240 INFO L495 AbstractCegarLoop]: Abstraction has 6795 states and 9727 transitions. [2022-07-22 23:46:44,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-22 23:46:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 6795 states and 9727 transitions. [2022-07-22 23:46:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 23:46:44,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:44,246 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:44,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:44,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:44,459 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:44,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:44,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1851619390, now seen corresponding path program 1 times [2022-07-22 23:46:44,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:44,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166071083] [2022-07-22 23:46:44,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:44,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:44,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:44,462 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:44,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-22 23:46:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:45,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 23:46:45,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-22 23:46:45,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:45,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:45,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166071083] [2022-07-22 23:46:45,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166071083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:45,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:45,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 23:46:45,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389343619] [2022-07-22 23:46:45,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:45,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 23:46:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:46,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 23:46:46,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 23:46:46,000 INFO L87 Difference]: Start difference. First operand 6795 states and 9727 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 23:46:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:48,542 INFO L93 Difference]: Finished difference Result 12476 states and 17885 transitions. [2022-07-22 23:46:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 23:46:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 134 [2022-07-22 23:46:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:48,568 INFO L225 Difference]: With dead ends: 12476 [2022-07-22 23:46:48,568 INFO L226 Difference]: Without dead ends: 6809 [2022-07-22 23:46:48,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 23:46:48,586 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 435 mSDsluCounter, 5231 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 6675 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:48,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 6675 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 23:46:48,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2022-07-22 23:46:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 6795. [2022-07-22 23:46:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6795 states, 5036 states have (on average 1.3526608419380461) internal successors, (6812), 5171 states have internal predecessors, (6812), 1362 states have call successors, (1362), 397 states have call predecessors, (1362), 396 states have return successors, (1549), 1280 states have call predecessors, (1549), 1359 states have call successors, (1549) [2022-07-22 23:46:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6795 states to 6795 states and 9723 transitions. [2022-07-22 23:46:48,809 INFO L78 Accepts]: Start accepts. Automaton has 6795 states and 9723 transitions. Word has length 134 [2022-07-22 23:46:48,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:48,810 INFO L495 AbstractCegarLoop]: Abstraction has 6795 states and 9723 transitions. [2022-07-22 23:46:48,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-22 23:46:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 6795 states and 9723 transitions. [2022-07-22 23:46:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-22 23:46:48,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:48,815 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:48,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:49,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:49,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1774718592, now seen corresponding path program 1 times [2022-07-22 23:46:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:49,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279734296] [2022-07-22 23:46:49,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:49,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:49,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:49,035 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:49,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-22 23:46:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:50,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 23:46:50,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-22 23:46:50,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:50,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:50,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279734296] [2022-07-22 23:46:50,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279734296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:50,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:50,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 23:46:50,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965270325] [2022-07-22 23:46:50,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:50,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 23:46:50,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:50,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 23:46:50,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:46:50,642 INFO L87 Difference]: Start difference. First operand 6795 states and 9723 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 23:46:50,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:50,905 INFO L93 Difference]: Finished difference Result 12514 states and 18007 transitions. [2022-07-22 23:46:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 23:46:50,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 134 [2022-07-22 23:46:50,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:50,927 INFO L225 Difference]: With dead ends: 12514 [2022-07-22 23:46:50,927 INFO L226 Difference]: Without dead ends: 6847 [2022-07-22 23:46:50,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:46:50,941 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 4 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:50,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4791 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 23:46:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6847 states. [2022-07-22 23:46:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6847 to 6829. [2022-07-22 23:46:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6829 states, 5060 states have (on average 1.3517786561264822) internal successors, (6840), 5197 states have internal predecessors, (6840), 1366 states have call successors, (1366), 397 states have call predecessors, (1366), 402 states have return successors, (1589), 1288 states have call predecessors, (1589), 1363 states have call successors, (1589) [2022-07-22 23:46:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6829 states to 6829 states and 9795 transitions. [2022-07-22 23:46:51,180 INFO L78 Accepts]: Start accepts. Automaton has 6829 states and 9795 transitions. Word has length 134 [2022-07-22 23:46:51,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:51,180 INFO L495 AbstractCegarLoop]: Abstraction has 6829 states and 9795 transitions. [2022-07-22 23:46:51,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-22 23:46:51,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6829 states and 9795 transitions. [2022-07-22 23:46:51,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-22 23:46:51,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:51,186 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:51,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:51,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:51,399 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:51,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:51,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1437416734, now seen corresponding path program 1 times [2022-07-22 23:46:51,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:51,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516909738] [2022-07-22 23:46:51,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:51,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:51,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:51,403 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:51,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-22 23:46:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:52,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 23:46:52,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-22 23:46:52,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:52,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:52,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516909738] [2022-07-22 23:46:52,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516909738] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:52,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:52,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 23:46:52,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521306281] [2022-07-22 23:46:52,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:52,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 23:46:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:52,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 23:46:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 23:46:52,639 INFO L87 Difference]: Start difference. First operand 6829 states and 9795 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 23:46:53,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:46:53,102 INFO L93 Difference]: Finished difference Result 16616 states and 23824 transitions. [2022-07-22 23:46:53,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 23:46:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2022-07-22 23:46:53,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:46:53,130 INFO L225 Difference]: With dead ends: 16616 [2022-07-22 23:46:53,130 INFO L226 Difference]: Without dead ends: 9427 [2022-07-22 23:46:53,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 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-07-22 23:46:53,147 INFO L413 NwaCegarLoop]: 1748 mSDtfsCounter, 897 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 23:46:53,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 2902 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 23:46:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2022-07-22 23:46:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 9304. [2022-07-22 23:46:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9304 states, 6922 states have (on average 1.3550996821727825) internal successors, (9380), 7116 states have internal predecessors, (9380), 1814 states have call successors, (1814), 556 states have call predecessors, (1814), 567 states have return successors, (2172), 1693 states have call predecessors, (2172), 1811 states have call successors, (2172) [2022-07-22 23:46:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 13366 transitions. [2022-07-22 23:46:53,424 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 13366 transitions. Word has length 138 [2022-07-22 23:46:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:46:53,424 INFO L495 AbstractCegarLoop]: Abstraction has 9304 states and 13366 transitions. [2022-07-22 23:46:53,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 23:46:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 13366 transitions. [2022-07-22 23:46:53,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-22 23:46:53,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:46:53,431 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:46:53,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-22 23:46:53,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:46:53,644 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:46:53,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:46:53,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1581890694, now seen corresponding path program 1 times [2022-07-22 23:46:53,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:46:53,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095888158] [2022-07-22 23:46:53,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:46:53,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:46:53,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:46:53,651 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:46:53,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-22 23:46:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:46:54,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-22 23:46:54,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:46:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-22 23:46:56,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:46:56,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:46:56,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095888158] [2022-07-22 23:46:56,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095888158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:46:56,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:46:56,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 23:46:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374953945] [2022-07-22 23:46:56,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:46:56,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 23:46:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:46:56,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 23:46:56,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-22 23:46:56,256 INFO L87 Difference]: Start difference. First operand 9304 states and 13366 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 23:47:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:47:03,992 INFO L93 Difference]: Finished difference Result 21756 states and 31871 transitions. [2022-07-22 23:47:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 23:47:03,993 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 140 [2022-07-22 23:47:03,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:47:04,031 INFO L225 Difference]: With dead ends: 21756 [2022-07-22 23:47:04,032 INFO L226 Difference]: Without dead ends: 12497 [2022-07-22 23:47:04,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-07-22 23:47:04,052 INFO L413 NwaCegarLoop]: 2339 mSDtfsCounter, 2563 mSDsluCounter, 20359 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2648 SdHoareTripleChecker+Valid, 22698 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-22 23:47:04,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2648 Valid, 22698 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-22 23:47:04,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-07-22 23:47:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 9288. [2022-07-22 23:47:04,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9288 states, 6906 states have (on average 1.3540399652476107) internal successors, (9351), 7101 states have internal predecessors, (9351), 1814 states have call successors, (1814), 556 states have call predecessors, (1814), 567 states have return successors, (2172), 1692 states have call predecessors, (2172), 1811 states have call successors, (2172) [2022-07-22 23:47:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 13337 transitions. [2022-07-22 23:47:04,421 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 13337 transitions. Word has length 140 [2022-07-22 23:47:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:47:04,422 INFO L495 AbstractCegarLoop]: Abstraction has 9288 states and 13337 transitions. [2022-07-22 23:47:04,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-22 23:47:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 13337 transitions. [2022-07-22 23:47:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-22 23:47:04,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:47:04,429 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:47:04,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-22 23:47:04,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:47:04,651 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:47:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:47:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1703720375, now seen corresponding path program 1 times [2022-07-22 23:47:04,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:47:04,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829604173] [2022-07-22 23:47:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:47:04,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:47:04,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:47:04,654 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:47:04,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-22 23:47:06,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 23:47:06,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 23:47:06,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 23:47:06,204 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-22 23:47:06,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 23:47:06,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 23:47:06,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829604173] [2022-07-22 23:47:06,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829604173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 23:47:06,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 23:47:06,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 23:47:06,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478892977] [2022-07-22 23:47:06,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 23:47:06,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 23:47:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 23:47:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 23:47:06,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 23:47:06,205 INFO L87 Difference]: Start difference. First operand 9288 states and 13337 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:47:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 23:47:07,054 INFO L93 Difference]: Finished difference Result 23965 states and 35282 transitions. [2022-07-22 23:47:07,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 23:47:07,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 161 [2022-07-22 23:47:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 23:47:07,103 INFO L225 Difference]: With dead ends: 23965 [2022-07-22 23:47:07,104 INFO L226 Difference]: Without dead ends: 14722 [2022-07-22 23:47:07,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 23:47:07,131 INFO L413 NwaCegarLoop]: 1799 mSDtfsCounter, 1094 mSDsluCounter, 2989 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 4788 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 23:47:07,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 4788 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 23:47:07,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14722 states. [2022-07-22 23:47:07,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14722 to 9304. [2022-07-22 23:47:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9304 states, 6922 states have (on average 1.3532216122507945) internal successors, (9367), 7117 states have internal predecessors, (9367), 1814 states have call successors, (1814), 556 states have call predecessors, (1814), 567 states have return successors, (2172), 1692 states have call predecessors, (2172), 1811 states have call successors, (2172) [2022-07-22 23:47:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 13353 transitions. [2022-07-22 23:47:07,520 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 13353 transitions. Word has length 161 [2022-07-22 23:47:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 23:47:07,521 INFO L495 AbstractCegarLoop]: Abstraction has 9304 states and 13353 transitions. [2022-07-22 23:47:07,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 23:47:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 13353 transitions. [2022-07-22 23:47:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-22 23:47:07,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 23:47:07,526 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 23:47:07,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-22 23:47:07,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 23:47:07,739 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 23:47:07,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 23:47:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 436590142, now seen corresponding path program 1 times [2022-07-22 23:47:07,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 23:47:07,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530170102] [2022-07-22 23:47:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 23:47:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 23:47:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 23:47:07,742 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 23:47:07,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process