./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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.0/usb_urb-drivers-net-usb-catc.ko.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:21:51,654 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:21:51,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:21:51,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:21:51,678 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:21:51,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:21:51,681 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:21:51,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:21:51,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:21:51,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:21:51,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:21:51,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:21:51,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:21:51,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:21:51,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:21:51,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:21:51,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:21:51,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:21:51,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:21:51,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:21:51,702 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:21:51,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:21:51,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:21:51,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:21:51,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:21:51,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:21:51,711 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:21:51,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:21:51,713 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:21:51,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:21:51,714 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:21:51,714 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:21:51,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:21:51,716 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:21:51,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:21:51,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:21:51,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:21:51,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:21:51,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:21:51,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:21:51,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:21:51,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:21:51,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:21:51,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:21:51,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:21:51,738 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:21:51,738 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:21:51,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:21:51,739 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:21:51,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:21:51,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:21:51,739 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:21:51,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:21:51,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:21:51,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:21:51,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:21:51,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:21:51,741 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-07-12 11:21:51,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:21:51,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:21:51,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:21:51,954 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:21:51,955 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:21:51,956 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-12 11:21:52,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5255a38/d09fe5617d7843c78957f6344382713b/FLAG62bcfc8b8 [2022-07-12 11:21:52,539 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:21:52,540 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-12 11:21:52,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5255a38/d09fe5617d7843c78957f6344382713b/FLAG62bcfc8b8 [2022-07-12 11:21:53,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5255a38/d09fe5617d7843c78957f6344382713b [2022-07-12 11:21:53,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:21:53,029 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:21:53,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:21:53,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:21:53,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:21:53,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:21:53" (1/1) ... [2022-07-12 11:21:53,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@686d3a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:53, skipping insertion in model container [2022-07-12 11:21:53,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:21:53" (1/1) ... [2022-07-12 11:21:53,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:21:53,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:21:53,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-12 11:21:53,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:21:53,946 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:21:54,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-12 11:21:54,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:21:54,370 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:21:54,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54 WrapperNode [2022-07-12 11:21:54,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:21:54,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:21:54,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:21:54,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:21:54,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,488 INFO L137 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1679 [2022-07-12 11:21:54,490 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:21:54,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:21:54,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:21:54,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:21:54,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,607 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:21:54,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:21:54,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:21:54,626 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:21:54,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (1/1) ... [2022-07-12 11:21:54,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:21:54,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:21:54,649 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-12 11:21:54,655 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-12 11:21:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 11:21:54,680 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 11:21:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-12 11:21:54,680 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-12 11:21:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:21:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 11:21:54,681 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 11:21:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:21:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:21:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:21:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 11:21:54,681 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 11:21:54,681 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 11:21:54,681 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 11:21:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-12 11:21:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-12 11:21:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-12 11:21:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-12 11:21:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-12 11:21:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-12 11:21:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:21:54,682 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:21:54,682 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 11:21:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 11:21:54,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:21:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:21:54,683 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-12 11:21:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-12 11:21:54,683 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 11:21:54,683 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 11:21:54,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:21:54,683 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 11:21:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 11:21:54,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-12 11:21:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-12 11:21:54,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-12 11:21:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-12 11:21:54,684 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 11:21:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 11:21:54,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 11:21:54,684 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 11:21:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 11:21:54,685 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 11:21:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:21:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-12 11:21:54,685 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-12 11:21:54,685 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 11:21:54,685 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 11:21:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 11:21:54,686 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 11:21:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:21:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:21:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:21:54,686 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-12 11:21:54,687 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-12 11:21:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:21:54,687 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-12 11:21:54,688 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-12 11:21:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 11:21:54,688 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 11:21:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 11:21:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 11:21:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 11:21:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 11:21:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-12 11:21:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-12 11:21:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:21:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:21:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:21:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:21:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 11:21:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 11:21:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-12 11:21:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-12 11:21:54,690 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 11:21:54,690 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 11:21:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 11:21:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 11:21:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 11:21:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 11:21:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-12 11:21:54,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-12 11:21:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:21:54,691 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 11:21:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 11:21:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:21:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-12 11:21:54,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:21:54,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:21:55,012 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:21:55,016 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:21:55,563 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-12 11:21:55,601 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:55,614 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:56,251 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-12 11:21:56,251 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-12 11:21:56,251 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-12 11:21:56,251 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-12 11:21:56,266 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:21:56,273 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:21:56,273 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-12 11:21:56,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:56 BoogieIcfgContainer [2022-07-12 11:21:56,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:21:56,276 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:21:56,276 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:21:56,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:21:56,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:21:53" (1/3) ... [2022-07-12 11:21:56,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe7c4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:21:56, skipping insertion in model container [2022-07-12 11:21:56,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:54" (2/3) ... [2022-07-12 11:21:56,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fe7c4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:21:56, skipping insertion in model container [2022-07-12 11:21:56,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:56" (3/3) ... [2022-07-12 11:21:56,280 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-12 11:21:56,291 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:21:56,291 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:21:56,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:21:56,334 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@25e5a863, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ef6b1b2 [2022-07-12 11:21:56,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:21:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 547 states, 388 states have (on average 1.3943298969072164) internal successors, (541), 401 states have internal predecessors, (541), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-07-12 11:21:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:21:56,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:56,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:56,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:56,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -701775118, now seen corresponding path program 1 times [2022-07-12 11:21:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:56,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957348706] [2022-07-12 11:21:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:56,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:56,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:56,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:56,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957348706] [2022-07-12 11:21:56,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957348706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:56,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:56,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:21:56,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548986568] [2022-07-12 11:21:56,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:56,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:21:56,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:21:56,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:21:56,794 INFO L87 Difference]: Start difference. First operand has 547 states, 388 states have (on average 1.3943298969072164) internal successors, (541), 401 states have internal predecessors, (541), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:21:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:56,940 INFO L93 Difference]: Finished difference Result 1092 states and 1610 transitions. [2022-07-12 11:21:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:21:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 11:21:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:56,957 INFO L225 Difference]: With dead ends: 1092 [2022-07-12 11:21:56,957 INFO L226 Difference]: Without dead ends: 548 [2022-07-12 11:21:56,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:21:56,970 INFO L413 NwaCegarLoop]: 719 mSDtfsCounter, 301 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:56,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3190 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:21:56,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-12 11:21:57,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 543. [2022-07-12 11:21:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 386 states have (on average 1.217616580310881) internal successors, (470), 394 states have internal predecessors, (470), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-07-12 11:21:57,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 710 transitions. [2022-07-12 11:21:57,045 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 710 transitions. Word has length 17 [2022-07-12 11:21:57,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:57,045 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 710 transitions. [2022-07-12 11:21:57,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:21:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 710 transitions. [2022-07-12 11:21:57,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:21:57,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:57,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:57,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:21:57,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:57,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:57,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1094802128, now seen corresponding path program 1 times [2022-07-12 11:21:57,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:57,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805591326] [2022-07-12 11:21:57,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:57,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805591326] [2022-07-12 11:21:57,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805591326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:57,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:57,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:21:57,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893631306] [2022-07-12 11:21:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:57,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:21:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:21:57,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:57,178 INFO L87 Difference]: Start difference. First operand 543 states and 710 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:21:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:57,240 INFO L93 Difference]: Finished difference Result 1589 states and 2102 transitions. [2022-07-12 11:21:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:21:57,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 11:21:57,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:57,250 INFO L225 Difference]: With dead ends: 1589 [2022-07-12 11:21:57,250 INFO L226 Difference]: Without dead ends: 1064 [2022-07-12 11:21:57,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 11:21:57,254 INFO L413 NwaCegarLoop]: 993 mSDtfsCounter, 693 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:57,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1679 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:21:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-07-12 11:21:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1061. [2022-07-12 11:21:57,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 754 states have (on average 1.2175066312997347) internal successors, (918), 767 states have internal predecessors, (918), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-07-12 11:21:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1396 transitions. [2022-07-12 11:21:57,321 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1396 transitions. Word has length 17 [2022-07-12 11:21:57,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:57,321 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1396 transitions. [2022-07-12 11:21:57,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:21:57,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1396 transitions. [2022-07-12 11:21:57,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 11:21:57,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:57,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:57,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:21:57,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash 420612946, now seen corresponding path program 1 times [2022-07-12 11:21:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:57,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415620839] [2022-07-12 11:21:57,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:57,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:57,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:57,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415620839] [2022-07-12 11:21:57,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415620839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:57,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:57,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:21:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140495817] [2022-07-12 11:21:57,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:57,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:21:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:57,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:21:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:57,422 INFO L87 Difference]: Start difference. First operand 1061 states and 1396 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:21:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:57,442 INFO L93 Difference]: Finished difference Result 1063 states and 1397 transitions. [2022-07-12 11:21:57,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:21:57,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-12 11:21:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:57,447 INFO L225 Difference]: With dead ends: 1063 [2022-07-12 11:21:57,447 INFO L226 Difference]: Without dead ends: 1052 [2022-07-12 11:21:57,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-12 11:21:57,455 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 695 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 703 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-12 11:21:57,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:21:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-12 11:21:57,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1047. [2022-07-12 11:21:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 744 states have (on average 1.2123655913978495) internal successors, (902), 755 states have internal predecessors, (902), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-07-12 11:21:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1376 transitions. [2022-07-12 11:21:57,495 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1376 transitions. Word has length 18 [2022-07-12 11:21:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:57,495 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1376 transitions. [2022-07-12 11:21:57,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:21:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1376 transitions. [2022-07-12 11:21:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 11:21:57,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:57,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:57,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:21:57,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash -42685748, now seen corresponding path program 1 times [2022-07-12 11:21:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:57,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851717108] [2022-07-12 11:21:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:57,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 11:21:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:21:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:57,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:57,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851717108] [2022-07-12 11:21:57,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851717108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:57,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:57,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:21:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284680859] [2022-07-12 11:21:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:57,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:21:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:21:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:21:57,626 INFO L87 Difference]: Start difference. First operand 1047 states and 1376 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:21:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:58,521 INFO L93 Difference]: Finished difference Result 2403 states and 3232 transitions. [2022-07-12 11:21:58,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:21:58,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-12 11:21:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:58,529 INFO L225 Difference]: With dead ends: 2403 [2022-07-12 11:21:58,529 INFO L226 Difference]: Without dead ends: 1368 [2022-07-12 11:21:58,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:21:58,537 INFO L413 NwaCegarLoop]: 758 mSDtfsCounter, 427 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:58,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1360 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:21:58,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-07-12 11:21:58,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1346. [2022-07-12 11:21:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 961 states have (on average 1.2341311134235171) internal successors, (1186), 980 states have internal predecessors, (1186), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-07-12 11:21:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1824 transitions. [2022-07-12 11:21:58,590 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1824 transitions. Word has length 50 [2022-07-12 11:21:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:58,590 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1824 transitions. [2022-07-12 11:21:58,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:21:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1824 transitions. [2022-07-12 11:21:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 11:21:58,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:58,596 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:21:58,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:21:58,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:58,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1108217249, now seen corresponding path program 1 times [2022-07-12 11:21:58,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:58,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982217681] [2022-07-12 11:21:58,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:58,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-12 11:21:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:21:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 11:21:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:58,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982217681] [2022-07-12 11:21:58,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982217681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:58,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:58,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:21:58,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858532531] [2022-07-12 11:21:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:58,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:21:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:58,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:21:58,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:21:58,733 INFO L87 Difference]: Start difference. First operand 1346 states and 1824 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 11:21:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:59,714 INFO L93 Difference]: Finished difference Result 2719 states and 3690 transitions. [2022-07-12 11:21:59,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:21:59,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-07-12 11:21:59,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:59,720 INFO L225 Difference]: With dead ends: 2719 [2022-07-12 11:21:59,720 INFO L226 Difference]: Without dead ends: 1374 [2022-07-12 11:21:59,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:21:59,725 INFO L413 NwaCegarLoop]: 682 mSDtfsCounter, 183 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:59,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1801 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 11:21:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-12 11:21:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1346. [2022-07-12 11:21:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 961 states have (on average 1.2320499479708638) internal successors, (1184), 982 states have internal predecessors, (1184), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-07-12 11:21:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1818 transitions. [2022-07-12 11:21:59,768 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1818 transitions. Word has length 72 [2022-07-12 11:21:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:59,768 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1818 transitions. [2022-07-12 11:21:59,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 11:21:59,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1818 transitions. [2022-07-12 11:21:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-12 11:21:59,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:59,770 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:21:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:21:59,771 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:59,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:59,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1223480200, now seen corresponding path program 1 times [2022-07-12 11:21:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213100785] [2022-07-12 11:21:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:21:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:21:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:21:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:21:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:21:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:21:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:21:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:21:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:21:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:21:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-12 11:22:00,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:00,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213100785] [2022-07-12 11:22:00,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213100785] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:00,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982163770] [2022-07-12 11:22:00,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:00,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:00,055 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-12 11:22:00,085 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-12 11:22:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:22:00,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:00,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:00,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 11:22:00,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:00,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982163770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:00,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:00,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-12 11:22:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406406659] [2022-07-12 11:22:00,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:00,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:22:00,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:22:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:00,629 INFO L87 Difference]: Start difference. First operand 1346 states and 1818 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:22:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:01,769 INFO L93 Difference]: Finished difference Result 1408 states and 1898 transitions. [2022-07-12 11:22:01,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:22:01,770 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-07-12 11:22:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:01,777 INFO L225 Difference]: With dead ends: 1408 [2022-07-12 11:22:01,777 INFO L226 Difference]: Without dead ends: 1348 [2022-07-12 11:22:01,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:01,779 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 4 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:01,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3923 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 11:22:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2022-07-12 11:22:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1346. [2022-07-12 11:22:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 961 states have (on average 1.2299687825182102) internal successors, (1182), 982 states have internal predecessors, (1182), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-07-12 11:22:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1816 transitions. [2022-07-12 11:22:01,815 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1816 transitions. Word has length 146 [2022-07-12 11:22:01,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:01,817 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1816 transitions. [2022-07-12 11:22:01,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:22:01,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1816 transitions. [2022-07-12 11:22:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:22:01,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:01,822 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:22:01,851 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-12 11:22:02,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 11:22:02,036 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:02,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:02,036 INFO L85 PathProgramCache]: Analyzing trace with hash 193202081, now seen corresponding path program 1 times [2022-07-12 11:22:02,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:02,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544320236] [2022-07-12 11:22:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:02,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,302 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-12 11:22:02,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:02,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544320236] [2022-07-12 11:22:02,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544320236] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:02,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823119018] [2022-07-12 11:22:02,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:02,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:02,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:02,304 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-12 11:22:02,333 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-12 11:22:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:02,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 11:22:02,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 11:22:02,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:02,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823119018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:02,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:02,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-12 11:22:02,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929876509] [2022-07-12 11:22:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:02,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:22:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:22:02,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:22:02,788 INFO L87 Difference]: Start difference. First operand 1346 states and 1816 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:22:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:02,870 INFO L93 Difference]: Finished difference Result 2703 states and 3651 transitions. [2022-07-12 11:22:02,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:22:02,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 147 [2022-07-12 11:22:02,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:02,876 INFO L225 Difference]: With dead ends: 2703 [2022-07-12 11:22:02,876 INFO L226 Difference]: Without dead ends: 1367 [2022-07-12 11:22:02,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:02,881 INFO L413 NwaCegarLoop]: 711 mSDtfsCounter, 13 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:02,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3524 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-12 11:22:02,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1353. [2022-07-12 11:22:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 966 states have (on average 1.2287784679089027) internal successors, (1187), 988 states have internal predecessors, (1187), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-07-12 11:22:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1826 transitions. [2022-07-12 11:22:02,918 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1826 transitions. Word has length 147 [2022-07-12 11:22:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:02,918 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1826 transitions. [2022-07-12 11:22:02,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:22:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1826 transitions. [2022-07-12 11:22:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:22:02,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:02,920 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:22:02,940 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-12 11:22:03,128 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,SelfDestructingSolverStorable6 [2022-07-12 11:22:03,128 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:03,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2120603136, now seen corresponding path program 1 times [2022-07-12 11:22:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:03,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000593503] [2022-07-12 11:22:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:03,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:03,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 11:22:03,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000593503] [2022-07-12 11:22:03,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000593503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:03,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348037521] [2022-07-12 11:22:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:03,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:03,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:03,391 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-12 11:22:03,392 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-12 11:22:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:03,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-12 11:22:03,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:03,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:22:03,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:22:03,956 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:22:03,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:03,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:03,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:04,095 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:22:04,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:04,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:04,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:04,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:04,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:04,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:04,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 11:22:04,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:04,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:04,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:04,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-12 11:22:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 11:22:04,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 11:22:04,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348037521] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:04,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-07-12 11:22:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707523300] [2022-07-12 11:22:04,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:04,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 11:22:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:04,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 11:22:04,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:22:04,645 INFO L87 Difference]: Start difference. First operand 1353 states and 1826 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-12 11:22:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:08,256 INFO L93 Difference]: Finished difference Result 2464 states and 3330 transitions. [2022-07-12 11:22:08,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 11:22:08,256 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 147 [2022-07-12 11:22:08,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:08,261 INFO L225 Difference]: With dead ends: 2464 [2022-07-12 11:22:08,261 INFO L226 Difference]: Without dead ends: 1032 [2022-07-12 11:22:08,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:22:08,265 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 170 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:08,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 4486 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2473 Invalid, 0 Unknown, 422 Unchecked, 3.5s Time] [2022-07-12 11:22:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-07-12 11:22:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1016. [2022-07-12 11:22:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 725 states have (on average 1.226206896551724) internal successors, (889), 742 states have internal predecessors, (889), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-07-12 11:22:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1346 transitions. [2022-07-12 11:22:08,296 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1346 transitions. Word has length 147 [2022-07-12 11:22:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:08,297 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1346 transitions. [2022-07-12 11:22:08,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-12 11:22:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1346 transitions. [2022-07-12 11:22:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:22:08,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:08,298 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2022-07-12 11:22:08,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:08,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:08,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:08,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -339103201, now seen corresponding path program 1 times [2022-07-12 11:22:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:08,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619726430] [2022-07-12 11:22:08,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:08,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-12 11:22:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619726430] [2022-07-12 11:22:08,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619726430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:08,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770891295] [2022-07-12 11:22:08,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:08,793 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-12 11:22:08,795 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-12 11:22:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 11:22:09,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 11:22:09,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:22:09,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770891295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:09,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:09,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2022-07-12 11:22:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323646108] [2022-07-12 11:22:09,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:09,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 11:22:09,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:09,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 11:22:09,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:22:09,613 INFO L87 Difference]: Start difference. First operand 1016 states and 1346 transitions. Second operand has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-07-12 11:22:14,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:14,722 INFO L93 Difference]: Finished difference Result 2099 states and 2804 transitions. [2022-07-12 11:22:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 11:22:14,723 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) Word has length 147 [2022-07-12 11:22:14,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:14,733 INFO L225 Difference]: With dead ends: 2099 [2022-07-12 11:22:14,733 INFO L226 Difference]: Without dead ends: 1397 [2022-07-12 11:22:14,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 11:22:14,735 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 2183 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 4166 mSolverCounterSat, 1104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 4970 SdHoareTripleChecker+Invalid, 5270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1104 IncrementalHoareTripleChecker+Valid, 4166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:14,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 4970 Invalid, 5270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1104 Valid, 4166 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-12 11:22:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-07-12 11:22:14,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1372. [2022-07-12 11:22:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 975 states have (on average 1.2225641025641025) internal successors, (1192), 997 states have internal predecessors, (1192), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-07-12 11:22:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1823 transitions. [2022-07-12 11:22:14,781 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1823 transitions. Word has length 147 [2022-07-12 11:22:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:14,781 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1823 transitions. [2022-07-12 11:22:14,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-07-12 11:22:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1823 transitions. [2022-07-12 11:22:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 11:22:14,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:14,783 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:14,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-12 11:22:14,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:14,999 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:15,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1013490977, now seen corresponding path program 1 times [2022-07-12 11:22:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:15,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496125838] [2022-07-12 11:22:15,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:15,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-12 11:22:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 11:22:15,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496125838] [2022-07-12 11:22:15,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496125838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:15,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927205517] [2022-07-12 11:22:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:15,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:15,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:15,283 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-12 11:22:15,288 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-12 11:22:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:15,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:22:15,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:15,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:15,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 11:22:15,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 11:22:15,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927205517] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:15,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:22:15,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-12 11:22:15,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273250128] [2022-07-12 11:22:15,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:15,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:22:15,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:15,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:22:15,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:15,947 INFO L87 Difference]: Start difference. First operand 1372 states and 1823 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 11:22:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:16,986 INFO L93 Difference]: Finished difference Result 1437 states and 1901 transitions. [2022-07-12 11:22:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:22:16,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-07-12 11:22:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:16,991 INFO L225 Difference]: With dead ends: 1437 [2022-07-12 11:22:16,991 INFO L226 Difference]: Without dead ends: 1372 [2022-07-12 11:22:16,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:22:16,993 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 5 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:16,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3923 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 11:22:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-07-12 11:22:17,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2022-07-12 11:22:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 975 states have (on average 1.2215384615384615) internal successors, (1191), 997 states have internal predecessors, (1191), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-07-12 11:22:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1822 transitions. [2022-07-12 11:22:17,035 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1822 transitions. Word has length 157 [2022-07-12 11:22:17,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:17,036 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1822 transitions. [2022-07-12 11:22:17,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 11:22:17,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1822 transitions. [2022-07-12 11:22:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 11:22:17,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:17,039 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:17,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:17,258 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,SelfDestructingSolverStorable9 [2022-07-12 11:22:17,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:17,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash -497932717, now seen corresponding path program 1 times [2022-07-12 11:22:17,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:17,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407905792] [2022-07-12 11:22:17,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:17,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:22:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 11:22:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:17,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407905792] [2022-07-12 11:22:17,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407905792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:17,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218170451] [2022-07-12 11:22:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:17,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:17,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:17,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:17,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:22:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 11:22:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:18,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:22:18,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:22:18,120 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:22:18,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:18,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:18,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:18,238 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:22:18,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:18,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:18,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:22:18,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 11:22:18,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218170451] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:18,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:18,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-12 11:22:18,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574608696] [2022-07-12 11:22:18,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:18,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 11:22:18,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:18,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 11:22:18,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:22:18,446 INFO L87 Difference]: Start difference. First operand 1372 states and 1822 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-12 11:22:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:21,757 INFO L93 Difference]: Finished difference Result 2452 states and 3275 transitions. [2022-07-12 11:22:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 11:22:21,757 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 158 [2022-07-12 11:22:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:21,762 INFO L225 Difference]: With dead ends: 2452 [2022-07-12 11:22:21,763 INFO L226 Difference]: Without dead ends: 1374 [2022-07-12 11:22:21,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 342 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:22:21,766 INFO L413 NwaCegarLoop]: 692 mSDtfsCounter, 173 mSDsluCounter, 3395 mSDsCounter, 0 mSdLazyCounter, 2513 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 4087 SdHoareTripleChecker+Invalid, 3061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:21,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 4087 Invalid, 3061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2513 Invalid, 0 Unknown, 415 Unchecked, 3.2s Time] [2022-07-12 11:22:21,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-12 11:22:21,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2022-07-12 11:22:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 975 states have (on average 1.2215384615384615) internal successors, (1191), 997 states have internal predecessors, (1191), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (328), 297 states have call predecessors, (328), 300 states have call successors, (328) [2022-07-12 11:22:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1821 transitions. [2022-07-12 11:22:21,800 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1821 transitions. Word has length 158 [2022-07-12 11:22:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:21,800 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1821 transitions. [2022-07-12 11:22:21,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-12 11:22:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1821 transitions. [2022-07-12 11:22:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 11:22:21,802 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:21,802 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:22:21,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:22,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:22,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:22,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:22,016 INFO L85 PathProgramCache]: Analyzing trace with hash 865652627, now seen corresponding path program 1 times [2022-07-12 11:22:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:22,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345545478] [2022-07-12 11:22:22,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:22:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,264 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-12 11:22:22,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:22,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345545478] [2022-07-12 11:22:22,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345545478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:22,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128455058] [2022-07-12 11:22:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:22,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:22,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:22,266 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:22,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:22:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:22,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 1961 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 11:22:22,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:22,940 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-12 11:22:22,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-12 11:22:23,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128455058] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:23,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:23,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 11] total 22 [2022-07-12 11:22:23,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981386079] [2022-07-12 11:22:23,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:23,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 11:22:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:23,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 11:22:23,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:22:23,245 INFO L87 Difference]: Start difference. First operand 1372 states and 1821 transitions. Second operand has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 17 states have internal predecessors, (188), 10 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (45), 11 states have call predecessors, (45), 10 states have call successors, (45) [2022-07-12 11:22:28,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:28,906 INFO L93 Difference]: Finished difference Result 2837 states and 3755 transitions. [2022-07-12 11:22:28,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 11:22:28,906 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 17 states have internal predecessors, (188), 10 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (45), 11 states have call predecessors, (45), 10 states have call successors, (45) Word has length 158 [2022-07-12 11:22:28,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:28,912 INFO L225 Difference]: With dead ends: 2837 [2022-07-12 11:22:28,912 INFO L226 Difference]: Without dead ends: 1782 [2022-07-12 11:22:28,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1565, Unknown=0, NotChecked=0, Total=1980 [2022-07-12 11:22:28,915 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 2605 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 5661 mSolverCounterSat, 1381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 5841 SdHoareTripleChecker+Invalid, 7042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1381 IncrementalHoareTripleChecker+Valid, 5661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:28,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2789 Valid, 5841 Invalid, 7042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1381 Valid, 5661 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-07-12 11:22:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-07-12 11:22:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2022-07-12 11:22:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1229 states have (on average 1.2188771358828316) internal successors, (1498), 1259 states have internal predecessors, (1498), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 370 states have call predecessors, (411), 376 states have call successors, (411) [2022-07-12 11:22:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2287 transitions. [2022-07-12 11:22:28,962 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2287 transitions. Word has length 158 [2022-07-12 11:22:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:28,963 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2287 transitions. [2022-07-12 11:22:28,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 17 states have internal predecessors, (188), 10 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (45), 11 states have call predecessors, (45), 10 states have call successors, (45) [2022-07-12 11:22:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2287 transitions. [2022-07-12 11:22:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-12 11:22:28,965 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:28,965 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-12 11:22:28,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:29,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:29,171 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:29,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2103165584, now seen corresponding path program 1 times [2022-07-12 11:22:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:29,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436880996] [2022-07-12 11:22:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 11:22:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 11:22:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-12 11:22:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436880996] [2022-07-12 11:22:29,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436880996] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:29,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690010982] [2022-07-12 11:22:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:29,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:29,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:29,388 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:29,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:22:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:22:29,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:29,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:29,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-12 11:22:29,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-12 11:22:30,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690010982] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:30,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:22:30,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-12 11:22:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711971402] [2022-07-12 11:22:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:30,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:22:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:30,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:22:30,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:30,138 INFO L87 Difference]: Start difference. First operand 1735 states and 2287 transitions. Second operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:22:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:31,154 INFO L93 Difference]: Finished difference Result 1822 states and 2390 transitions. [2022-07-12 11:22:31,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:22:31,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2022-07-12 11:22:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:31,161 INFO L225 Difference]: With dead ends: 1822 [2022-07-12 11:22:31,161 INFO L226 Difference]: Without dead ends: 1735 [2022-07-12 11:22:31,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:22:31,162 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 6 mSDsluCounter, 3230 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:31,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3931 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 11:22:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-12 11:22:31,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-12 11:22:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1229 states have (on average 1.2180634662327094) internal successors, (1497), 1259 states have internal predecessors, (1497), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 370 states have call predecessors, (411), 376 states have call successors, (411) [2022-07-12 11:22:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2286 transitions. [2022-07-12 11:22:31,205 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2286 transitions. Word has length 168 [2022-07-12 11:22:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:31,205 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2286 transitions. [2022-07-12 11:22:31,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:22:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2286 transitions. [2022-07-12 11:22:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 11:22:31,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:31,207 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-07-12 11:22:31,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:31,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 11:22:31,433 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash -332857001, now seen corresponding path program 1 times [2022-07-12 11:22:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:31,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365909805] [2022-07-12 11:22:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:31,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:22:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,653 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-12 11:22:31,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:31,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365909805] [2022-07-12 11:22:31,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365909805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:31,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506101057] [2022-07-12 11:22:31,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:31,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:31,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:31,655 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:31,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:22:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:32,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-12 11:22:32,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:32,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:22:32,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:22:32,307 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:22:32,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:32,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:32,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:22:32,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:22:32,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-07-12 11:22:32,656 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 11:22:32,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-07-12 11:22:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:22:32,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-12 11:22:32,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506101057] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:32,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:32,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2022-07-12 11:22:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494950174] [2022-07-12 11:22:32,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:32,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 11:22:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 11:22:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:22:32,827 INFO L87 Difference]: Start difference. First operand 1735 states and 2286 transitions. Second operand has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 11:22:35,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:35,236 INFO L93 Difference]: Finished difference Result 3174 states and 4193 transitions. [2022-07-12 11:22:35,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:22:35,237 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) Word has length 169 [2022-07-12 11:22:35,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:35,243 INFO L225 Difference]: With dead ends: 3174 [2022-07-12 11:22:35,243 INFO L226 Difference]: Without dead ends: 1735 [2022-07-12 11:22:35,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 365 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:22:35,247 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 177 mSDsluCounter, 4018 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 4707 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:35,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 4707 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2225 Invalid, 0 Unknown, 795 Unchecked, 2.2s Time] [2022-07-12 11:22:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-12 11:22:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-12 11:22:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1229 states have (on average 1.2180634662327094) internal successors, (1497), 1259 states have internal predecessors, (1497), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (410), 370 states have call predecessors, (410), 376 states have call successors, (410) [2022-07-12 11:22:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2285 transitions. [2022-07-12 11:22:35,318 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2285 transitions. Word has length 169 [2022-07-12 11:22:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:35,318 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2285 transitions. [2022-07-12 11:22:35,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-12 11:22:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2285 transitions. [2022-07-12 11:22:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 11:22:35,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:35,320 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:35,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:35,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 11:22:35,539 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1756471977, now seen corresponding path program 1 times [2022-07-12 11:22:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:35,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404652995] [2022-07-12 11:22:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:22:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:22:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:35,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404652995] [2022-07-12 11:22:35,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404652995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:35,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:35,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:22:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107194760] [2022-07-12 11:22:35,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:22:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:22:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:22:35,811 INFO L87 Difference]: Start difference. First operand 1735 states and 2285 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:22:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:39,704 INFO L93 Difference]: Finished difference Result 1826 states and 2397 transitions. [2022-07-12 11:22:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 11:22:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) Word has length 169 [2022-07-12 11:22:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:39,710 INFO L225 Difference]: With dead ends: 1826 [2022-07-12 11:22:39,710 INFO L226 Difference]: Without dead ends: 1748 [2022-07-12 11:22:39,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:22:39,711 INFO L413 NwaCegarLoop]: 674 mSDtfsCounter, 502 mSDsluCounter, 4055 mSDsCounter, 0 mSdLazyCounter, 3157 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 4729 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 3157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:39,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 4729 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 3157 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-12 11:22:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-07-12 11:22:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1740. [2022-07-12 11:22:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1234 states have (on average 1.2171799027552674) internal successors, (1502), 1263 states have internal predecessors, (1502), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (410), 371 states have call predecessors, (410), 376 states have call successors, (410) [2022-07-12 11:22:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2290 transitions. [2022-07-12 11:22:39,756 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2290 transitions. Word has length 169 [2022-07-12 11:22:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:39,756 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 2290 transitions. [2022-07-12 11:22:39,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:22:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2290 transitions. [2022-07-12 11:22:39,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-12 11:22:39,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:39,759 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:39,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 11:22:39,759 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1061543817, now seen corresponding path program 2 times [2022-07-12 11:22:39,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:39,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806489885] [2022-07-12 11:22:39,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:39,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:22:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-12 11:22:40,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:40,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806489885] [2022-07-12 11:22:40,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806489885] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:40,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329999387] [2022-07-12 11:22:40,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:22:40,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:40,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:40,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:22:40,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:22:40,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:22:40,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:22:40,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-12 11:22:40,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-12 11:22:41,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329999387] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:22:41,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:22:41,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 15] total 24 [2022-07-12 11:22:41,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940546205] [2022-07-12 11:22:41,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:41,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 11:22:41,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:41,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 11:22:41,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:22:41,154 INFO L87 Difference]: Start difference. First operand 1740 states and 2290 transitions. Second operand has 24 states, 24 states have (on average 7.75) internal successors, (186), 22 states have internal predecessors, (186), 15 states have call successors, (50), 12 states have call predecessors, (50), 13 states have return successors, (44), 13 states have call predecessors, (44), 14 states have call successors, (44) [2022-07-12 11:22:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:46,212 INFO L93 Difference]: Finished difference Result 2197 states and 2842 transitions. [2022-07-12 11:22:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 11:22:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.75) internal successors, (186), 22 states have internal predecessors, (186), 15 states have call successors, (50), 12 states have call predecessors, (50), 13 states have return successors, (44), 13 states have call predecessors, (44), 14 states have call successors, (44) Word has length 169 [2022-07-12 11:22:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:46,220 INFO L225 Difference]: With dead ends: 2197 [2022-07-12 11:22:46,220 INFO L226 Difference]: Without dead ends: 2185 [2022-07-12 11:22:46,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 11:22:46,222 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 6428 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 2976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6706 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 7897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2976 IncrementalHoareTripleChecker+Valid, 4921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:46,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6706 Valid, 4531 Invalid, 7897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2976 Valid, 4921 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-12 11:22:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-07-12 11:22:46,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2105. [2022-07-12 11:22:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 1491 states have (on average 1.215962441314554) internal successors, (1813), 1527 states have internal predecessors, (1813), 452 states have call successors, (452), 156 states have call predecessors, (452), 161 states have return successors, (488), 444 states have call predecessors, (488), 450 states have call successors, (488) [2022-07-12 11:22:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2753 transitions. [2022-07-12 11:22:46,277 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2753 transitions. Word has length 169 [2022-07-12 11:22:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:46,277 INFO L495 AbstractCegarLoop]: Abstraction has 2105 states and 2753 transitions. [2022-07-12 11:22:46,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.75) internal successors, (186), 22 states have internal predecessors, (186), 15 states have call successors, (50), 12 states have call predecessors, (50), 13 states have return successors, (44), 13 states have call predecessors, (44), 14 states have call successors, (44) [2022-07-12 11:22:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2753 transitions. [2022-07-12 11:22:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-12 11:22:46,279 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:46,280 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2022-07-12 11:22:46,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:46,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 11:22:46,497 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:46,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1170991758, now seen corresponding path program 1 times [2022-07-12 11:22:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:46,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686007324] [2022-07-12 11:22:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:46,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-12 11:22:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-12 11:22:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 11:22:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:46,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686007324] [2022-07-12 11:22:46,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686007324] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:46,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018067269] [2022-07-12 11:22:46,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:46,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:46,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:46,756 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:46,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:22:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:47,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:22:47,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:47,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:47,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:22:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 11:22:47,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-12 11:22:47,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018067269] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:47,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:22:47,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-12 11:22:47,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321909964] [2022-07-12 11:22:47,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:47,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:22:47,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:22:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:22:47,564 INFO L87 Difference]: Start difference. First operand 2105 states and 2753 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 11:22:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:48,593 INFO L93 Difference]: Finished difference Result 2171 states and 2812 transitions. [2022-07-12 11:22:48,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:22:48,593 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 179 [2022-07-12 11:22:48,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:48,600 INFO L225 Difference]: With dead ends: 2171 [2022-07-12 11:22:48,600 INFO L226 Difference]: Without dead ends: 2076 [2022-07-12 11:22:48,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 392 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:22:48,602 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 7 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:48,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3858 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-12 11:22:48,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-12 11:22:48,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2071. [2022-07-12 11:22:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 1471 states have (on average 1.2182188987083618) internal successors, (1792), 1508 states have internal predecessors, (1792), 438 states have call successors, (438), 156 states have call predecessors, (438), 161 states have return successors, (464), 429 states have call predecessors, (464), 436 states have call successors, (464) [2022-07-12 11:22:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2694 transitions. [2022-07-12 11:22:48,655 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2694 transitions. Word has length 179 [2022-07-12 11:22:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:48,656 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 2694 transitions. [2022-07-12 11:22:48,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 11:22:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2694 transitions. [2022-07-12 11:22:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-12 11:22:48,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:48,658 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:22:48,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 11:22:48,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 11:22:48,880 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:48,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:48,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1646245098, now seen corresponding path program 1 times [2022-07-12 11:22:48,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:48,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502385537] [2022-07-12 11:22:48,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:48,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:22:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:22:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 11:22:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:22:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:22:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:22:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:22:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 11:22:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 11:22:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-12 11:22:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 11:22:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-07-12 11:22:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:49,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502385537] [2022-07-12 11:22:49,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502385537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:49,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:49,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:22:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527383838] [2022-07-12 11:22:49,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:49,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:22:49,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:49,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:22:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:49,239 INFO L87 Difference]: Start difference. First operand 2071 states and 2694 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:22:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:52,390 INFO L93 Difference]: Finished difference Result 3867 states and 5086 transitions. [2022-07-12 11:22:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:22:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 263 [2022-07-12 11:22:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:52,398 INFO L225 Difference]: With dead ends: 3867 [2022-07-12 11:22:52,399 INFO L226 Difference]: Without dead ends: 2110 [2022-07-12 11:22:52,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:22:52,402 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 465 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:52,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 3115 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-12 11:22:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-07-12 11:22:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2064. [2022-07-12 11:22:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1466 states have (on average 1.218963165075034) internal successors, (1787), 1503 states have internal predecessors, (1787), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-12 11:22:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2686 transitions. [2022-07-12 11:22:52,465 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2686 transitions. Word has length 263 [2022-07-12 11:22:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:52,466 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2686 transitions. [2022-07-12 11:22:52,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:22:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2686 transitions. [2022-07-12 11:22:52,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-12 11:22:52,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:52,468 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:22:52,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 11:22:52,468 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:52,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1841616438, now seen corresponding path program 1 times [2022-07-12 11:22:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:52,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330033285] [2022-07-12 11:22:52,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:22:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:22:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 11:22:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:22:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:22:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:22:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:22:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 11:22:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 11:22:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-12 11:22:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-12 11:22:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:52,756 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-12 11:22:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:52,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330033285] [2022-07-12 11:22:52,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330033285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:52,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:52,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:22:52,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560659064] [2022-07-12 11:22:52,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:52,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:22:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:52,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:22:52,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:22:52,760 INFO L87 Difference]: Start difference. First operand 2064 states and 2686 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 4 states have internal predecessors, (119), 4 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-12 11:22:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:54,845 INFO L93 Difference]: Finished difference Result 2130 states and 2809 transitions. [2022-07-12 11:22:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:22:54,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 4 states have internal predecessors, (119), 4 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 263 [2022-07-12 11:22:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:54,853 INFO L225 Difference]: With dead ends: 2130 [2022-07-12 11:22:54,854 INFO L226 Difference]: Without dead ends: 2120 [2022-07-12 11:22:54,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:54,856 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 1346 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 731 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:54,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 2378 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 11:22:54,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-07-12 11:22:54,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2064. [2022-07-12 11:22:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1466 states have (on average 1.218281036834925) internal successors, (1786), 1503 states have internal predecessors, (1786), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-12 11:22:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2685 transitions. [2022-07-12 11:22:54,925 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2685 transitions. Word has length 263 [2022-07-12 11:22:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:54,925 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2685 transitions. [2022-07-12 11:22:54,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 4 states have internal predecessors, (119), 4 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-12 11:22:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2685 transitions. [2022-07-12 11:22:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-12 11:22:54,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:54,928 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:22:54,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 11:22:54,928 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:54,928 INFO L85 PathProgramCache]: Analyzing trace with hash 810198159, now seen corresponding path program 1 times [2022-07-12 11:22:54,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:54,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946843942] [2022-07-12 11:22:54,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:55,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:55,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:22:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:22:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 11:22:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:22:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:22:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:22:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:22:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 11:22:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 11:22:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-12 11:22:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-12 11:22:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-12 11:22:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:55,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946843942] [2022-07-12 11:22:55,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946843942] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:55,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174868011] [2022-07-12 11:22:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:55,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:55,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:55,322 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:55,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:22:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 3081 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:22:56,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-12 11:22:56,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:56,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174868011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:56,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:56,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-12 11:22:56,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658677259] [2022-07-12 11:22:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:56,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:22:56,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:56,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:22:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:56,177 INFO L87 Difference]: Start difference. First operand 2064 states and 2685 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:22:56,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:56,394 INFO L93 Difference]: Finished difference Result 3806 states and 4963 transitions. [2022-07-12 11:22:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:22:56,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 268 [2022-07-12 11:22:56,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:56,401 INFO L225 Difference]: With dead ends: 3806 [2022-07-12 11:22:56,401 INFO L226 Difference]: Without dead ends: 2068 [2022-07-12 11:22:56,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:56,405 INFO L413 NwaCegarLoop]: 898 mSDtfsCounter, 373 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:56,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1506 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:22:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-07-12 11:22:56,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2064. [2022-07-12 11:22:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1466 states have (on average 1.2169167803547067) internal successors, (1784), 1503 states have internal predecessors, (1784), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-12 11:22:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2683 transitions. [2022-07-12 11:22:56,514 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2683 transitions. Word has length 268 [2022-07-12 11:22:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:56,515 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2683 transitions. [2022-07-12 11:22:56,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:22:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2683 transitions. [2022-07-12 11:22:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-12 11:22:56,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:56,519 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:22:56,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:56,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:56,734 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 589418021, now seen corresponding path program 1 times [2022-07-12 11:22:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:56,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413731352] [2022-07-12 11:22:56,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:22:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 11:22:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:22:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:22:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:22:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 11:22:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 11:22:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:22:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-12 11:22:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:22:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-12 11:22:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:56,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 11:22:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:22:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-12 11:22:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-12 11:22:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-12 11:22:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-12 11:22:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-12 11:22:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-12 11:22:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-12 11:22:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-12 11:22:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-12 11:22:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,088 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-12 11:22:57,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:57,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413731352] [2022-07-12 11:22:57,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413731352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:57,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092149803] [2022-07-12 11:22:57,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:57,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:57,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:57,090 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:57,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 11:22:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:57,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 11:22:57,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-07-12 11:22:58,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:58,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092149803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:58,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:58,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-12 11:22:58,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76229315] [2022-07-12 11:22:58,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:58,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:22:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:58,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:22:58,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:22:58,030 INFO L87 Difference]: Start difference. First operand 2064 states and 2683 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-12 11:22:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:58,199 INFO L93 Difference]: Finished difference Result 3810 states and 4981 transitions. [2022-07-12 11:22:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:58,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 288 [2022-07-12 11:22:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:58,206 INFO L225 Difference]: With dead ends: 3810 [2022-07-12 11:22:58,206 INFO L226 Difference]: Without dead ends: 2072 [2022-07-12 11:22:58,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:22:58,210 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 30 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:58,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1913 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:22:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-12 11:22:58,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-12 11:22:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1473 states have (on average 1.2165648336727766) internal successors, (1792), 1510 states have internal predecessors, (1792), 438 states have call successors, (438), 157 states have call predecessors, (438), 160 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-12 11:22:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2691 transitions. [2022-07-12 11:22:58,277 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2691 transitions. Word has length 288 [2022-07-12 11:22:58,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:58,277 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2691 transitions. [2022-07-12 11:22:58,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-12 11:22:58,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2691 transitions. [2022-07-12 11:22:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-12 11:22:58,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:58,280 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:22:58,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:58,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 11:22:58,494 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:58,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1005655303, now seen corresponding path program 1 times [2022-07-12 11:22:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:58,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462962063] [2022-07-12 11:22:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:22:59,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 11:23:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 11:23:02,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 11:23:02,273 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 11:23:02,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 11:23:02,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 11:23:02,279 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:02,283 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 11:23:02,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 11:23:02 BoogieIcfgContainer [2022-07-12 11:23:02,493 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 11:23:02,494 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 11:23:02,494 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 11:23:02,494 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 11:23:02,495 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:56" (3/4) ... [2022-07-12 11:23:02,497 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 11:23:02,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 11:23:02,497 INFO L158 Benchmark]: Toolchain (without parser) took 69468.17ms. Allocated memory was 107.0MB in the beginning and 826.3MB in the end (delta: 719.3MB). Free memory was 61.5MB in the beginning and 387.2MB in the end (delta: -325.7MB). Peak memory consumption was 391.9MB. Max. memory is 16.1GB. [2022-07-12 11:23:02,498 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:23:02,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1345.25ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 61.3MB in the beginning and 68.6MB in the end (delta: -7.3MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. [2022-07-12 11:23:02,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.30ms. Allocated memory is still 192.9MB. Free memory was 68.6MB in the beginning and 140.1MB in the end (delta: -71.5MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-07-12 11:23:02,501 INFO L158 Benchmark]: Boogie Preprocessor took 126.75ms. Allocated memory is still 192.9MB. Free memory was 140.1MB in the beginning and 127.5MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:23:02,502 INFO L158 Benchmark]: RCFGBuilder took 1656.61ms. Allocated memory is still 192.9MB. Free memory was 127.5MB in the beginning and 69.4MB in the end (delta: 58.2MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. [2022-07-12 11:23:02,502 INFO L158 Benchmark]: TraceAbstraction took 66217.22ms. Allocated memory was 192.9MB in the beginning and 826.3MB in the end (delta: 633.3MB). Free memory was 69.4MB in the beginning and 387.2MB in the end (delta: -317.8MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB. [2022-07-12 11:23:02,502 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 826.3MB. Free memory is still 387.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:23:02,506 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.14ms. Allocated memory is still 107.0MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1345.25ms. Allocated memory was 107.0MB in the beginning and 192.9MB in the end (delta: 86.0MB). Free memory was 61.3MB in the beginning and 68.6MB in the end (delta: -7.3MB). Peak memory consumption was 80.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.30ms. Allocated memory is still 192.9MB. Free memory was 68.6MB in the beginning and 140.1MB in the end (delta: -71.5MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 126.75ms. Allocated memory is still 192.9MB. Free memory was 140.1MB in the beginning and 127.5MB in the end (delta: 12.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1656.61ms. Allocated memory is still 192.9MB. Free memory was 127.5MB in the beginning and 69.4MB in the end (delta: 58.2MB). Peak memory consumption was 98.0MB. Max. memory is 16.1GB. * TraceAbstraction took 66217.22ms. Allocated memory was 192.9MB in the beginning and 826.3MB in the end (delta: 633.3MB). Free memory was 69.4MB in the beginning and 387.2MB in the end (delta: -317.8MB). Peak memory consumption was 361.7MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 826.3MB. Free memory is still 387.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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: 6946]: 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 6635, overapproximation of bitwiseOr at line 5696, overapproximation of shiftLeft at line 5141, overapproximation of bitwiseAnd at line 4928. Possible FailurePath: [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6270] static struct lock_class_key __key___9 ; [L6271] static struct lock_class_key __key___10 ; [L6272] static struct lock_class_key __key___11 ; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6763] int LDV_IN_INTERRUPT ; [L6764] static int res_catc_open_15 ; [L6765] static int res_catc_stop_16 ; [L6766] static int res_catc_probe_17 ; [L6959] int ldv_urb_state = 0; [L6960] int ldv_coherent_state = 0; VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 [L6783] FCALL ldv_initialize() [L6784] CALL, EXPR catc_init() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L6718] CALL, EXPR usb_register(& catc_driver) [L5088] int tmp___7 ; [L5091] CALL, EXPR usb_register_driver(driver, & __this_module, "catc") [L7209] return __VERIFIER_nondet_int(); [L5091] RET, EXPR usb_register_driver(driver, & __this_module, "catc") [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [\result=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver={32:0}, driver={32:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6718] RET, EXPR usb_register(& catc_driver) [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [\result=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6784] RET, EXPR catc_init() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_init()=0, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6793] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___9=1] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6897] CALL, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L6291] CALL, EXPR interface_to_usbdev(intf) [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [\result={-8:172}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __mptr={-8:303}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] RET, EXPR interface_to_usbdev(intf) [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L6293-L6294] CALL, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] RET, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L6304] CALL, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L7117] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(size)=2416, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=70119, \old(arg1)=1, \old(arg2)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arg0=70119, arg1=1, arg2=1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={33:0}, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] RET, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, usbdev={-8:172}] [L6311] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={33:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={33:-47}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={33:0}, dev={33:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, netdev_priv((struct net_device const *)netdev)={33:-47}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, usbdev={-8:172}] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6320] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6323] CALL spinlock_check(& catc->tx_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:-7}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:-7}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:-7}, lock={33:-7}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6323] RET spinlock_check(& catc->tx_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->tx_lock)={33:-7}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6326] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6329-L6330] FCALL __raw_spin_lock_init(& catc->tx_lock.__annonCompField18.rlock, "&(&catc->tx_lock)->rlock", & __key___9) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6343] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6346] CALL spinlock_check(& catc->ctrl_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:57}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:57}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:57}, lock={33:57}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6346] RET spinlock_check(& catc->ctrl_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->ctrl_lock)={33:57}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6349] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6352-L6353] FCALL __raw_spin_lock_init(& catc->ctrl_lock.__annonCompField18.rlock, "&(&catc->ctrl_lock)->rlock", & __key___10) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6366] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6369] FCALL init_timer_key(& catc->timer, "&catc->timer", & __key___11) [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6379] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-10:0}, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-10:0}, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-10:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-10:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \result={-10:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-10:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-10:0}] [L6379] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-10:0}, usbdev={-8:172}] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L6380] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-5:0}, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-5:0}, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-5:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, \result={-5:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-5:0}] [L6380] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-5:0}, usbdev={-8:172}] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L6381] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=2, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-6:0}, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-6:0}, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, \result={-6:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L6381] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-6:0}, usbdev={-8:172}] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L6382] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=3, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-8:0}, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-8:0}, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-8:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, \result={-8:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-8:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L6382] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-8:0}, usbdev={-8:172}] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->ctrl_urb={-10:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->tx_urb={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->rx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->irq_urb={-8:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}, usbdev->descriptor.idVendor=70] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6432] CALL, EXPR __create_pipe(usbdev, 0U) VAL [\old(endpoint)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] RET, EXPR __create_pipe(usbdev, 0U) VAL [__create_pipe(usbdev, 0U)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] EXPR catc->ctrl_urb [L6433-L6435] CALL usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=24, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=0, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:13}, complete_fn={-1:13}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=24, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, setup_packet={0:0}, setup_packet={0:0}, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-10:0}, urb={-10:0}] [L6433-L6435] RET usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L6436] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=32768, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] EXPR catc->tx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->tx_urb={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6437-L6438] CALL usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [\old(buffer_length)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:14}, context={33:-47}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, urb={-5:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=4294967277, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=0, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:14}, complete_fn={-1:14}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967277, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-5:0}, urb={-5:0}] [L6437-L6438] RET usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->tx_urb={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6439] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] EXPR catc->rx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->rx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6440-L6441] CALL usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [\old(buffer_length)=23070, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:15}, context={33:-47}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46261}, urb={-6:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=23070, \old(pipe)=4294967255, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=23070, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:15}, complete_fn={-1:15}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967255, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46261}, transfer_buffer={33:46261}, urb={-6:0}, urb={-6:0}] [L6440-L6441] RET usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->rx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6442] CALL, EXPR __create_pipe(usbdev, 2U) VAL [\old(endpoint)=2, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] RET, EXPR __create_pipe(usbdev, 2U) VAL [__create_pipe(usbdev, 2U)=65536, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] EXPR catc->irq_urb [L6443-L6444] CALL usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=4294967278, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=2, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, dev->speed=4294967299, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967278, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69331}, transfer_buffer={33:69331}, urb={-8:0}, urb={-8:0}] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=4294967278, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=2, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967278, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69331}, transfer_buffer={33:69331}, urb={-8:0}, urb={-8:0}] [L5148] urb->start_frame = -1 VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=4294967278, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=2, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967278, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69331}, transfer_buffer={33:69331}, urb={-8:0}, urb={-8:0}] [L6443-L6444] RET usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L6446] EXPR catc->is_f5u011 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->is_f5u011=75, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6607] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [\old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, \result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L6607] RET catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0)=-1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6608] EXPR netdev->dev_addr VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551591:18446744073709551634}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6608-L6609] CALL catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [\old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5686] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __create_pipe(catc->usbdev, 0U)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5705] return (tmp___11); VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, \result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L6608-L6609] RET catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6)=-1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551591:18446744073709551634}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6612] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6622-L6623] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [\old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __create_pipe(catc->usbdev, 0U)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, \result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L6622-L6623] RET catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2)=-1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6627] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6634] catc->is_f5u011 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->is_f5u011=75, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___14={21:0}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L6642] CALL usb_set_intfdata(intf, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L5059] CALL dev_set_drvdata(& intf->dev, data) [L7138] return __VERIFIER_nondet_int(); [L5059] RET dev_set_drvdata(& intf->dev, data) [L6642] RET usb_set_intfdata(intf, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___14={21:0}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6643] netdev->dev.parent = & intf->dev [L6644] CALL, EXPR register_netdev(netdev) [L7187] return __VERIFIER_nondet_int(); [L6644] RET, EXPR register_netdev(netdev) [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [\result=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___14={21:0}, tmp___15=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6897] RET, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6898] FCALL ldv_check_return_value(res_catc_probe_17) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6793] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6854] CALL, EXPR catc_open(var_group1) [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6183] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={18446744073709551641:-3}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={18446744073709551641:-83}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={18446744073709551641:-3}, dev={18446744073709551641:-3}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6183] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, netdev_priv((struct net_device const *)netdev)={18446744073709551641:-83}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={18446744073709551641:-83}, catc->irq_urb={18446744073709551641:74}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551641:-83}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6186] CALL, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [\old(arg1)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arg0={18446744073709551641:74}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L7217] return __VERIFIER_nondet_int(); [L6186] RET, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={18446744073709551641:-83}, catc->irq_urb={18446744073709551641:74}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551641:-83}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usb_submit_urb(catc->irq_urb, 208U)=-1] [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [\result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={18446744073709551641:-83}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, status=-1, tmp___7={18446744073709551641:-83}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6854] RET, EXPR catc_open(var_group1) [L6854] res_catc_open_15 = catc_open(var_group1) [L6855] FCALL ldv_check_return_value(res_catc_open_15) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group1={18446744073709551641:-3}, var_group5={18446744073709551585:73}] [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group1={18446744073709551641:-3}, var_group5={18446744073709551585:73}] [L6934] CALL catc_exit() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6736] FCALL usb_deregister(& catc_driver) [L6934] RET catc_exit() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group1={18446744073709551641:-3}, var_group5={18446744073709551585:73}] [L6938] CALL ldv_check_final_state() [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L7084] CALL ldv_blast_assert() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6946] reach_error() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 548 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.0s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 41.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17886 SdHoareTripleChecker+Valid, 38.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16786 mSDsluCounter, 70155 SdHoareTripleChecker+Invalid, 34.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1632 IncrementalHoareTripleChecker+Unchecked, 54115 mSDsCounter, 7805 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30826 IncrementalHoareTripleChecker+Invalid, 40263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7805 mSolverCounterUnsat, 16040 mSDtfsCounter, 30826 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4774 GetRequests, 4441 SyntacticMatches, 27 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2105occurred in iteration=16, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 368 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 5759 NumberOfCodeBlocks, 5759 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 6880 ConstructedInterpolants, 154 QuantifiedInterpolants, 18409 SizeOfPredicates, 37 NumberOfNonLiveVariables, 27576 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 43 InterpolantComputations, 15 PerfectInterpolantSequences, 4936/5290 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-12 11:23:02,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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.0/usb_urb-drivers-net-usb-catc.ko.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:23:04,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:23:04,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:23:04,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:23:04,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:23:04,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:23:04,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:23:04,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:23:04,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:23:04,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:23:04,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:23:04,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:23:04,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:23:04,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:23:04,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:23:04,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:23:04,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:23:04,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:23:04,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:23:04,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:23:04,262 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:23:04,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:23:04,268 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:23:04,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:23:04,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:23:04,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:23:04,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:23:04,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:23:04,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:23:04,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:23:04,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:23:04,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:23:04,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:23:04,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:23:04,297 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:23:04,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:23:04,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:23:04,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:23:04,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:23:04,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:23:04,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:23:04,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:23:04,302 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 11:23:04,330 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:23:04,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:23:04,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:23:04,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:23:04,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:23:04,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:23:04,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:23:04,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:23:04,332 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:23:04,332 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:23:04,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:23:04,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:23:04,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:23:04,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:23:04,333 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 11:23:04,333 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 11:23:04,333 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 11:23:04,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:23:04,334 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:23:04,334 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:23:04,334 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:23:04,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:23:04,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:23:04,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:23:04,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:23:04,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:23:04,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:23:04,335 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 11:23:04,335 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 11:23:04,335 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:23:04,335 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:23:04,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:23:04,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 11:23:04,336 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-07-12 11:23:04,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:23:04,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:23:04,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:23:04,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:23:04,611 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:23:04,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-12 11:23:04,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30319687/155ae74f82f9451cbfb9581cedea9a23/FLAG360a30449 [2022-07-12 11:23:05,226 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:23:05,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-12 11:23:05,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30319687/155ae74f82f9451cbfb9581cedea9a23/FLAG360a30449 [2022-07-12 11:23:05,685 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a30319687/155ae74f82f9451cbfb9581cedea9a23 [2022-07-12 11:23:05,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:23:05,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:23:05,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:23:05,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:23:05,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:23:05,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:23:05" (1/1) ... [2022-07-12 11:23:05,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2560f806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:05, skipping insertion in model container [2022-07-12 11:23:05,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:23:05" (1/1) ... [2022-07-12 11:23:05,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:23:05,767 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:23:06,613 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-12 11:23:06,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:23:06,707 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 11:23:06,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:23:06,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-12 11:23:06,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:23:06,928 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:23:07,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-12 11:23:07,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:23:07,273 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:23:07,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07 WrapperNode [2022-07-12 11:23:07,273 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:23:07,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:23:07,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:23:07,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:23:07,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,362 INFO L137 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2022-07-12 11:23:07,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:23:07,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:23:07,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:23:07,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:23:07,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:23:07,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:23:07,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:23:07,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:23:07,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (1/1) ... [2022-07-12 11:23:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:23:07,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:23:07,540 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-12 11:23:07,562 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-12 11:23:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 11:23:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 11:23:07,582 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-12 11:23:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-12 11:23:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 11:23:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 11:23:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 11:23:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-12 11:23:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 11:23:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:23:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-12 11:23:07,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:23:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-12 11:23:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-12 11:23:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-12 11:23:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-12 11:23:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-12 11:23:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-12 11:23:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-12 11:23:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-12 11:23:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-12 11:23:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-12 11:23:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:23:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:23:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 11:23:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 11:23:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:23:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:23:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-12 11:23:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-12 11:23:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 11:23:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 11:23:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-12 11:23:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-12 11:23:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-12 11:23:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-12 11:23:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-12 11:23:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-12 11:23:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-12 11:23:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-12 11:23:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-12 11:23:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-12 11:23:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-12 11:23:07,587 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-12 11:23:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 11:23:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 11:23:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-12 11:23:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-12 11:23:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:23:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-12 11:23:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-12 11:23:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-12 11:23:07,590 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-12 11:23:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 11:23:07,590 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 11:23:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:23:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:23:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:23:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-12 11:23:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-12 11:23:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-12 11:23:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-12 11:23:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-12 11:23:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:23:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-12 11:23:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-12 11:23:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-12 11:23:07,592 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-12 11:23:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 11:23:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 11:23:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 11:23:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 11:23:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-12 11:23:07,593 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-12 11:23:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-12 11:23:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 11:23:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-12 11:23:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:23:07,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:23:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:23:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 11:23:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:23:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-12 11:23:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 11:23:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-12 11:23:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-12 11:23:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 11:23:07,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 11:23:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-12 11:23:07,596 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-12 11:23:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-12 11:23:07,596 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-12 11:23:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 11:23:07,597 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 11:23:07,597 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-12 11:23:07,597 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-12 11:23:07,597 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-12 11:23:07,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-12 11:23:07,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-12 11:23:07,597 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 11:23:07,597 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 11:23:07,598 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-12 11:23:07,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:23:07,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:23:07,942 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:23:07,945 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:23:18,169 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-12 11:23:18,295 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:23:18,303 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:23:28,103 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-12 11:23:28,104 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-12 11:23:28,104 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-12 11:23:28,104 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-12 11:23:28,127 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:23:28,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:23:28,142 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-12 11:23:28,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:23:28 BoogieIcfgContainer [2022-07-12 11:23:28,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:23:28,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:23:28,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:23:28,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:23:28,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:23:05" (1/3) ... [2022-07-12 11:23:28,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be4e930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:23:28, skipping insertion in model container [2022-07-12 11:23:28,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:23:07" (2/3) ... [2022-07-12 11:23:28,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be4e930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:23:28, skipping insertion in model container [2022-07-12 11:23:28,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:23:28" (3/3) ... [2022-07-12 11:23:28,150 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-12 11:23:28,158 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:23:28,158 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:23:28,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:23:28,220 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@feb3054, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2337d0b2 [2022-07-12 11:23:28,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:23:28,227 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-07-12 11:23:28,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:23:28,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:28,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:28,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:28,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:28,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2022-07-12 11:23:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:28,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889504459] [2022-07-12 11:23:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:28,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:28,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:28,248 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-12 11:23:28,255 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-12 11:23:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:28,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 11:23:28,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:23:28,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:28,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:28,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889504459] [2022-07-12 11:23:28,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889504459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:28,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:28,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:23:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830919869] [2022-07-12 11:23:28,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:28,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:23:28,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:23:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:23:28,883 INFO L87 Difference]: Start difference. First operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:23:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:29,075 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2022-07-12 11:23:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:23:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 11:23:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:29,093 INFO L225 Difference]: With dead ends: 1076 [2022-07-12 11:23:29,098 INFO L226 Difference]: Without dead ends: 540 [2022-07-12 11:23:29,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:23:29,111 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 301 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:29,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3140 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:23:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-12 11:23:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2022-07-12 11:23:29,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 378 states have (on average 1.216931216931217) internal successors, (460), 386 states have internal predecessors, (460), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-07-12 11:23:29,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2022-07-12 11:23:29,199 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2022-07-12 11:23:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:29,200 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2022-07-12 11:23:29,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:23:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2022-07-12 11:23:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:23:29,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:29,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:29,219 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-12 11:23:29,418 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-12 11:23:29,418 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:29,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2022-07-12 11:23:29,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:29,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607536494] [2022-07-12 11:23:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:29,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:29,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:29,422 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-12 11:23:29,436 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-12 11:23:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:29,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:23:29,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:23:29,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:29,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:29,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607536494] [2022-07-12 11:23:29,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607536494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:29,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:29,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:23:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769624043] [2022-07-12 11:23:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:29,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:23:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:29,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:23:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:23:29,962 INFO L87 Difference]: Start difference. First operand 535 states and 700 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:23:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:30,049 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2022-07-12 11:23:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:23:30,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-12 11:23:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:30,060 INFO L225 Difference]: With dead ends: 1565 [2022-07-12 11:23:30,061 INFO L226 Difference]: Without dead ends: 1048 [2022-07-12 11:23:30,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-12 11:23:30,064 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 676 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:30,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1649 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:23:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-07-12 11:23:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2022-07-12 11:23:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 738 states have (on average 1.2168021680216803) internal successors, (898), 751 states have internal predecessors, (898), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-07-12 11:23:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2022-07-12 11:23:30,147 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2022-07-12 11:23:30,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:30,147 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2022-07-12 11:23:30,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:23:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2022-07-12 11:23:30,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 11:23:30,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:30,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:30,169 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-12 11:23:30,363 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-12 11:23:30,364 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2022-07-12 11:23:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340443481] [2022-07-12 11:23:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:30,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:30,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:30,367 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-12 11:23:30,368 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-12 11:23:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:30,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:23:30,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:23:30,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:30,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:30,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340443481] [2022-07-12 11:23:30,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340443481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:30,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:30,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:23:30,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611100123] [2022-07-12 11:23:30,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:30,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:23:30,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:23:30,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:23:30,861 INFO L87 Difference]: Start difference. First operand 1045 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:23:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:30,879 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2022-07-12 11:23:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:23:30,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-12 11:23:30,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:30,883 INFO L225 Difference]: With dead ends: 1047 [2022-07-12 11:23:30,884 INFO L226 Difference]: Without dead ends: 1036 [2022-07-12 11:23:30,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-12 11:23:30,885 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 678 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 693 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-12 11:23:30,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:23:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-07-12 11:23:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2022-07-12 11:23:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 728 states have (on average 1.2115384615384615) internal successors, (882), 739 states have internal predecessors, (882), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-07-12 11:23:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2022-07-12 11:23:30,911 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2022-07-12 11:23:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:30,911 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2022-07-12 11:23:30,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 11:23:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2022-07-12 11:23:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 11:23:30,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:30,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:30,932 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-12 11:23:31,128 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-12 11:23:31,128 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:31,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:31,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2022-07-12 11:23:31,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:31,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20147589] [2022-07-12 11:23:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:31,131 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-12 11:23:31,132 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-12 11:23:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:31,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 11:23:31,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:23:31,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:31,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:31,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20147589] [2022-07-12 11:23:31,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20147589] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:31,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:31,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:23:31,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969417396] [2022-07-12 11:23:31,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:31,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:23:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:31,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:23:31,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:23:31,661 INFO L87 Difference]: Start difference. First operand 1031 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:23:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:31,733 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2022-07-12 11:23:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:23:31,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-12 11:23:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:31,739 INFO L225 Difference]: With dead ends: 2353 [2022-07-12 11:23:31,739 INFO L226 Difference]: Without dead ends: 1334 [2022-07-12 11:23:31,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-12 11:23:31,743 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 262 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:31,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1302 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:23:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-12 11:23:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2022-07-12 11:23:31,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2338624338624338) internal successors, (1166), 964 states have internal predecessors, (1166), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-07-12 11:23:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2022-07-12 11:23:31,801 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2022-07-12 11:23:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:31,801 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2022-07-12 11:23:31,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:23:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2022-07-12 11:23:31,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-12 11:23:31,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:31,808 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:23:31,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 11:23:32,026 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-12 11:23:32,026 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:32,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:32,027 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2022-07-12 11:23:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:32,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596906148] [2022-07-12 11:23:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:32,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:32,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:32,029 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-12 11:23:32,031 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-12 11:23:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:32,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:23:32,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:23:32,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:32,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:32,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596906148] [2022-07-12 11:23:32,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596906148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:32,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:32,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:23:32,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308653234] [2022-07-12 11:23:32,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:32,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:23:32,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:23:32,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:23:32,581 INFO L87 Difference]: Start difference. First operand 1330 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 11:23:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:32,776 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2022-07-12 11:23:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:23:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-07-12 11:23:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:32,783 INFO L225 Difference]: With dead ends: 2669 [2022-07-12 11:23:32,783 INFO L226 Difference]: Without dead ends: 1343 [2022-07-12 11:23:32,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:32,790 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 12 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:32,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2075 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:23:32,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-12 11:23:32,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2022-07-12 11:23:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 947 states have (on average 1.232312565997888) internal successors, (1167), 967 states have internal predecessors, (1167), 318 states have call successors, (318), 68 states have call predecessors, (318), 67 states have return successors, (319), 311 states have call predecessors, (319), 315 states have call successors, (319) [2022-07-12 11:23:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2022-07-12 11:23:32,828 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2022-07-12 11:23:32,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:32,830 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2022-07-12 11:23:32,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 11:23:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2022-07-12 11:23:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-12 11:23:32,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:32,832 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:23:32,855 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-12 11:23:33,053 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-12 11:23:33,053 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:33,054 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2022-07-12 11:23:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:33,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [375804403] [2022-07-12 11:23:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:33,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:33,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:33,056 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-12 11:23:33,059 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-12 11:23:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:33,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:23:33,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:23:33,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:33,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:33,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [375804403] [2022-07-12 11:23:33,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [375804403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:33,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:33,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:23:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453396144] [2022-07-12 11:23:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:33,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:23:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:23:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:23:33,626 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 11:23:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:33,842 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2022-07-12 11:23:33,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:23:33,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2022-07-12 11:23:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:33,848 INFO L225 Difference]: With dead ends: 2675 [2022-07-12 11:23:33,849 INFO L226 Difference]: Without dead ends: 1346 [2022-07-12 11:23:33,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:23:33,854 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 12 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:33,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2062 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:23:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-07-12 11:23:33,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2022-07-12 11:23:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2317460317460318) internal successors, (1164), 966 states have internal predecessors, (1164), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-07-12 11:23:33,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2022-07-12 11:23:33,890 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2022-07-12 11:23:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:33,891 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2022-07-12 11:23:33,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-12 11:23:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2022-07-12 11:23:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-12 11:23:33,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:33,894 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:23:33,912 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-12 11:23:34,112 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-12 11:23:34,113 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:34,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2022-07-12 11:23:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:34,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992736233] [2022-07-12 11:23:34,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:34,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:34,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:34,115 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-12 11:23:34,116 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-12 11:23:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:34,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:23:34,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:34,868 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-12 11:23:34,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:34,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:34,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992736233] [2022-07-12 11:23:34,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992736233] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:34,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:34,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:23:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645659823] [2022-07-12 11:23:34,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:34,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:23:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:34,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:23:34,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:23:34,871 INFO L87 Difference]: Start difference. First operand 1330 states and 1798 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:23:35,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:35,779 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2022-07-12 11:23:35,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:23:35,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 146 [2022-07-12 11:23:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:35,790 INFO L225 Difference]: With dead ends: 2671 [2022-07-12 11:23:35,790 INFO L226 Difference]: Without dead ends: 1351 [2022-07-12 11:23:35,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:23:35,795 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 13 mSDsluCounter, 2777 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:35,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3479 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 11:23:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-12 11:23:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2022-07-12 11:23:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2305263157894737) internal successors, (1169), 972 states have internal predecessors, (1169), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-07-12 11:23:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2022-07-12 11:23:35,861 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2022-07-12 11:23:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:35,863 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2022-07-12 11:23:35,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 11:23:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2022-07-12 11:23:35,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-12 11:23:35,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:35,865 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:23:35,898 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-12 11:23:36,075 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-12 11:23:36,075 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2022-07-12 11:23:36,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:23:36,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273054645] [2022-07-12 11:23:36,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:36,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:23:36,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:23:36,080 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-12 11:23:36,093 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-12 11:23:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:36,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 11:23:36,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:36,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:23:36,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:23:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-12 11:23:37,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:23:37,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:23:37,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273054645] [2022-07-12 11:23:37,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273054645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:37,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:37,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:23:37,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517657382] [2022-07-12 11:23:37,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:37,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:23:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:23:37,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:23:37,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:23:37,030 INFO L87 Difference]: Start difference. First operand 1337 states and 1808 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:23:39,184 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:40,549 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:42,604 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:44,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:46,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:48,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:50,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:52,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:54,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:56,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:00,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:01,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:03,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:05,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:07,914 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:09,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:11,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:13,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:15,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:15,267 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2022-07-12 11:24:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:24:15,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-07-12 11:24:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:15,273 INFO L225 Difference]: With dead ends: 1399 [2022-07-12 11:24:15,273 INFO L226 Difference]: Without dead ends: 1339 [2022-07-12 11:24:15,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:24:15,274 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:15,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3863 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 14 Unknown, 0 Unchecked, 38.1s Time] [2022-07-12 11:24:15,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-12 11:24:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2022-07-12 11:24:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2284210526315789) internal successors, (1167), 972 states have internal predecessors, (1167), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-07-12 11:24:15,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2022-07-12 11:24:15,310 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2022-07-12 11:24:15,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:15,310 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2022-07-12 11:24:15,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-12 11:24:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2022-07-12 11:24:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:24:15,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:15,312 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:24:15,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 11:24:15,536 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-12 11:24:15,536 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2022-07-12 11:24:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:15,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619499060] [2022-07-12 11:24:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:15,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:15,538 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-12 11:24:15,540 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-12 11:24:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:20,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 11:24:20,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:20,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:24:20,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 11:24:20,861 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:24:20,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:24:20,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:24:20,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:24:21,218 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 11:24:21,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:24:21,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:24:21,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-12 11:24:21,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:24:21,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-12 11:24:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-12 11:24:21,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:24:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-12 11:24:21,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:21,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619499060] [2022-07-12 11:24:21,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619499060] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:24:21,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:24:21,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-07-12 11:24:21,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487360432] [2022-07-12 11:24:21,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:24:21,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:24:21,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:21,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:24:21,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:24:21,840 INFO L87 Difference]: Start difference. First operand 1337 states and 1806 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:24:23,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:25,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:27,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:29,577 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:31,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:34,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:35,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:37,435 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:39,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:41,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:43,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:43,636 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2022-07-12 11:24:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:24:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2022-07-12 11:24:43,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:43,641 INFO L225 Difference]: With dead ends: 2386 [2022-07-12 11:24:43,641 INFO L226 Difference]: Without dead ends: 1008 [2022-07-12 11:24:43,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:24:43,644 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:43,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3974 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 7 Unknown, 101 Unchecked, 21.7s Time] [2022-07-12 11:24:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-07-12 11:24:43,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-07-12 11:24:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 717 states have (on average 1.2259414225941423) internal successors, (879), 734 states have internal predecessors, (879), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-07-12 11:24:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2022-07-12 11:24:43,670 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2022-07-12 11:24:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:43,670 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2022-07-12 11:24:43,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:24:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2022-07-12 11:24:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:24:43,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:43,672 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2022-07-12 11:24:43,696 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-12 11:24:43,883 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-12 11:24:43,885 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:43,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2022-07-12 11:24:43,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:43,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639424806] [2022-07-12 11:24:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:43,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:43,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:43,888 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-12 11:24:43,890 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-12 11:24:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:44,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 11:24:44,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-12 11:24:44,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:24:44,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:44,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639424806] [2022-07-12 11:24:44,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639424806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:44,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:44,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:24:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749582557] [2022-07-12 11:24:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:44,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:24:44,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:24:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:24:44,831 INFO L87 Difference]: Start difference. First operand 1008 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:24:44,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:44,913 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2022-07-12 11:24:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:24:44,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2022-07-12 11:24:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:44,918 INFO L225 Difference]: With dead ends: 1696 [2022-07-12 11:24:44,918 INFO L226 Difference]: Without dead ends: 1011 [2022-07-12 11:24:44,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:24:44,921 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:44,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4125 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:24:44,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-07-12 11:24:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-07-12 11:24:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 720 states have (on average 1.2236111111111112) internal successors, (881), 735 states have internal predecessors, (881), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 223 states have call predecessors, (231), 224 states have call successors, (231) [2022-07-12 11:24:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2022-07-12 11:24:44,964 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2022-07-12 11:24:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:44,964 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2022-07-12 11:24:44,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 11:24:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2022-07-12 11:24:44,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 11:24:44,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:44,966 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2022-07-12 11:24:44,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-12 11:24:45,187 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-12 11:24:45,187 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:45,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2022-07-12 11:24:45,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 11:24:45,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353191595] [2022-07-12 11:24:45,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:24:45,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 11:24:45,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 11:24:45,190 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-12 11:24:45,191 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-12 11:24:46,754 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:24:46,754 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:24:46,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 11:24:46,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-12 11:24:47,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:24:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:24:47,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 11:24:47,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353191595] [2022-07-12 11:24:47,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353191595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:24:47,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:24:47,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-07-12 11:24:47,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552300673] [2022-07-12 11:24:47,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:24:47,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:24:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 11:24:47,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:24:47,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:24:47,975 INFO L87 Difference]: Start difference. First operand 1011 states and 1338 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-07-12 11:24:50,330 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:52,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:54,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:58,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:00,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:02,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:04,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:06,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:08,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:10,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:12,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:14,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:16,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:19,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:22,654 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:24,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:26,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:28,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:30,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:32,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:37,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:39,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:41,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:43,200 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:45,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:47,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:49,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:51,562 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:53,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:55,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:25:58,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:26:00,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:26:02,296 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []